{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:06:10Z","timestamp":1765112770413,"version":"3.40.5"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662456071"},{"type":"electronic","value":"9783662456088"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45608-8_9","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T10:46:39Z","timestamp":1415961999000},"page":"162-172","source":"Crossref","is-referenced-by-count":27,"title":["Bootstrapping Obfuscators via Fast Pseudorandom Functions"],"prefix":"10.1007","author":[{"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-20728-0_3","volume-title":"Information Theoretic Security","author":"B. Applebaum","year":"2011","unstructured":"Applebaum, B.: Randomly encoding functions: A new cryptographic paradigm. In: Fehr, S. (ed.) ICITS 2011. LNCS, vol.\u00a06673, pp. 25\u201331. Springer, Heidelberg (2011)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Applebaum, B.: Cryptography in Constant Parallel Time. Springer Publishing Company, Incorporated (2014)","DOI":"10.1007\/978-3-642-17367-7"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. Computional Complexity, 15(2), 115\u2013162 (2006)","DOI":"10.1007\/s00037-006-0211-8"},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1137\/S0097539705446950","volume":"36","author":"B. Applebaum","year":"2006","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC0. SIAM J. Comput.\u00a036(4), 845\u2013888 (2006)","journal-title":"SIAM J. Comput."},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-29011-4_42","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A. Banerjee","year":"2012","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 719\u2013737. Springer, Heidelberg (2012)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-55220-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"B. Barak","year":"2014","unstructured":"Barak, B., Garg, S., Kalai, Y.T., Paneth, O., Sahai, A.: Protecting obfuscation against algebraic attacks. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol.\u00a08441, pp. 221\u2013238. Springer, Heidelberg (2014)"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2160158.2160159","volume":"59","author":"B. Barak","year":"2012","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (im)possibility of obfuscating programs. J. of the ACM\u00a059(2), 6 (2012)","journal-title":"J. of the ACM"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-54242-8_1","volume-title":"Theory of Cryptography","author":"Z. Brakerski","year":"2014","unstructured":"Brakerski, Z., Rothblum, G.N.: Virtual black-box obfuscation for all circuits via generic graded encoding. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol.\u00a08349, pp. 1\u201325. Springer, Heidelberg (2014)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS (2011)","DOI":"10.1109\/FOCS.2011.12"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS, pp. 40\u201349 (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-36594-2_7","volume-title":"Theory of Cryptography","author":"C. Gentry","year":"2013","unstructured":"Gentry, C.: Encrypted messages from the heights of cryptomania. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 120\u2013121. Springer, Heidelberg (2013)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. of the ACM\u00a033, 792\u2013807 (1986)","journal-title":"J. of the ACM"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-32009-5_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"S. Gorbunov","year":"2012","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Functional encryption with bounded collusions via multi-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 162\u2013179. Springer, Heidelberg (2012)"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1137\/100814421","volume":"42","author":"I. Haitner","year":"2013","unstructured":"Haitner, I., Reingold, O., Vadhan, S.P.: Efficiency improvements in constructing pseudorandom generators from one-way functions. SIAM J. Comput\u00a042(3), 1405\u20131430 (2013)","journal-title":"SIAM J. Comput"},{"key":"9_CR16","series-title":"Cryptology and Information Security Series","first-page":"222","volume-title":"Secure Multi-Party Computation","author":"Y. Ishai","year":"2012","unstructured":"Ishai, Y.: Randomization techniques for secure computation. In: Prabhakaran, M., Sahai, A. (eds.) Secure Multi-Party Computation. Cryptology and Information Security Series, vol.\u00a010, pp. 222\u2013248. IOS press, Amsterdam (2012)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: A new representation with applications to round-efficient secure computation. In: IEEE 41st Annual Symposium on Foundations of Computer Science, FOCS, pp. 294\u2013304 (2000)","DOI":"10.1109\/SFCS.2000.892118"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/972639.972643","volume":"51","author":"M. Naor","year":"2004","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. J. of the ACM\u00a051(2), 231\u2013262 (2004)","journal-title":"J. of the ACM"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: Deniable encryption, and more. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC, pp. 475\u2013484 (2014)","DOI":"10.1145\/2591796.2591825"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45608-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T17:55:57Z","timestamp":1747158957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45608-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662456071","9783662456088"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45608-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}