{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:12:24Z","timestamp":1725516744236},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705826"},{"type":"electronic","value":"9783540705833"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70583-3_48","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"592-603","source":"Crossref","is-referenced-by-count":10,"title":["Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks"],"prefix":"10.1007","author":[{"given":"Sean","family":"Hallgren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandra","family":"Kolla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pranab","family":"Sen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengyu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/0-387-34799-2_4","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"M. Ben-Or","year":"1990","unstructured":"Ben-Or, M., Goldreich, O., Goldwasser, S., H\u00e5stad, J., Kilian, J., Micali, S., Rogaway, P.: Every provable is provable in zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 37\u201356. Springer, Heidelberg (1990)"},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Goldreich, O., Wigderson, A.: Hashing functions can simplify zero-knowledge protocol design (too). Technical Report RS-94-39, BRICS (1994)","DOI":"10.7146\/brics.v1i39.21604"},{"issue":"2","key":"48_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. Journal of Cryptology\u00a01(2), 77\u201394 (1988)","journal-title":"Journal of Cryptology"},{"issue":"1","key":"48_CR4","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Widgerson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM\u00a038(1), 691\u2013729 (1991)","journal-title":"Journal of the ACM"},{"key":"48_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of cryptography, vol.\u00a01. Cambridge University Press, Cambridge (2001)"},{"key":"48_CR6","unstructured":"Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. Advances in Computing Research, vol.\u00a05, pp. 73\u201390. JAC Press, Inc. (1989)"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Sahai, A., Vadhan, S.: Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 399\u2013408 (1998)","DOI":"10.1145\/276698.276852"},{"key":"48_CR8","unstructured":"Goldreich, O., Vadhan, S.: Comparing entropies in statistical zero knowledge with applications to the structure of SZK. In: Proceedings of the 14th Annual IEEE Symposium on Foundations of Computer Science, pp. 448\u2013457 (1997)"},{"issue":"4","key":"48_CR9","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal on Computing\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"48_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-48184-2_4","volume-title":"Proceedings of Crypto 1987","author":"R. Impagliazzo","year":"1988","unstructured":"Impagliazzo, R., Yung, M.: Direct zero-knowledge computations. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 40\u201351. Springer, Heidelberg (1988)"},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"Kobayashi, H.: General properties of quantum zero-knowledge proofs. In: Proceedings of the 5th Theory of Cryptography Conference, pp. 107\u2013124 (2008), Also quant-ph\/0705.1129","DOI":"10.1007\/978-3-540-78524-8_7"},{"key":"48_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandom generator. Journal of Cryptology\u00a04, 151\u2013158 (1991)","journal-title":"Journal of Cryptology"},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"Nguyen, M.-H., Vadhan, S.: Zero knowledge with efficient provers. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 287\u2013295 (2006)","DOI":"10.1145\/1132516.1132559"},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"Ong, S., Vadhan, S.: An equivalence between zero knowledge and commitments. In: Proceedings of the 5th Theory of Cryptography Conference (to appear, 2008)","DOI":"10.1007\/978-3-540-78524-8_27"},{"issue":"2","key":"48_CR15","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/636865.636868","volume":"50","author":"A. Sahai","year":"2003","unstructured":"Sahai, A., Vadhan, S.: A complete promise problem for statistical zero-knowledge. Journal of the ACM\u00a050(2), 196\u2013249 (2003)","journal-title":"Journal of the ACM"},{"issue":"4","key":"48_CR16","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1137\/S0097539705447207","volume":"36","author":"S. Vadhan","year":"2006","unstructured":"Vadhan, S.: An unconditional study of computational zero knowledge. SIAM Journal on Computing\u00a036(4), 1160\u20131214 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Limits on the power of quantum statistical zero-knowledge. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 459\u2013468 (2002)","DOI":"10.1109\/SFCS.2002.1181970"},{"key":"48_CR18","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Zero-knowledge against quantum attacks. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 296\u2013305 (2006)","DOI":"10.1145\/1132516.1132560"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:03Z","timestamp":1605762483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705826","9783540705833"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}