Indistinguishability obfuscation from semantically-secure multilinear encodings

Rafael Pass; Karn Seth; Sidharth Telang

doi:10.1007/978-3-662-44371-2_28

Indistinguishability obfuscation from semantically-secure multilinear encodings

Rafael Pass, Karn Seth, Sidharth Telang

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We define a notion of semantic security of multilinear (a.k.a. graded) encoding schemes, which stipulates security of a class of algebraic "decisional" assumptions: roughly speaking, we require that for every nuPPT distribution D over two constant-length sequences m₀,m ₁ and auxiliary elements z such that all arithmetic circuits (respecting the multilinear restrictions and ending with a zero-test) are constant with overwhelming probability over (m_b, z), b ∈ {0,1}, we have that encodings of m₀, z are computationally indistinguishable from encodings of m₁, z. Assuming the existence of semantically secure multilinear encodings and the LWE assumption, we demonstrate the existence of indistinguishability obfuscators for all polynomial-size circuits.

Original language	English
Title of host publication	Advances in Cryptology, CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings
Publisher	Springer Verlag
Pages	500-517
Number of pages	18
Edition	PART 1
ISBN (Print)	9783662443705
DOIs	https://doi.org/10.1007/978-3-662-44371-2_28
State	Published - 2014
Externally published	Yes
Event	34rd Annual International Cryptology Conference, CRYPTO 2014 - Santa Barbara, CA, United States Duration: 17 Aug 2014 → 21 Aug 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 1
Volume	8616 LNCS

Conference

Conference	34rd Annual International Cryptology Conference, CRYPTO 2014
Country/Territory	United States
City	Santa Barbara, CA
Period	17/08/14 → 21/08/14

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-662-44371-2_28

Cite this

Pass, R., Seth, K., & Telang, S. (2014). Indistinguishability obfuscation from semantically-secure multilinear encodings. In Advances in Cryptology, CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings (PART 1 ed., pp. 500-517). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8616 LNCS, No. PART 1). Springer Verlag. https://doi.org/10.1007/978-3-662-44371-2_28

Pass, Rafael ; Seth, Karn ; Telang, Sidharth. / Indistinguishability obfuscation from semantically-secure multilinear encodings. Advances in Cryptology, CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings. PART 1. ed. Springer Verlag, 2014. pp. 500-517 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).

@inproceedings{0a3c103d3163464c9cfc33c30a604f1d,

title = "Indistinguishability obfuscation from semantically-secure multilinear encodings",

abstract = "We define a notion of semantic security of multilinear (a.k.a. graded) encoding schemes, which stipulates security of a class of algebraic {"}decisional{"} assumptions: roughly speaking, we require that for every nuPPT distribution D over two constant-length sequences m0,m 1 and auxiliary elements z such that all arithmetic circuits (respecting the multilinear restrictions and ending with a zero-test) are constant with overwhelming probability over (mb, z), b ∈ {0,1}, we have that encodings of m0, z are computationally indistinguishable from encodings of m1, z. Assuming the existence of semantically secure multilinear encodings and the LWE assumption, we demonstrate the existence of indistinguishability obfuscators for all polynomial-size circuits.",

author = "Rafael Pass and Karn Seth and Sidharth Telang",

year = "2014",

doi = "10.1007/978-3-662-44371-2_28",

language = "الإنجليزيّة",

isbn = "9783662443705",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

number = "PART 1",

pages = "500--517",

booktitle = "Advances in Cryptology, CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings",

address = "ألمانيا",

edition = "PART 1",

note = "34rd Annual International Cryptology Conference, CRYPTO 2014 ; Conference date: 17-08-2014 Through 21-08-2014",

}

Pass, R, Seth, K & Telang, S 2014, Indistinguishability obfuscation from semantically-secure multilinear encodings. in Advances in Cryptology, CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 8616 LNCS, Springer Verlag, pp. 500-517, 34rd Annual International Cryptology Conference, CRYPTO 2014, Santa Barbara, CA, United States, 17/08/14. https://doi.org/10.1007/978-3-662-44371-2_28

Indistinguishability obfuscation from semantically-secure multilinear encodings. / Pass, Rafael; Seth, Karn; Telang, Sidharth.
Advances in Cryptology, CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings. PART 1. ed. Springer Verlag, 2014. p. 500-517 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8616 LNCS, No. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Indistinguishability obfuscation from semantically-secure multilinear encodings

AU - Pass, Rafael

AU - Seth, Karn

AU - Telang, Sidharth

PY - 2014

Y1 - 2014

N2 - We define a notion of semantic security of multilinear (a.k.a. graded) encoding schemes, which stipulates security of a class of algebraic "decisional" assumptions: roughly speaking, we require that for every nuPPT distribution D over two constant-length sequences m0,m 1 and auxiliary elements z such that all arithmetic circuits (respecting the multilinear restrictions and ending with a zero-test) are constant with overwhelming probability over (mb, z), b ∈ {0,1}, we have that encodings of m0, z are computationally indistinguishable from encodings of m1, z. Assuming the existence of semantically secure multilinear encodings and the LWE assumption, we demonstrate the existence of indistinguishability obfuscators for all polynomial-size circuits.

AB - We define a notion of semantic security of multilinear (a.k.a. graded) encoding schemes, which stipulates security of a class of algebraic "decisional" assumptions: roughly speaking, we require that for every nuPPT distribution D over two constant-length sequences m0,m 1 and auxiliary elements z such that all arithmetic circuits (respecting the multilinear restrictions and ending with a zero-test) are constant with overwhelming probability over (mb, z), b ∈ {0,1}, we have that encodings of m0, z are computationally indistinguishable from encodings of m1, z. Assuming the existence of semantically secure multilinear encodings and the LWE assumption, we demonstrate the existence of indistinguishability obfuscators for all polynomial-size circuits.

UR - http://www.scopus.com/inward/record.url?scp=84905387959&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-44371-2_28

DO - 10.1007/978-3-662-44371-2_28

M3 - منشور من مؤتمر

SN - 9783662443705

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 500

EP - 517

BT - Advances in Cryptology, CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings

PB - Springer Verlag

T2 - 34rd Annual International Cryptology Conference, CRYPTO 2014

Y2 - 17 August 2014 through 21 August 2014

ER -

Pass R, Seth K, Telang S. Indistinguishability obfuscation from semantically-secure multilinear encodings. In Advances in Cryptology, CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings. PART 1 ed. Springer Verlag. 2014. p. 500-517. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). doi: 10.1007/978-3-662-44371-2_28

Indistinguishability obfuscation from semantically-secure multilinear encodings

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this