{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T17:40:56Z","timestamp":1794418856077,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642290107","type":"print"},{"value":"9783642290114","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29011-4_10","type":"book-chapter","created":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T03:05:53Z","timestamp":1333595153000},"page":"135-152","source":"Crossref","is-referenced-by-count":106,"title":["Quantum Proofs of Knowledge"],"prefix":"10.1007","author":[{"given":"Dominique","family":"Unruh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2005.v001a001","volume":"1","author":"S. Aaronson","year":"2005","unstructured":"Aaronson, S.: Limitations of quantum advice and one-way communication. Theory of Computing\u00a01(1), 1\u201328 (2005), http:\/\/www.theoryofcomputing.org\/articles\/v001a001","journal-title":"Theory of Computing"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/3-540-45841-7_26","volume-title":"STACS 2002","author":"M. Adcock","year":"2002","unstructured":"Adcock, M., Cleve, R.: A Quantum Goldreich-Levin Theorem with Cryptographic Applications. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 323\u2013334. Springer, Heidelberg (2002)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/3-540-48071-4_28","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Goldreich, O.: On Defining Proofs of Knowledge. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 390\u2013420. Springer, Heidelberg (1993), http:\/\/www-cse.ucsd.edu\/users\/mihir\/papers\/pok.ps"},{"key":"10_CR4","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, Berkeley, pp. 1444\u20131451 (1986)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game \u2013 or \u2013 a completeness theorem for protocols with honest majority. In: STOC 1987, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM\u00a038(3), 690\u2013728 (1991), http:\/\/www.wisdom.weizmann.ac.il\/~oded\/X\/gmw1j.pdf","journal-title":"Journal of the ACM"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pp. 291\u2013304. ACM Press (1985)","DOI":"10.1145\/22145.22178"},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing\u00a017(2), 281\u2013308 (1988), http:\/\/theory.lcs.mit.edu\/~rivest\/GoldwasserMicaliRivest-ADigitalSignatureSchemeSecureAgainstAdaptiveChosenMessageAttacks.ps","journal-title":"SIAM Journal on Computing"},{"key":"10_CR9","unstructured":"van de Graaf, J.: Towards a formal definition of security for quantum protocols. Ph.D. thesis, D\u00e9partment d\u2019informatique et de r.o., Universit\u00e9 de Montr\u00e9al (1998), http:\/\/www.cs.mcgill.ca\/~crepeau\/PS\/these-jeroen.ps"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: STOC, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"10_CR11","unstructured":"Halevi, S., Micali, S.: More on proofs of knowledge. IACR ePrint 1998\/015 (1998)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02418571","volume":"30","author":"J.L.W.V. Jensen","year":"1906","unstructured":"Jensen, J.L.W.V.: Sur les fonctions convexes et les in\u00e9galit\u00e9s entre les valeurs moyennes. Acta Mathematica\u00a030(1), 175\u2013193 (1906) (in French)","journal-title":"Acta Mathematica"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-21969-6_2","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2011","author":"C. Lunemann","year":"2011","unstructured":"Lunemann, C., Nielsen, J.B.: Fully Simulatable Quantum-Secure Coin-Flipping and Applications. In: Nitaj, A., Pointcheval, D. (eds.) AFRICACRYPT 2011. LNCS, vol.\u00a06737, pp. 21\u201340. Springer, Heidelberg (2011)"},{"key":"10_CR15","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press (2000)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: Proceedings of 35th Annual Symposium on Foundations of Computer Science, FOCS 1994, pp. 124\u2013134. IEEE Computer Society (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"10_CR17","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) preprint on arXiv:0910.2912 [quant-ph]"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Unruh, D.: Quantum proofs of knowledge. IACR ePrint 2010\/212 (2012), full version","DOI":"10.1007\/978-3-642-29011-4_10"},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/060670997","volume":"39","author":"J. Watrous","year":"2009","unstructured":"Watrous, J.: Zero-knowledge against quantum attacks. SIAM J. Comput.\u00a039(1), 25\u201358 (2009)","journal-title":"SIAM J. Comput."},{"key":"10_CR20","unstructured":"Winter, A.: Coding Theorems of Quantum Information Theory, Ph.D. thesis, Universit\u00e4t Bielefeld (1999), arXiv:quant-ph\/9907077v1"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"W.K. Wootters","year":"1982","unstructured":"Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature\u00a0299, 802\u2013803 (1982)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29011-4_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T09:52:33Z","timestamp":1742896353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29011-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642290107","9783642290114"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29011-4_10","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-29011-4","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]]}}}