{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:53:41Z","timestamp":1725551621488},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540308553"},{"type":"electronic","value":"9783540324249"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11599548_2","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T14:44:08Z","timestamp":1133448248000},"page":"10-27","source":"Crossref","is-referenced-by-count":1,"title":["You Can Prove So Many Things in Zero-Knowledge"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Di Crescenzo","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to Go Beyond the Black-Box Simulation Barrier. In: Proc. of the 42nd IEEE Symposium on Foundations of Computer Science, FOCS 2001 (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"2_CR2","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 1992","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)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O.: Universal Arguments and Their Applications. In: Proc. of IEEE Conference on Computational Complexity 2002 (2002)","DOI":"10.1109\/CCC.2002.1004355"},{"key":"2_CR4","unstructured":"Bellare, M., Goldreich, O.: Proving Computational Ability, manuscript (1992)"},{"key":"2_CR5","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 1988","author":"M. Ben-Or","year":"1990","unstructured":"Ben-Or, M., Goldreich, O., Goldwasser, S., H\u00e5stad, J., Kilian, J., Micali, S., Rogaway, P.: Everything provable is provable in zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 37\u201356. Springer, Heidelberg (1990)"},{"key":"2_CR6","unstructured":"Blum, M.: How to Prove a Theorem So No One Else Can Claim It. In: Proc. of the International Congress of Mathematicians, Berkeley, California (1986)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"R. Boppana","year":"1987","unstructured":"Boppana, R., Hastad, J., Zachos, S.: Does co-NP has Short Interactive Proofs? Information Processing Letters\u00a025, 127\u2013132 (1987)","journal-title":"Information Processing Letters"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Brassard, G., Cr\u00e9peau, C., Chaum, D.: Minimum Disclosure Proofs of Knowledge. Journal of Computer and System Sciences\u00a037(2), 156\u2013189","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-540-46588-1_24","volume-title":"Public Key Cryptography","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Damgard, I., MacKenzie, P.: Efficient zero-knowledge proofs of knowledge without intractability assumptions. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 354\u2013373. Springer, Heidelberg (2000)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"R. Cramer","year":"1994","unstructured":"Cramer, R., Damgard, I., Schoenmakers, B.: Proof of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 174\u2013187. Springer, Heidelberg (1994)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-68339-9_7","volume-title":"Advances in Cryptology - EUROCRYPT 1996","author":"R. Cramer","year":"1996","unstructured":"Cramer, R., Franklin, M.K., Schoenmakers, B., Yung, M.: Multi-authority secret-ballot elections with linear work. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 72\u201383. Springer, Heidelberg (1996)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/3-540-48329-2_7","volume-title":"Advances in Cryptology - CRYPTO 1993","author":"A. Santis De","year":"1994","unstructured":"De Santis, A., Di Crescenzo, G., Persiano, G.: Secret sharing and perfect zero-knowledge. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 73\u201384. Springer, Heidelberg (1994)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: On Monotone Formula Closure of SZK. In: Proc. of the 35th IEEE Symposium on Foundations of Computer Science, FOCS 1994 (1994)","DOI":"10.1109\/SFCS.1994.365745"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Impagliazzo, R.: Security-Preserving Hardness Amplification for any Regular One-Way Function. In: Proc. of STOC 1999 (1999)","DOI":"10.1145\/301250.301296"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Sakurai, K., Yung, M.: Zero-Knowledge Proofs of Decision Power: New Protocols and Optimal Round-Complexity. In: Proc. of ICICS 1998 (1998)","DOI":"10.1007\/BFb0028458"},{"key":"2_CR16","unstructured":"Di Crescenzo, G., Sakurai, K., Yung, M.: On Zero-Knowledge Proofs: \u2018From Membership to Decision. In: Proc. of the 2000 ACM Symposium on Theory of Computing, STOC 2000 (2000)"},{"key":"2_CR17","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, 77\u201394 (1988)","journal-title":"Journal of Cryptology"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","first-page":"186","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.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Fortnow, L.: The Complexity of Perfect Zero Knowledge. In: Proc. of the 1987 ACM Symposium on Theory of Computing, STOC 1987 (1987)","DOI":"10.1145\/28395.28418"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-44448-3_28","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Franklin","year":"2000","unstructured":"Franklin, M., Sander, T.: Commital deniable proofs and electronic campaign finance. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, p. 373. Springer, Heidelberg (2000)"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Galil, Z., Haber, S., Yung, M.: Minimum-Knowledge Interactive Proofs for Decision Problems. SIAM Journal on Computing\u00a018(4)","DOI":"10.1137\/0218049"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Garay, J., MacKenzie, P.: Concurrent Oblivious Transfer. In: Proc. of the 41st IEEE Symposium on Foundations of Computer Science, FOCS 2000 (2000)","DOI":"10.1109\/SFCS.2000.892120"},{"issue":"1","key":"2_CR23","first-page":"691","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(1), 691\u2013729 (1991)","journal-title":"Journal of the ACM"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof-Systems. SIAM Journal on Computing\u00a018(1) (1989)","DOI":"10.1137\/0218012"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-48184-2_4","volume-title":"Advances in Cryptology - CRYPTO 1987","author":"R. Impagliazzo","year":"1988","unstructured":"Impagliazzo, R., Yung, M.: Direct minimum knowledge computations. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 40\u201351. Springer, Heidelberg (1988)"},{"issue":"1","key":"2_CR26","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s001459900018","volume":"10","author":"T. Itoh","year":"1997","unstructured":"Itoh, T., Ohta, Y., Shizuya, H.: A Language-Dependent Cryptographic Primitive. Journal of Cryptology\u00a010(1), 37\u201349 (1997)","journal-title":"Journal of Cryptology"},{"key":"2_CR27","unstructured":"Shamir, A.: IP=PSPACE. In: Proc. of the 31st IEEE Symposium on Foundations of Computer Science, FOCS 1990 (1990)"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Tompa, M., Woll, H.: Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information. In: Proc. of IEEE FOCS 1987 (1987)","DOI":"10.1109\/SFCS.1987.49"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-46885-4_22","volume-title":"Advances in Cryptology - EUROCRYPT 1989","author":"M. Yung","year":"1990","unstructured":"Yung, M.: Zero-knowledge proofs of computational power. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 196\u2013207. Springer, Heidelberg (1990)"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-24852-1_13","volume-title":"Applied Cryptography and Network Security","author":"Y. Zhao","year":"2004","unstructured":"Zhao, Y., Lee, C.H., Zhao, Y., Zhu, H.: Some observations on zap and its applications. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol.\u00a03089, pp. 180\u2013193. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11599548_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:47:15Z","timestamp":1586594835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11599548_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540308553","9783540324249"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11599548_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}