{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T12:40:09Z","timestamp":1748781609969,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662493861"},{"type":"electronic","value":"9783662493878"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49387-8_6","type":"book-chapter","created":{"date-parts":[[2016,2,17]],"date-time":"2016-02-17T19:25:41Z","timestamp":1455737141000},"page":"129-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes"],"prefix":"10.1007","author":[{"given":"Mohammad","family":"Hajiabadi","sequence":"first","affiliation":[]},{"given":"Bruce M.","family":"Kapron","sequence":"additional","affiliation":[]},{"given":"Venkatesh","family":"Srinivasan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,18]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-642-00457-5_28","volume-title":"Theory of Cryptography","author":"A Akavia","year":"2009","unstructured":"Akavia, A., Goldwasser, S., Vaikuntanathan, V.: Simultaneous hardcore bits and cryptography against memory attacks. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 474\u2013495. Springer, Heidelberg (2009)"},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/978-3-642-13190-5_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"Jo\u00ebl Alwen","year":"2010","unstructured":"Alwen, J., Dodis, Y., Naor, M., Segev, G., Walfish, S., Wichs, D.: Public-key encryption in the bounded-retrieval model. In: Gilbert [21], pp. 113\u2013134"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-642-20465-4_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"B Applebaum","year":"2011","unstructured":"Applebaum, B.: Key-dependent message security: generic amplification and completeness. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 527\u2013546. Springer, Heidelberg (2011)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-03356-8_35","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B Applebaum","year":"2009","unstructured":"Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 595\u2013618. Springer, Heidelberg (2009)"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/978-3-642-13190-5_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"Boaz Barak","year":"2010","unstructured":"Barak, B., Haitner, I., Hofheinz, D., Ishai, Y.: Bounded key-dependent message security. In: Gilbert [21], pp. 423\u2013444"},{"key":"6_CR6","first-page":"85","volume":"2003","author":"M Bellare","year":"2003","unstructured":"Bellare, M., Boldyreva, A., Staddon, J.: Randomness re-use in multi-recipient encryption schemeas. Public Key Crypt.-PKC 2003, 85\u201399 (2003)","journal-title":"Public Key Crypt.-PKC"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-36492-7_6","volume-title":"Selected Areas in Cryptography","author":"J Black","year":"2002","unstructured":"Black, J., Rogaway, P., Shrimpton, T.: Encryption-scheme security in the presence of key-dependent messages. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 62\u201375. Springer, Heidelberg (2002)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-85174-5_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"D Boneh","year":"2008","unstructured":"Boneh, D., Halevi, S., Hamburg, M., Ostrovsky, R.: Circular-secure encryption from decision diffie-hellman. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 108\u2013125. Springer, Heidelberg (2008)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14623-7_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"Z Brakerski","year":"2010","unstructured":"Brakerski, Z., Goldwasser, S.: Circular and leakage resilient public-key encryption under subgroup indistinguishability. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 1\u201320. Springer, Heidelberg (2010)"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/978-3-642-19571-6_13","volume-title":"Theory of Cryptography","author":"Zvika Brakerski","year":"2011","unstructured":"Brakerski, Z., Goldwasser, S., Kalai, Y.T.: Black-box circular-secure encryption beyond affine functions. In: Ishai [28], pp. 201\u2013218"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-642-22792-9_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Segev, G.: Better security for deterministic public-key encryption: the auxiliary-input setting. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 543\u2013560. Springer, Heidelberg (2011)"},{"issue":"20","key":"6_CR12","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1016\/j.ipl.2012.07.012","volume":"112","author":"SG Choi","year":"2012","unstructured":"Choi, S.G., Wee, H.: Lossy trapdoor functions from homomorphic reproducible encryption. Inf. Process. Lett. 112(20), 794\u2013798 (2012)","journal-title":"Inf. Process. Lett."},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"R Cramer","year":"2002","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 45\u201364. Springer, Heidelberg (2002)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-11799-2_22","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2010","unstructured":"Dodis, Y., Goldwasser, S., Tauman Kalai, Y., Peikert, C., Vaikuntanathan, V.: Public-key encryption schemes with auxiliary inputs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 361\u2013381. Springer, Heidelberg (2010)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Kalai, Y.T., Lovett, S.: On cryptography with auxiliary input. In: STOC 2009, pp. 621\u2013630 (2009)","DOI":"10.1145\/1536414.1536498"},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography (extended abstract). In: STOC 1991, pp. 542\u2013552 (1991)","DOI":"10.1145\/103418.103474"},{"key":"6_CR18","unstructured":"Dwork, C. (ed.): Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada. ACM, 17\u201320 May 2008"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: FOCS 2008, pp. 293\u2013302 (2008)","DOI":"10.1109\/FOCS.2008.56"},{"key":"6_CR20","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Dwork [18], pp. 197\u2013206"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","year":"2010","unstructured":"Gilbert, H. (ed.): EUROCRYPT 2010. LNCS, vol. 6110. Springer, Heidelberg (2010)"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Johnson, D.S. (ed.) Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 25\u201332, Seattle, Washigton, USA. ACM, 14\u201317 May 1989","DOI":"10.1145\/73007.73010"},{"issue":"2","key":"6_CR23","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Hajiabadi, M., Kapron, B.M., Srinivasan, V.: On generic constructions of circularly-secure, leakage-resilient public-key encryption schemes. IACR Cryptology ePrint Archive 2015, p. 741 (2015)","DOI":"10.1007\/978-3-662-49387-8_6"},{"key":"6_CR25","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/978-3-642-19571-6_8","volume-title":"Theory of Cryptography","author":"Shai Halevi","year":"2011","unstructured":"Halevi, S., Lin, H.: After-the-fact leakage in public-key encryption. In: Ishai [28], pp. 107\u2013124"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-38348-9_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"C Hazay","year":"2013","unstructured":"Hazay, C., L\u00f3pez-Alt, A., Wee, H., Wichs, D.: Leakage-resilient cryptography from minimal assumptions. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 160\u2013176. Springer, Heidelberg (2013)"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-78967-3_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"D Hofheinz","year":"2008","unstructured":"Hofheinz, D., Unruh, D.: Towards key-dependent message security in the standard model. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 108\u2013126. Springer, Heidelberg (2008)"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","volume-title":"Theory of Cryptography","year":"2011","unstructured":"Ishai, Y. (ed.): TCC 2011. LNCS, vol. 6597. Springer, Heidelberg (2011)"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-642-01001-9_34","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"E Kiltz","year":"2009","unstructured":"Kiltz, E., Pietrzak, K., Stam, M., Yung, M.: A new randomness extraction paradigm for hybrid encryption. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 590\u2013609. Springer, Heidelberg (2009)"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/978-3-662-46497-7_15","volume-title":"Theory of Cryptography","author":"V Koppula","year":"2015","unstructured":"Koppula, V., Ramchen, K., Waters, B.: Separations in circular security for arbitrary length key cycles. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part II. LNCS, vol. 9015, pp. 378\u2013400. Springer, Heidelberg (2015)"},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-20465-4_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"T Malkin","year":"2011","unstructured":"Malkin, T., Teranishi, I., Yung, M.: Efficient circuit-size independent public key encryption with KDM security. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 507\u2013526. Springer, Heidelberg (2011)"},{"key":"6_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-24638-1_16","volume-title":"Theory of Cryptography","author":"S Micali","year":"2004","unstructured":"Micali, S., Reyzin, L.: Physically observable cryptography. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 278\u2013296. Springer, Heidelberg (2004)"},{"key":"6_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/3-540-48910-X_23","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"M Naor","year":"1999","unstructured":"Naor, M., Pinkas, B., Reingold, O.: Distributed pseudo-random functions and KDCs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 327\u2013346. Springer, Heidelberg (1999)"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Naor, M., Reingold, O.: Synthesizers and their application to the parallel construction of pseudo-random functions. J. Comput. Syst. Sci. 58(2) (1999)","DOI":"10.1006\/jcss.1998.1618"},{"issue":"4","key":"6_CR35","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1137\/100813464","volume":"41","author":"M Naor","year":"2012","unstructured":"Naor, M., Segev, G.: Public-key cryptosystems resilient to key leakage. SIAM J. Comput. 41(4), 772\u2013814 (2012)","journal-title":"SIAM J. Comput."},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: STOC 1990, pp. 427\u2013437 (1990)","DOI":"10.1145\/100216.100273"},{"key":"6_CR37","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Dwork [18], pp. 187\u2013196"},{"key":"6_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"C Rackoff","year":"1992","unstructured":"Rackoff, C., Simon, D.R.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 433\u2013444. Springer, Heidelberg (1992)"},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC 2005, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"6_CR40","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-642-19571-6_14","volume-title":"Theory of Cryptography","author":"Ron Rothblum","year":"2011","unstructured":"Rothblum, R.: Homomorphic encryption: from private-key to public-key. In: Ishai [28], pp. 219\u2013234"},{"key":"6_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/978-3-642-36594-2_32","volume-title":"Theory of Cryptography","author":"RD Rothblum","year":"2013","unstructured":"Rothblum, R.D.: On the circular security of bit-encryption. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 579\u2013598. Springer, Heidelberg (2013)"},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"Wee, H.: KDM-security via homomorphic smooth projective hashing. IACR Cryptology ePrint Archive 2015, p. 721 (2015)","DOI":"10.1007\/978-3-662-49387-8_7"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49387-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T12:12:29Z","timestamp":1748779949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49387-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662493861","9783662493878"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49387-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"18 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}