{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T05:47:53Z","timestamp":1771480073255,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642383472","type":"print"},{"value":"9783642383489","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-38348-9_35","type":"book-chapter","created":{"date-parts":[[2013,5,9]],"date-time":"2013-05-09T00:46:38Z","timestamp":1368060398000},"page":"592-608","source":"Crossref","is-referenced-by-count":83,"title":["Quantum-Secure Message Authentication Codes"],"prefix":"10.1007","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[]},{"given":"Mark","family":"Zhandry","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1&2","key":"35_CR1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.26421\/QIC11.1-2-7","volume":"11","author":"D.M. Kane","year":"2011","unstructured":"Kane, D.M., Kutin, S.A.: Quantum interpolation of polynomials. Quantum Information & Computation\u00a011(1&2), 95\u2013103 (2011) (first published in 2009)","journal-title":"Quantum Information & Computation"},{"issue":"1&2","key":"35_CR2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.26421\/QIC11.1-2-7","volume":"11","author":"D.M. Kane","year":"2011","unstructured":"Kane, D.M., Kutin, S.A.: Quantum interpolation of polynomials. Quantum Information & Computation\u00a011(1&2), 95\u2013103 (2011) (first published in 2009)","journal-title":"Quantum Information & Computation"},{"issue":"1&2","key":"35_CR3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.26421\/QIC11.1-2-7","volume":"11","author":"D.M. Kane","year":"2011","unstructured":"Kane, D.M., Kutin, S.A.: Quantum interpolation of polynomials. Quantum Information & Computation\u00a011(1&2), 95\u2013103 (2011) (first published in 2009)","journal-title":"Quantum Information & Computation"},{"issue":"3","key":"35_CR4","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/s00453-007-9022-9","volume":"55","author":"A. Ambainis","year":"2009","unstructured":"Ambainis, A., Spalek, R., de Wolf, R.: A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs. Algorithmica\u00a055(3), 422\u2013461 (2009)","journal-title":"Algorithmica"},{"issue":"4","key":"35_CR5","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1145\/502090.502097","volume":"48","author":"R. Beals","year":"2001","unstructured":"Beals, R., et al.: Quantum Lower Bounds by Polynomials. Journal of the ACM (JACM)\u00a048(4), 778\u2013797 (2001)","journal-title":"Journal of the ACM (JACM)"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Pseudorandom functions revisited: The cascade construction and its concrete security. In: FOCS, pp. 514\u2013523 (1996)","DOI":"10.1109\/SFCS.1996.548510"},{"key":"35_CR7","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., et al.: Random Oracles in a Quantum World. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 41\u201369. Springer, Heidelberg (2011)"},{"key":"35_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., et al.: Merkle Puzzles in a Quantum World. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 391\u2013410. Springer, Heidelberg (2011)"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The security of the cipher block chaining message authentication code. J. Comput. Syst. Sci.\u00a061(3) (2000)","DOI":"10.1006\/jcss.1999.1694"},{"key":"35_CR10","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":"35_CR11","series-title":"Lecture Notes in Computer Science","first-page":"589","volume-title":"EUROCRYPT 2013","author":"D. Boneh","year":"2013","unstructured":"Boneh, D., Zhandry, M.: Quantum-secure message authentication codes. In: Johansson, T. (ed.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 589\u2013605. Springer, Heidelberg (2013), http:\/\/eccc.hpi-web.de\/report\/2012\/136"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Proc. of FOCS. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"35_CR13","unstructured":"Damg\u00e5rd, I., Funder, J., Nielsen, J.B., Salvail, L.: Superposition attacks on cryptographic protocols. CoRR, abs\/1108.6313 (2011)"},{"issue":"4","key":"35_CR14","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. Journal of the ACM (JACM)\u00a033(4), 792\u2013807 (1986)","journal-title":"Journal of the ACM (JACM)"},{"key":"35_CR15","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.\u00a06841, pp. 411\u2013428. Springer, Heidelberg (2011)"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Kerenidisand, I., de Wolf, R.: Exponential lower bound for 2-query locally decodable codes via a quantum argument. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), pp. 106\u2013115 (2003)","DOI":"10.1145\/780542.780560"},{"issue":"1&2","key":"35_CR17","doi-asserted-by":"crossref","first-page":"95","DOI":"10.26421\/QIC11.1-2-7","volume":"11","author":"D.M. Kane","year":"2011","unstructured":"Kane, D.M., Kutin, S.A.: Quantum interpolation of polynomials. Quantum Information & Computation\u00a011(1&2), 95\u2013103 (2011) (first published in 2009)","journal-title":"Quantum Information & Computation"},{"issue":"11","key":"35_CR18","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"35_CR19","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.\u00a06110, pp. 486\u2013505. Springer, Heidelberg (2010)"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"van Dam, W.: Quantum oracle interrogation: Getting all information for almost half the price. In: FOCS, pp. 362\u2013367 (1998)","DOI":"10.1109\/SFCS.1998.743486"},{"issue":"3","key":"35_CR21","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M.N. Wegman","year":"1981","unstructured":"Wegman, M.N., Carter, L.: New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci.\u00a022(3), 265\u2013279 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"35_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1007\/978-3-642-32009-5_44","volume-title":"CRYPTO 2012","author":"M. Zhandry","year":"2012","unstructured":"Zhandry, M.: Secure Identity-Based Encryption in the Quantum Random Oracle Model. In: Safavi-Naini, R. (ed.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 758\u2013775. Springer, Heidelberg (2012)"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: How to Construct Quantum Random Functions. In: Proceedings of FOCS (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 EUROCRYPT 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38348-9_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T09:17:45Z","timestamp":1746004665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38348-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642383472","9783642383489"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38348-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}