Bootstrapping obfuscators via fast pseudorandom functions

Benny Applebaum

doi:10.1007/978-3-662-45608-8_9

Bootstrapping obfuscators via fast pseudorandom functions

Benny Applebaum^*

^*Corresponding author for this work

School of Electrical Engineering

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

27 Scopus citations

Abstract

We show that it is possible to upgrade an obfuscator for a weak complexity class WEAK into an obfuscator for arbitrary polynomial size circuits, assuming that the class WEAK can compute pseudorandom functions. Specifically, under standard intractability assumptions (e.g., hardness of factoring, Decisional Diffie-Hellman, or Learning with Errors), the existence of obfuscators for NC¹ or even TC⁰ implies the existence of general-purpose obfuscators for P. Previously, such a bootstrapping procedure was known to exist under the assumption that there exists a fully-homomorphic encryption whose decryption algorithm can be computed in WEAK. Our reduction works with respect to virtual black-box obfuscators and relativizes to ideal models.

Original language	English
Title of host publication	Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part II
Editors	Palash Sarkar, Tetsu Iwata
Publisher	Springer Verlag
Pages	162-172
Number of pages	11
ISBN (Electronic)	9783662456071
DOIs	https://doi.org/10.1007/978-3-662-45608-8_9
State	Published - 2014
Event	20th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2014 - Kaoshiung, Taiwan, Province of China Duration: 7 Dec 2014 → 11 Dec 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8874
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	20th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2014
Country/Territory	Taiwan, Province of China
City	Kaoshiung
Period	7/12/14 → 11/12/14

Funding

Funders	Funder number
Check Point Institute for Information Security
German-Israeli Foundation for Scientific Research and Development	1152/2011
Israel Science Foundation	1155/11
Ministry of Science and Technology, Israel	3-9094

Access to Document

10.1007/978-3-662-45608-8_9

Cite this

Applebaum, B. (2014). Bootstrapping obfuscators via fast pseudorandom functions. In P. Sarkar, & T. Iwata (Eds.), Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part II (pp. 162-172). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8874). Springer Verlag. https://doi.org/10.1007/978-3-662-45608-8_9

Applebaum, Benny. / Bootstrapping obfuscators via fast pseudorandom functions. Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part II. editor / Palash Sarkar ; Tetsu Iwata. Springer Verlag, 2014. pp. 162-172 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1bb9086118f04d0a9e4b16dee5afc8b6,

title = "Bootstrapping obfuscators via fast pseudorandom functions",

abstract = "We show that it is possible to upgrade an obfuscator for a weak complexity class WEAK into an obfuscator for arbitrary polynomial size circuits, assuming that the class WEAK can compute pseudorandom functions. Specifically, under standard intractability assumptions (e.g., hardness of factoring, Decisional Diffie-Hellman, or Learning with Errors), the existence of obfuscators for NC1 or even TC0 implies the existence of general-purpose obfuscators for P. Previously, such a bootstrapping procedure was known to exist under the assumption that there exists a fully-homomorphic encryption whose decryption algorithm can be computed in WEAK. Our reduction works with respect to virtual black-box obfuscators and relativizes to ideal models.",

author = "Benny Applebaum",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2014.; 20th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2014 ; Conference date: 07-12-2014 Through 11-12-2014",

year = "2014",

doi = "10.1007/978-3-662-45608-8\_9",

language = "אנגלית",

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

publisher = "Springer Verlag",

pages = "162--172",

editor = "Palash Sarkar and Tetsu Iwata",

booktitle = "Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part II",

address = "גרמניה",

}

Applebaum, B 2014, Bootstrapping obfuscators via fast pseudorandom functions. in P Sarkar & T Iwata (eds), Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part II. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8874, Springer Verlag, pp. 162-172, 20th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2014, Kaoshiung, Taiwan, Province of China, 7/12/14. https://doi.org/10.1007/978-3-662-45608-8_9

Bootstrapping obfuscators via fast pseudorandom functions. / Applebaum, Benny.
Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part II. ed. / Palash Sarkar; Tetsu Iwata. Springer Verlag, 2014. p. 162-172 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8874).

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

TY - GEN

T1 - Bootstrapping obfuscators via fast pseudorandom functions

AU - Applebaum, Benny

PY - 2014

Y1 - 2014

N2 - We show that it is possible to upgrade an obfuscator for a weak complexity class WEAK into an obfuscator for arbitrary polynomial size circuits, assuming that the class WEAK can compute pseudorandom functions. Specifically, under standard intractability assumptions (e.g., hardness of factoring, Decisional Diffie-Hellman, or Learning with Errors), the existence of obfuscators for NC1 or even TC0 implies the existence of general-purpose obfuscators for P. Previously, such a bootstrapping procedure was known to exist under the assumption that there exists a fully-homomorphic encryption whose decryption algorithm can be computed in WEAK. Our reduction works with respect to virtual black-box obfuscators and relativizes to ideal models.

AB - We show that it is possible to upgrade an obfuscator for a weak complexity class WEAK into an obfuscator for arbitrary polynomial size circuits, assuming that the class WEAK can compute pseudorandom functions. Specifically, under standard intractability assumptions (e.g., hardness of factoring, Decisional Diffie-Hellman, or Learning with Errors), the existence of obfuscators for NC1 or even TC0 implies the existence of general-purpose obfuscators for P. Previously, such a bootstrapping procedure was known to exist under the assumption that there exists a fully-homomorphic encryption whose decryption algorithm can be computed in WEAK. Our reduction works with respect to virtual black-box obfuscators and relativizes to ideal models.

UR - https://www.scopus.com/pages/publications/84916195878

U2 - 10.1007/978-3-662-45608-8_9

DO - 10.1007/978-3-662-45608-8_9

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84916195878

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

SP - 162

EP - 172

BT - Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part II

A2 - Sarkar, Palash

A2 - Iwata, Tetsu

PB - Springer Verlag

T2 - 20th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2014

Y2 - 7 December 2014 through 11 December 2014

ER -

Applebaum B. Bootstrapping obfuscators via fast pseudorandom functions. In Sarkar P, Iwata T, editors, Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part II. Springer Verlag. 2014. p. 162-172. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-45608-8_9

Bootstrapping obfuscators via fast pseudorandom functions

Abstract

Publication series

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this