{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T05:49:31Z","timestamp":1771480171090,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642320088","type":"print"},{"value":"9783642320095","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32009-5_44","type":"book-chapter","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T06:40:28Z","timestamp":1344235228000},"page":"758-775","source":"Crossref","is-referenced-by-count":127,"title":["Secure Identity-Based Encryption in the Quantum Random Oracle Model"],"prefix":"10.1007","author":[{"given":"Mark","family":"Zhandry","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: Quantum Copy-Protection and Quantum Money. In: Proceedings of the 24th Annual IEEE Conference on Computaitonal Complexity, CCC (2009)","DOI":"10.1109\/CCC.2009.42"},{"key":"44_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-14623-7_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"S Agrawal","year":"2010","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 98\u2013115. Springer, Heidelberg (2010)"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Babai, L., Itai, A.: A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. Journal of Algorithms 7(4), 567\u2013583 (1986)","DOI":"10.1016\/0196-6774(86)90019-2"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and Weaknesses of Quantum Computing. SIAM Journal on Computing 26, 1510\u20131523 (1997)","DOI":"10.1137\/S0097539796300933"},{"key":"44_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-25385-0_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random Oracles in a Quantum World. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 41\u201369. Springer, Heidelberg (2011)"},{"key":"44_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"key":"44_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-20465-4_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Freeman, D.M.: Homomorphic Signatures for Polynomial Functions. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 149\u2013168. Springer, Heidelberg (2011)"},{"key":"44_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-642-22792-9_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G Brassard","year":"2011","unstructured":"Brassard, G., H\u00f8yer, P., Kalach, K., Kaplan, M., Laplante, S., Salvail, L.: Merkle Puzzles in a Quantum World. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 391\u2013410. Springer, Heidelberg (2011)"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Brassard, G., H\u00f8yer, P., Tapp, A.: Quantum Algorithm for the Collision Problem. ACM SIGACT News (Cryptology Column) 28, 14\u201319 (1997)","DOI":"10.1145\/261342.261346"},{"key":"44_CR10","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security (CCS), pp. 62\u201373. ACM (November 1993)","DOI":"10.1145\/168588.168596"},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Brassard, G., Salvail, L.: Quantum Merkle Puzzles. In: Second International Conference on Quantum, Nano and Micro Technologies (ICQNM 2008), pp. 76\u201379 (February 2008)","DOI":"10.1109\/ICQNM.2008.16"},{"key":"44_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-13190-5_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"D Cash","year":"2010","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai Trees, or How to Delegate a Lattice Basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 523\u2013552. Springer, Heidelberg (2010)"},{"key":"44_CR13","unstructured":"Duffin, R.J., Schaffer, A.C.: A Refinement of an Inequality of the Brothers Markoff. Trans. Amer. Math. Soc. 44(3), 289\u2013297 (1941)"},{"key":"44_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"E Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: Secure Integration of Asymmetric and Symmetric Encryption Schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 537\u2013554. Springer, Heidelberg (1999)"},{"key":"44_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"44_CR16","doi-asserted-by":"crossref","unstructured":"Dov Gordon, S., Katz, J., Vaikuntanathan, V.: A Group Signature Scheme from Lattice Assumptions. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 395\u2013412. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-17373-8_23"},{"key":"44_CR17","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic Encryption. Journal of Computer and System Sciences, 270\u2013299 (1984)","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"44_CR18","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM Journal on Computing 17(2), 281\u2013308 (1988)","DOI":"10.1137\/0217017"},{"key":"44_CR19","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for Hard Lattices and New Cryptographic Constructions. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), p. 197 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"44_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-642-22792-9_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"S Hallgren","year":"2011","unstructured":"Hallgren, S., Smith, A., Song, F.: Classical Cryptographic Protocols in a Quantum World. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 411\u2013428. Springer, Heidelberg (2011)"},{"key":"44_CR21","doi-asserted-by":"crossref","unstructured":"Joffe, A.: On a Set of Almost Deterministic k-Independent Random Variables. The Annals of Probability 2(1), 161\u2013162 (1974)","DOI":"10.1214\/aop\/1176996762"},{"key":"44_CR22","doi-asserted-by":"crossref","unstructured":"Koller, D., Megiddo, N.: Constructing Small Sample Spaces Satisfying Given Constraints. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 268\u2013277. ACM (1993)","DOI":"10.1145\/167088.167168"},{"key":"44_CR23","doi-asserted-by":"crossref","unstructured":"Karloff, H., Mansour, Y.: On Construction of k-Wise Independent Random Variables. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC), vol. 17, pp. 564\u2013573 (1994)","DOI":"10.1145\/195058.195409"},{"key":"44_CR24","doi-asserted-by":"crossref","unstructured":"Luby, M.: A Simple Parallel Algorithm for the Maximal Independent Set Problem. In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing (STOC), pp. 1\u201310. ACM (1985)","DOI":"10.1145\/22145.22146"},{"key":"44_CR25","doi-asserted-by":"crossref","unstructured":"Meyer, D., Pommersheim, J.: On the Uselessness of Quantum Queries. Theoretical Computer Science, 1\u201312 (March 2011)","DOI":"10.1016\/j.tcs.2011.06.037"},{"key":"44_CR26","doi-asserted-by":"crossref","unstructured":"Nielsen, M.A., Chuang, I.: Quantum Computation and Quantum Information. American Journal of Physics 70(5), 558 (2000)","DOI":"10.1119\/1.1463744"},{"key":"44_CR27","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Journal on Computing 26(5), 1484\u20131509 (1997)","DOI":"10.1137\/S0097539795293172"},{"key":"44_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-642-13190-5_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"D Unruh","year":"2010","unstructured":"Unruh, D.: Universally Composable Quantum Multi-Party Computation. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 486\u2013505. Springer, Heidelberg (2010)"},{"key":"44_CR29","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: Secure Identity-Based Encryption in the Quantum Random Oracle Model (February 2012); Full version available at the Cryptology ePrint Archives, http:\/\/eprint.iacr.org\/2012\/076\/","DOI":"10.1007\/978-3-642-32009-5_44"},{"key":"44_CR30","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: How to Construct Quantum Random Functions (April 2012); Full version available at the Cryptology ePrint Archives, http:\/\/eprint.iacr.org\/2012\/182\/","DOI":"10.1109\/FOCS.2012.37"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32009-5_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T06:04:25Z","timestamp":1714284265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32009-5_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642320088","9783642320095"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32009-5_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}