{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:50:48Z","timestamp":1769298648772,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662456071","type":"print"},{"value":"9783662456088","type":"electronic"}],"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_7","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T10:46:39Z","timestamp":1415961999000},"page":"122-141","source":"Crossref","is-referenced-by-count":18,"title":["Using Indistinguishability Obfuscation via UCEs"],"prefix":"10.1007","author":[{"given":"Christina","family":"Brzuska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arno","family":"Mittelbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Ananth, P., Boneh, D., Garg, S., Sahai, A., Zhandry, M.: Differing-inputs obfuscation and applications. Cryptology ePrint Archive, Report 2013\/689 (2013), http:\/\/eprint.iacr.org\/2013\/689"},{"key":"7_CR2","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., Yang, K.: On the (im)possibility of obfuscating programs. J. ACM\u00a059(2), 6:1\u20136:48 (2012), http:\/\/doi.acm.org\/10.1145\/2160158.2160159"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"B. Barak","year":"2001","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 1\u201318. Springer, Heidelberg (2001)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-74143-5_30","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"M. Bellare","year":"2007","unstructured":"Bellare, M., Boldyreva, A., O\u2019Neill, A.: Deterministic and efficiently searchable encryption. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 535\u2013552. Springer, Heidelberg (2007)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-540-85174-5_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"M. Bellare","year":"2008","unstructured":"Bellare, M., Fischlin, M., O\u2019Neill, A., Ristenpart, T.: Deterministic encryption: Definitional equivalences and constructions without random oracles. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 360\u2013378. Springer, Heidelberg (2008)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-642-40084-1_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"M. Bellare","year":"2013","unstructured":"Bellare, M., Hoang, V.T., Keelveedhi, S.: Instantiating random oracles via uCEs. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol.\u00a08043, pp. 398\u2013415. Springer, Heidelberg (2013)"},{"key":"7_CR7","unstructured":"Bellare, M., Hoang, V.T., Keelveedhi, S.: Instantiating random oracles via UCEs. Cryptology ePrint Archive, Report 2013\/424 (2013), http:\/\/eprint.iacr.org\/2013\/424"},{"key":"7_CR8","unstructured":"Bellare, M., Hoang, V.T., Keelveedhi, S.: Personal communication (Semptember 2013)"},{"key":"7_CR9","series-title":"LNCS","volume-title":"ASIACRYPT\u00a02014","author":"M. Bellare","year":"2014","unstructured":"Bellare, M., Stepanovs, I., Tessaro, S.: Poly-many hardcore bits for any one-way function and a framework for differing-inputs obfuscation. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT\u00a02014. LNCS, vol.\u00a08874, Springer, Heidelberg (2014)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-14623-7_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"N. Bitansky","year":"2010","unstructured":"Bitansky, N., Canetti, R.: On strong simulation and composable point obfuscation. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 520\u2013537. Springer, Heidelberg (2010)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-28914-9_11","volume-title":"Theory of Cryptography","author":"N. Bitansky","year":"2012","unstructured":"Bitansky, N., Paneth, O.: Point obfuscation and 3-round zero-knowledge. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 190\u2013208. Springer, Heidelberg (2012)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-85174-5_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"A. Boldyreva","year":"2008","unstructured":"Boldyreva, A., Fehr, S., O\u2019Neill, A.: On notions of security for deterministic encryption, and efficient constructions without random oracles. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 335\u2013359. Springer, Heidelberg (2008)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-42045-0_15","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"D. Boneh","year":"2013","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol.\u00a08270, pp. 280\u2013300. Springer, Heidelberg (2013)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-662-44371-2_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"D. Boneh","year":"2014","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol.\u00a08616, pp. 480\u2013499. Springer, Heidelberg (2014)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-54242-8_3","volume-title":"Theory of Cryptography","author":"E. Boyle","year":"2014","unstructured":"Boyle, E., Chung, K.M., Pass, R.: On extractability obfuscation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol.\u00a08349, pp. 52\u201373. Springer, Heidelberg (2014)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: Krawczyk, H. (ed.) PKC\u00a02014. LNCS, vol. 8383, pp. 501\u2013519. Springer (Mar 2014)","DOI":"10.1007\/978-3-642-54631-0_29"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-662-44371-2_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"C. Brzuska","year":"2014","unstructured":"Brzuska, C., Farshim, P., Mittelbach, A.: Indistinguishability obfuscation and uCEs: The case of computationally unpredictable sources. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol.\u00a08616, pp. 188\u2013205. Springer, Heidelberg (2014)"},{"key":"7_CR18","series-title":"LNCS","volume-title":"ASIACRYPT 2014","author":"C. Brzuska","year":"2014","unstructured":"Brzuska, C., Mittelbach, A.: Indistinguishability obfuscation versus multi-bit point obfuscation with auxiliary input. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol.\u00a08874, Springer, Heidelberg (2014)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Brzuska, C., Mittelbach, A.: Using indistinguishability obfuscation via uces. Cryptology ePrint Archive, Report 2014\/381 (2014), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-662-45608-8_7"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/BFb0052255","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"R. Canetti","year":"1997","unstructured":"Canetti, R.: Towards realizing random oracles: Hash functions that hide all partial information. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 455\u2013469. Springer, Heidelberg (1997)"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-540-78967-3_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"R. Canetti","year":"2008","unstructured":"Canetti, R., Dakdouk, R.R.: Obfuscating point functions with multibit output. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 489\u2013508. Springer, Heidelberg (2008)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited (preliminary version). In: 30th ACM STOC, pp. 209\u2013218. ACM Press (May 1998)","DOI":"10.1145\/276698.276741"},{"issue":"1","key":"7_CR23","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s00145-011-9112-3","volume":"26","author":"D.M. Freeman","year":"2013","unstructured":"Freeman, D.M., Goldreich, O., Kiltz, E., Rosen, A., Segev, G.: More constructions of lossy and correlation-secure trapdoor functions. Journal of Cryptology\u00a026(1), 39\u201374 (2013)","journal-title":"Journal of Cryptology"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/978-3-642-28914-9_33","volume-title":"Theory of Cryptography","author":"B. Fuller","year":"2012","unstructured":"Fuller, B., O\u2019Neill, A., Reyzin, L.: A unified approach to deterministic encryption: New constructions and a connection to computational entropy. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 582\u2013599. Springer, Heidelberg (2012)"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-54242-8_4","volume-title":"Theory of Cryptography","author":"S. Garg","year":"2014","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M.: Two-round secure MPC from indistinguishability obfuscation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol.\u00a08349, pp. 74\u201394. Springer, Heidelberg (2014)"},{"key":"7_CR26","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: 54th FOCS. IEEE Computer Society Press (October 2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-662-44371-2_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"S. Garg","year":"2014","unstructured":"Garg, S., Gentry, C., Halevi, S., Wichs, D.: On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol.\u00a08616, pp. 518\u2013535. Springer, Heidelberg (2014)"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Wichs, D.: On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input. Cryptology ePrint Archive, Report 2013\/860 (June 13, 2014), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-662-44371-2_29"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions (extended abstract). In: 25th FOCS, pp. 464\u2013479. IEEE Computer Society Press (October 1984)","DOI":"10.1109\/SFCS.1984.715949"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-55220-5_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S. Goldwasser","year":"2014","unstructured":"Goldwasser, S., Gordon, S.D., Goyal, V., Jain, A., Katz, J., Liu, F.H., Sahai, A., Shi, E., Zhou, H.S.: Multi-input functional encryption. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol.\u00a08441, pp. 578\u2013602. Springer, Heidelberg (2014)"},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-19571-6_12","volume-title":"Theory of Cryptography","author":"V. Goyal","year":"2011","unstructured":"Goyal, V., O\u2019Neill, A., Rao, V.: Correlated-input secure hash functions. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 182\u2013200. Springer, Heidelberg (2011)"},{"key":"7_CR32","unstructured":"Hofheinz, D.: Fully secure constrained pseudorandom functions using random oracles. Cryptology ePrint Archive, Report 2014\/372 (2014), http:\/\/eprint.iacr.org\/"},{"key":"7_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-55220-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S. Hohenberger","year":"2014","unstructured":"Hohenberger, S., Sahai, A., Waters, B.: Replacing a random oracle: Full domain hash from indistinguishability obfuscation. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol.\u00a08441, pp. 201\u2013220. Springer, Heidelberg (2014)"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 669\u2013684. ACM Press (November 2013)","DOI":"10.1145\/2508859.2516668"},{"key":"7_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-54242-8_5","volume-title":"Theory of Cryptography","author":"T. Matsuda","year":"2014","unstructured":"Matsuda, T., Hanaoka, G.: Chosen ciphertext security via point obfuscation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol.\u00a08349, pp. 95\u2013120. Springer, Heidelberg (2014)"},{"key":"7_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-54631-0_4","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"T. Matsuda","year":"2014","unstructured":"Matsuda, T., Hanaoka, G.: Chosen ciphertext security via UCE. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol.\u00a08383, pp. 56\u201376. Springer, Heidelberg (2014)"},{"key":"7_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/978-3-642-55220-5_33","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A. Mittelbach","year":"2014","unstructured":"Mittelbach, A.: Salvaging indifferentiability in a multi-stage setting. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol.\u00a08441, pp. 603\u2013621. Springer, Heidelberg (2014)"},{"issue":"7","key":"7_CR38","doi-asserted-by":"publisher","first-page":"3058","DOI":"10.1137\/100782929","volume":"39","author":"A. Rosen","year":"2010","unstructured":"Rosen, A., Segev, G.: Chosen-ciphertext security via correlated products. SIAM Journal on Computing\u00a039(7), 3058\u20133088 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR39","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Shmoys, D.B. (ed.) 46th ACM STOC, pp. 475\u2013484. ACM Press (May\/June 2014)","DOI":"10.1145\/2591796.2591825"},{"key":"7_CR40","doi-asserted-by":"crossref","unstructured":"Wichs, D.: Barriers in cryptography with weak, correlated and leaky sources. In: Kleinberg, R.D. (ed.) ITCS 2013, pp. 111\u2013126. ACM (January 2013)","DOI":"10.1145\/2422436.2422451"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T17:55:59Z","timestamp":1747158959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45608-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662456071","9783662456088"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45608-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}