{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:59Z","timestamp":1725663719286},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540552109"},{"type":"electronic","value":"9783540467755"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55210-3_204","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:54:29Z","timestamp":1330250069000},"page":"449-460","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Communication efficient Zero-knowledge Proofs of knowledge"],"prefix":"10.1007","author":[{"given":"Alfredo","family":"De Santis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Persiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"36_CR1","unstructured":"J. Bar Han and D. Beaver, Non-Cryptographic Fault-Tolerant Computation in a Constant Number of Rounds of Interaction, in Proc. of the 8th PODC (1989) pp. 201\u2013209."},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali, and P. Rogaway, The Round Complexity of Secure Protocols, Proceedings of the 22nd Annual Symposium on the Theory of Computing, 1990, pp. 503\u2013513.","DOI":"10.1145\/100216.100287"},{"key":"36_CR3","unstructured":"M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge, SLAM Journal on Computing, December 1991. Preliminary version: MIT Research Report MIT\/LCS\/TM-430, May 1990."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge Proof Systems and Applications, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, 1988.","DOI":"10.1145\/62212.62222"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Cr\u00e9peau, and M. Yung, Everything in NP can be Proven in Perfect Zero-Knowledge in a Bounded Number of Rounds, Proceedings of the 16th ICALP, July 1989.","DOI":"10.1007\/BFb0035756"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"D. Chaum, A. Fiat, and M. Naor, Untraceable Electronic Cash, in \u201cAdvances in Cryptology-CRYPTO 88\u201d, Ed. S. Goldwasser, vol. 403 of \u201cLecture Notes in Computer Science\u201d, Springer-Verlag, pp.319\u2013327.","DOI":"10.1007\/0-387-34799-2_25"},{"key":"36_CR7","unstructured":"A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge ProofSystems, in \u201cAdvances in Cryptology-CRYPTO 87\u201d, vol. 293 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag."},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof-Systems with Preprocessing, in \u201cAdvances in Cryptology-CRYPTO 88\u201d, Ed. S. Goldwasser, vol. 403 of \u201cLecture Notes in Computer Science\u201d, Springer-Verlag, pp. 269\u2013282.","DOI":"10.1007\/0-387-34799-2_21"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"A. De Santis and G. Persiano, Public-Randomness in Public-key Cryptography, in \u201cAdvances in Cryptology-EUROCRYPT 90\u201d, Ed. I.B.Damg\u00e5rd, vol. 473 of \u201cLecture Notes in Computer Science\u201d, Springer-Verlag, pp. 46\u201362.","DOI":"10.1007\/3-540-46877-3_5"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"A. De Santis and M. Yung, Cryptographic Applications of the non-interactive Metaproof and Many-prover Systems, CRYPTO 1990.","DOI":"10.1007\/3-540-38424-3_27"},{"key":"36_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat, and A. Shamir, Zero-knowledge Proofs of Identity, Journal of Cryptology, vol. 1, 1988, pp. 77\u201394. (Preliminary version in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, 1987, pp. 210\u2013217.)","journal-title":"Journal of Cryptology"},{"key":"36_CR12","unstructured":"U. Feige, D. Lapidot, and A. Shamir, Multiple Non-interactive Zero-knowledge Proofs Based on a Single Random String, Proceedings of the 22nd Annual Symposium on the Theory of Computing, 1990, pp. 308\u2013317."},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"U. Feige and A. Shamir, Zero knowledge proof of knowledge in two rounds, in \u201cAdvances in Cryptology-CRYPTO 89\u201d, vol. 435 of \u201cLecture Notes in Computer Science\u201d, Springer-Verlag, pp. 526\u2013544.","DOI":"10.1007\/0-387-34805-0_46"},{"issue":"no.4","key":"36_CR14","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, and S. Micali, How to Construct Random Functions, Journal of the Association for Computing Machinery, vol. 33, no. 4, 1986, pp. 792\u2013807.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAM Journal on Computing, vol. 18, n. 1, February 1989.","DOI":"10.1137\/0218012"},{"issue":"n.2","key":"36_CR16","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, and R. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attack, SIAM Journal of Computing, vol. 17, n. 2, April 1988, pp. 281\u2013308.","journal-title":"SIAM Journal of Computing"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"J. Kilian, S. Micali, and R. Ostrowsky, Minimum-Resource Zero-Knowledge Proofs, Proceedings of the 30th IEEE Symposium on Foundation of Computer Science, 1989, pp. 474\u2013479.","DOI":"10.1109\/SFCS.1989.63521"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing but their Validity and a Methodology of Cryptographic Design, Proceedings of 27th Annual Symposium on Foundations of Computer Science, 1986, pp. 174\u2013187.","DOI":"10.1109\/SFCS.1986.47"},{"key":"36_CR19","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad, Pseudorandom Generators under Uniform Assumptions, Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990, pp. 395\u2013404.","DOI":"10.1145\/100216.100270"},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. Levin, and M. Luby, Pseudo-Random Generation from One-way Functions, Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 1989.","DOI":"10.1145\/73007.73009"},{"key":"36_CR21","unstructured":"M. Naor, Bit Commitment using Pseudo-randomness, in \u201cAdvances in Cryptology-CRYPTO 89\u201d, vol. 435 of \u201cLecture Notes in Computer Science\u201d, Springer-Verlag."},{"key":"36_CR22","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung, Universal One-way Hash Functions and their Cryptographic Applications, Proceedings of 21st Annual Symposium on the Theory of Computing, May 1989.","DOI":"10.1145\/73007.73011"},{"key":"36_CR23","doi-asserted-by":"crossref","unstructured":"T. Okamoto and K. Ohta, Disposable Zero-knowledge authentications and their Applications to Untraceable Electronic Cash, in \u201cAdvances in Cryptology-CRYPTO 89\u201d, vol. 435 of \u201cLecture Notes in Computer Science\u201d, Springer-Verlag, pp. 481\u2013496.","DOI":"10.1007\/0-387-34805-0_43"},{"key":"36_CR24","doi-asserted-by":"crossref","unstructured":"J. Rompel, One-way Functions are Necessary and Sufficient for Secure Signatures, Proceedings of the 22nd Annual Symposium on the Theory of Computing, 1990, pp. 387\u2013394.","DOI":"10.1145\/100216.100269"},{"key":"36_CR25","doi-asserted-by":"crossref","unstructured":"M. Tompa and H. Woll, Random Self-Reducibility and Zero-knowledge Interactive Proofs of Possession of Information, Proceedings of 28th Symposium on Foundations of Computer Science, 1987, pp. 472\u2013482.","DOI":"10.1109\/SFCS.1987.49"}],"container-title":["Lecture Notes in Computer Science","STACS 92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55210-3_204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:30:10Z","timestamp":1578526210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55210-3_204"}},"subtitle":["With applications to Electronic Cash"],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552109","9783540467755"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-55210-3_204","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}