{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:45Z","timestamp":1725663765891},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578116"},{"type":"electronic","value":"9783540483373"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994]]},"DOI":"10.1007\/3-540-57811-0_10","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:23:31Z","timestamp":1330262611000},"page":"109-124","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A non-interactive electronic cash system"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Di Crescenzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"10_CR1","unstructured":"J. Bar Ilan 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":"10_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":"10_CR3","unstructured":"M. Bellare and M. Yung, Certifying Cryptographic Tools: The case of Trapdoor Permutations, in Proceedings of CRYPTO-92."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastad, S. Micali, and P. Rogaway, Everything Provable is Provable in Zero Knowledge, in \u201cAdvances in Cryptology \u2014 CRYPTO 88\u201d, Ed. S. Goldwasser, vol. 403 of \u201cLecture Notes in Computer Science\u201d, Springer-Verlag, pp. 37\u201356.","DOI":"10.1007\/0-387-34799-2_4"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF00196727","volume":"n. 4","author":"J. Boyar","year":"1991","unstructured":"J. Boyar, K. Friedl, and C. Lund, Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies, Journal of Cryptology, n. 4, pp. 185\u2013206, 1991.","journal-title":"Journal of Cryptology"},{"issue":"no.6","key":"10_CR6","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M. Blum","year":"1991","unstructured":"M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge, SIAM Journal of Computing, vol. 20, no. 6, Dec 1991, pp. 1084\u20131118.","journal-title":"SIAM Journal of Computing"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge and Applications, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 103\u2013112.","DOI":"10.1145\/62212.62222"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"R. Boppana","year":"1987","unstructured":"R. Boppana, J. Hastad, and S. Zachos, Does co-N P has Short Interactive Proofs?, Information Processing Letters, vol. 25, May 1987, pp. 127\u2013132.","journal-title":"Information Processing Letters"},{"issue":"10","key":"10_CR9","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1145\/4372.4373","volume":"28","author":"D. Chaum","year":"1985","unstructured":"D. Chaum, Security without Identification: Transaction System to Make Big Brother Obsolete, in Communication of the ACM, 28, 101985, pp. 1030\u20131044.","journal-title":"Communication of the ACM"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"D. Chaum, A. Fiat, and M. Naor, Untraceable Electronic Cash, in \u201cAdvances in Cryptology \u2014 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":"10_CR11","doi-asserted-by":"crossref","unstructured":"I. B. Damgard, Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals, in \u201cAdvances in Cryptology \u2014 CRYPTO 88\u201d, Ed. S. Goldwasser, vol. 403 of \u201cLecture Notes in Computer Science\u201d, Springer-Verlag, pp. 328\u2013335.","DOI":"10.1007\/0-387-34799-2_26"},{"key":"10_CR12","unstructured":"A. De Santis, G. Di Crescenzo, and G. Persiano, The Knowledge Complexity of Quadratic Residuosity Languages, to appear in Theoretical Computer Science."},{"key":"10_CR13","unstructured":"A. De Santis, G. Di Crescenzo, and G. Persiano, Secret Sharing and Perfect Zero-Knowledge, to appear in Proceedings of CRYPTO 93."},{"key":"10_CR14","unstructured":"A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof-Systems, in \u201cAdvances in Cryptology \u2014 CRYPTO 87\u201d, vol. 293 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag."},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"A. De Santis, and G. Persiano, Communication Efficient Zero-Knowledge Proof of knowledge (with Application to Electronic Cash), in Proceedings of STACS 92, pp. 449\u2013460.","DOI":"10.1007\/3-540-55210-3_204"},{"key":"10_CR16","unstructured":"U. Feige, D. Lapidot, and A. Shamir, Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String, in Proceedings of 22nd Annual Symposium on the Theory of Computing, 1990, pp. 308\u2013317."},{"key":"10_CR17","unstructured":"N. Ferguson, Single Term Off-Line Coins, to appear in Proceedings of Eurocrypt 93."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"L. Fortnow, The Complexity of Perfect Zero-Knowledge, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 204\u2013209.","DOI":"10.1145\/28395.28418"},{"key":"10_CR19","unstructured":"M. Franklin and M. Yung, Secure and Efficient Off-Line Digital Money, in Proceedings of ICALP 93."},{"key":"10_CR20","unstructured":"O. Goldreich and E. Kushilevitz, A Perfect Zero Knowledge Proof for a Decision Problem Equivalent to Discrete Logarithm, in \u201cAdvances in Cryptology \u2014 CRYPTO 88\u201d, Ed. S. Goldwasser, vol. 403 of \u201cLecture Notes in Computer Science\u201d, Springer-Verlag."},{"key":"10_CR21","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":"10_CR22","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"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and M. Yung, Direct Minimum Knowledge Computations \u201cAdvances in Cryptology \u2014 CRYPTO 87\u201d, vol. 293 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag pp. 40\u201351.","DOI":"10.1007\/3-540-48184-2_4"},{"key":"10_CR24","volume-title":"An Introduction to the Theory of Numbers","author":"I. Niven","year":"1960","unstructured":"I. Niven and H. S. Zuckerman, An Introduction to the Theory of Numbers, John Wiley and Sons, 1960, New York."},{"key":"10_CR25","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 \u2014 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":"10_CR26","doi-asserted-by":"crossref","unstructured":"M. Tompa and H. Woll, Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information, Proc. 28th Symposium on Foundations of Computer Science, 1987, pp. 472\u2013482.","DOI":"10.1109\/SFCS.1987.49"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57811-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T05:17:38Z","timestamp":1593753458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57811-0_10"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578116","9783540483373"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-57811-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"26 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}