{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:58:22Z","timestamp":1794383902263,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540669678","type":"print"},{"value":"9783540465881","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-540-46588-1_24","type":"book-chapter","created":{"date-parts":[[2011,1,6]],"date-time":"2011-01-06T16:55:48Z","timestamp":1294332948000},"page":"354-372","source":"Crossref","is-referenced-by-count":83,"title":["Efficient Zero-Knowledge Proofs of Knowledge without Intractability Assumptions"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philip","family":"MacKenzie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"24_CR1","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)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L., G\u00e1l, A., Koll\u00e1r, J., R\u00f3nyai, L., Szab\u00f3, T., Wigderson, A.: Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, May 22-24, pp. 603\u2013611 (1996)","DOI":"10.1145\/237814.238010"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-69053-0_20","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Jakobsson, M., Yung, M.: Round-optimal zero-knowledge arguments based on any one-way function. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 280\u2013305. Springer, Heidelberg (1997)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micali, S., Ostrovsky, R.: Perfect zero-knowledge in constant rounds. In: Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, May 14-16, pp. 482\u2013493 (1990)","DOI":"10.1145\/100216.100283"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1007\/BFb0055745","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Damg\u00e5rd, I.: Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free? In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 424\u2013441. Springer, Heidelberg (1998)"},{"key":"24_CR6","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., Damg\u00e5rd, I., Schoenmakers, B.: Proofs 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":"24_CR7","unstructured":"Cramer, R.: Modular Design of Secure yet Practical Cryptographic Protocols. PhD thesis, CWI & Univ. of Amsterdam (November 1996)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201989","year":"1990","unstructured":"Brassard, G. (ed.): CRYPTO 1989. LNCS, vol.\u00a0435. Springer, Heidelberg (1990)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201993","year":"1994","unstructured":"Stinson, D.R. (ed.): CRYPTO 1993. LNCS, vol.\u00a0773. Springer, Heidelberg (1994)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/0-387-34805-0_3","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"I.B. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: On the existence of bit commitment schemes and zero-knowledge proofs. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 17\u201327. Springer, Heidelberg (1990)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I.B.: Interactive hashing can simplify zero-knowledge protocol design without computational assumptions (extended abstract). In: CRYPTO 1993 [CRY 1993], pp. 100\u2013109 (1993)","DOI":"10.1007\/3-540-48329-2_9"},{"key":"24_CR12","unstructured":"Damg\u00e5rd, I., Pfitzmann, B.: Sequential iteration of interactive arguments. Journal version of ICALP 1998 paper (1998)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Frankel, Y., MacKenzie, P.D., Yung, M.: Robust efficient distributed rsa-key generation. In: STOC 1998 [STO 1998], pp. 663\u2013672 (1998)","DOI":"10.1145\/276698.276882"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1007\/0-387-34805-0_46","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"U. Feige","year":"1990","unstructured":"Feige, U., Shamir, A.: Zero knowledge proofs of knowledge in two rounds. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 526\u2013544. Springer, Heidelberg (1990)"},{"issue":"3","key":"24_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Kahan, A.: How to construct constant-round zeroknowledge proof systems for np. Journal of Cryptology\u00a09(3), 167\u2013189 (1996)","journal-title":"Journal of Cryptology"},{"issue":"1","key":"24_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. SIAM Journal on Computing\u00a025(1), 169\u2013192 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR17","unstructured":"Goldreich, O.: Foundations of cryptography (fragments of a book) (February 1995)"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/0-387-34799-2_16","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"L.C. Guillou","year":"1990","unstructured":"Guillou, L.C., Quisquater, J.-J.: A \u201cparadoxical\u201d indentity-based signature scheme resulting from zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 216\u2013231. Springer, Heidelberg (1990)"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Genarro, R., Rabin, M.O., Rabin, T.: Simplified vss and fast-track multiparty computations with applications to threshold cryptography. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing (1998)","DOI":"10.1145\/277697.277716"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Sahai, A., Vadhan, S.: Honest-verifier statistical zeroknowledge equals general statistical zero-knowledge. In: STOC 1998 [STO 1998], pp. 399\u2013408 (1998)","DOI":"10.1145\/276698.276852"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: Characterizing non-deterministic circuit size. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, San Diego, California, May 16-18, pp. 532\u2013540 (1993)","DOI":"10.1145\/167088.167230"},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"C.P. Schnorr","year":"1990","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 239\u2013252. Springer, Heidelberg (1990)"},{"key":"24_CR23","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 \u201993","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":"24_CR24","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1109\/SFCS.1994.365745","volume-title":"35th Annual Symposium on Foundations of Computer Science","author":"A.D. Santis","year":"1994","unstructured":"Santis, A.D., Crescenzo, G.D., Persiano, G., Yung, M.: On monotone formula closure of SZK. In: 35th Annual Symposium on Foundations of Computer Science, pp. 454\u2013465. IEEE, Los Alamitos (1994)"},{"key":"24_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/3-540-57332-1_27","volume-title":"Advances in Cryptology - ASIACRYPT \u201991","author":"T. Saito","year":"1993","unstructured":"Saito, T., Kurosawa, K., Sakurai, K.: 4 Move perfect ZKIP of knowledge with no assumption. In: Matsumoto, T., Imai, H., Rivest, R.L. (eds.) ASIACRYPT 1991. LNCS, vol.\u00a0739, pp. 321\u2013330. Springer, Heidelberg (1993)"},{"key":"24_CR26","unstructured":"Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, Dallas, Texas (May 23-26, 1998)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-46588-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T12:56:40Z","timestamp":1559912200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-46588-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540669678","9783540465881"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-46588-1_24","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b75033","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}