{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T18:31:16Z","timestamp":1794421876712,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642300561","type":"print"},{"value":"9783642300578","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30057-8_20","type":"book-chapter","created":{"date-parts":[[2012,5,18]],"date-time":"2012-05-18T13:05:50Z","timestamp":1337346350000},"page":"334-352","source":"Crossref","is-referenced-by-count":58,"title":["Circular and KDM Security for Identity-Based Encryption"],"prefix":"10.1007","author":[{"given":"Jacob","family":"Alperin-Sheriff","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chris","family":"Peikert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/11555827_22","volume-title":"Computer Security \u2013 ESORICS 2005","author":"P. Ad\u00e3o","year":"2005","unstructured":"Ad\u00e3o, P., Bana, G., Herzog, J., Scedrov, A.: Soundness of Formal Encryption in the Presence of Key-Cycles. In: de Capitani di Vimercati, S., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol.\u00a03679, pp. 374\u2013396. Springer, Heidelberg (2005)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-642-13190-5_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S. Agrawal","year":"2010","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient Lattice (H)IBE in the Standard Model. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 553\u2013572. Springer, Heidelberg (2010)"},{"key":"20_CR3","first-page":"1","volume":"13","author":"M. Ajtai","year":"2004","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. Quaderni di Matematica\u00a013, 1\u201332 (2004); Preliminary version in STOC 1996","journal-title":"Quaderni di Matematica"},{"key":"20_CR4","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.\u00a06632, pp. 527\u2013546. Springer, Heidelberg (2011)"},{"key":"20_CR5","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.\u00a05677, pp. 595\u2013618. Springer, Heidelberg (2009)"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-13190-5_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"B. Barak","year":"2010","unstructured":"Barak, B., Haitner, I., Hofheinz, D., Ishai, Y.: Bounded Key-Dependent Message Security. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 423\u2013444. Springer, Heidelberg (2010)"},{"key":"20_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":"2003","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.\u00a02595, pp. 62\u201375. Springer, Heidelberg (2003)"},{"issue":"5","key":"20_CR8","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1137\/S009753970544713X","volume":"36","author":"D. Boneh","year":"2007","unstructured":"Boneh, D., Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. SIAM J. Comput.\u00a036(5), 1301\u20131328 (2007)","journal-title":"SIAM J. Comput."},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a05157, pp. 108\u2013125. Springer, Heidelberg (2008)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","first-page":"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 - (or: Quadratic Residuosity Strikes Back). In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 1\u201320. Springer, Heidelberg (2010)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-19571-6_13","volume-title":"Theory of Cryptography","author":"Z. Brakerski","year":"2011","unstructured":"Brakerski, Z., Goldwasser, S., Kalai, Y.T.: Black-Box Circular-Secure Encryption beyond Affine Functions. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 201\u2013218. Springer, Heidelberg (2011)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z. Brakerski","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 505\u2013524. Springer, Heidelberg (2011)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"J. Camenisch","year":"2001","unstructured":"Camenisch, J., Lysyanskaya, A.: An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 93\u2013118. Springer, Heidelberg (2001)"},{"issue":"3","key":"20_CR14","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s00145-006-0442-5","volume":"20","author":"R. Canetti","year":"2007","unstructured":"Canetti, R., Halevi, S., Katz, J.: A Forward-Secure Public-key Encryption Scheme. J. Cryptology 20(3), 265\u2013294 (2007); Preliminary version in EUROCRYPT 2003","journal-title":"J. Cryptology"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11745853_16","volume-title":"Public Key Cryptography - PKC 2006","author":"S. Chatterjee","year":"2006","unstructured":"Chatterjee, S., Sarkar, P.: Generalization of the Selective-ID Security Model for HIBE Protocols. In: Yung, M., et al. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 241\u2013256. Springer, Heidelberg (2006)"},{"issue":"4","key":"20_CR16","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1137\/S0895480192224713","volume":"7","author":"Y. Desmedt","year":"1994","unstructured":"Desmedt, Y., Frankel, Y.: Perfect homomorphic zero-knowledge threshold schemes over any finite abelian group. SIAM J. Discrete Math.\u00a07(4), 667\u2013679 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"20_CR17","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.\u00a05978, pp. 361\u2013381. Springer, Heidelberg (2010)"},{"key":"20_CR18","unstructured":"Fehr, S.: Span programs over rings and how to share a secret from a module. Master\u2019s thesis, ETH Zurich, Institute for Theoretical Computer Science (1998)"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"20_CR21","unstructured":"Goldwasser, S., Kalai, Y.T., Peikert, C., Vaikuntanathan, V.: Robustness of the learning with errors assumption. In: ICS, pp. 230\u2013240 (2010)"},{"issue":"2","key":"20_CR22","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1982","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci.\u00a028(2), 270\u2013299 (1982); Preliminary version in STOC 1982","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-00457-5_13","volume-title":"Theory of Cryptography","author":"I. Haitner","year":"2009","unstructured":"Haitner, I., Holenstein, T.: On the (Im)Possibility of Key Dependent Encryption. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 202\u2013219. Springer, Heidelberg (2009)"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/978-3-642-25385-0_4","volume-title":"ASIACRYPT","author":"B. Hemenway","year":"2011","unstructured":"Hemenway, B., Libert, B., Ostrovsky, R., Vergnaud, D.: Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security. In: Lee, D.H. (ed.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 70\u201388. Springer, Heidelberg (2011)"},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-19074-2_21","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"R. Lindner","year":"2011","unstructured":"Lindner, R., Peikert, C.: Better Key Sizes (and Attacks) for LWE-Based Encryption. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol.\u00a06558, pp. 319\u2013339. Springer, Heidelberg (2011)"},{"key":"20_CR26","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.\u00a06632, pp. 507\u2013526. Springer, Heidelberg (2011)"},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/978-3-642-22792-9_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"D. Micciancio","year":"2011","unstructured":"Micciancio, D., Mol, P.: Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 465\u2013484. Springer, Heidelberg (2011)"},{"key":"20_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D. Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 700\u2013718. Springer, Heidelberg (2012)"},{"issue":"1","key":"20_CR29","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D. Micciancio","year":"2004","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput.\u00a037(1), 267\u2013302 (2004); Preliminary version in FOCS 2004","journal-title":"SIAM J. Comput."},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Post Quantum Cryptography, pp. 147\u2013191. Springer (February 2009)","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/978-3-642-22792-9_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"A. O\u2019Neill","year":"2011","unstructured":"O\u2019Neill, A., Peikert, C., Waters, B.: Bi-Deniable Public-Key Encryption. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 525\u2013542. Springer, Heidelberg (2011)"},{"key":"20_CR32","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem. In: STOC, pp. 333\u2013342 (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"20_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/978-3-642-14623-7_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C. Peikert","year":"2010","unstructured":"Peikert, C.: An Efficient and Parallel Gaussian Sampler for Lattices. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 80\u201397. Springer, Heidelberg (2010)"},{"issue":"6","key":"20_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O. Regev","year":"2005","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM\u00a056(6), 1\u201340 (2005); Preliminary version in STOC 2005","journal-title":"J. ACM"},{"key":"20_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-39568-7_5","volume-title":"Advances in Cryptology","author":"A. Shamir","year":"1985","unstructured":"Shamir, A.: Identity-Based Cryptosystems and Signature Schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 47\u201353. Springer, Heidelberg (1985)"},{"key":"20_CR36","unstructured":"Vershynin, R.: Introduction to the non-asymptotic analysis of random matrices (January 2011), \n                    \n                      http:\/\/www-personal.umich.edu\/~romanv\/papers\/non-asymptotic-rmt-plain.pdf\n                    \n                    \n                   (last accessed February 4, 2011)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30057-8_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:26:02Z","timestamp":1620113162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30057-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642300561","9783642300578"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30057-8_20","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-30057-8","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}