{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:31:23Z","timestamp":1760707883108,"version":"3.33.0"},"publisher-location":"New York, NY","reference-count":19,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387973173"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-34805-0_3","type":"book-chapter","created":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T02:05:53Z","timestamp":1194573953000},"page":"17-27","source":"Crossref","is-referenced-by-count":27,"title":["On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs"],"prefix":"10.1007","author":[{"given":"Ivan Bjerre","family":"Damg\u00e5rd","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Abadi, Allender, Broder, Feigenbaum and Hemachandra: \u201cOn Generating Solved Instances of Computational Problems\u201d, Proc. of CRYPTO 88, Springer."},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"Alexi","year":"1988","unstructured":"Alexi, Chor, Goldreich, Schnorr: \u201cRSA and Rabin Functions: Certain Parts are as Hard as the Whole\u201d, Siam J. Compt., vol.17, no.2, 1988, pp.194\u2013209.","journal-title":"Siam J. Compt."},{"key":"3_CR3","unstructured":"Boyar, Krentel and Kurtz: \u201cA Discrete Logarithm Implementation of Zero-knowledge Blobs\u201d, Tech. Report, Dept. of Computer Science, University of Chicago, 1987."},{"key":"3_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Modern Cryptology","author":"Brassard","year":"1988","unstructured":"Brassard: Modern Cryptology, Lecture Notes in Computer Science, vol.325, Springer-Verlag, 1988."},{"issue":"2","key":"3_CR5","first-page":"156","volume":"37","author":"Brassard","year":"1988","unstructured":"Brassard, Chaum, Cr\u00e9peau: \u201cMinimum Disclosure Proofs of Knowledge\u201d, JCSS, vol.37, no.2, Oct. 1988, pp.156\u2013189.","journal-title":"JCSS"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Chaum, Damg\u00e5d, van de Grad \u201cMultiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result\u201d, Proc. of Crypto 87.","DOI":"10.1007\/3-540-48184-2_7"},{"key":"3_CR7","unstructured":"Chaum, van de Graaf: \u201cAn Improved Protocol for Demonstrating possession of a Discrete Log\u201d, Proc. of EuroCrypt 87."},{"key":"3_CR8","volume-title":"The Application of Claw Free Functions in Cryptography","author":"Damg\u00e5rd","year":"1988","unstructured":"Damg\u00e5rd: \u201cThe Application of Claw Free Functions in Cryptography\u201d, PhD-Thesis, Aarhus University, Denmark, May 1988."},{"key":"3_CR9","unstructured":"Fiege and Shamir: \u201cZero-Knowledge Proofs of Knowledge in Two Rounds\u201d, these proceedings."},{"key":"3_CR10","unstructured":"Fiat, Fiege, Shamir: \u201cZero-Knowledge Proof of Identity\u201d, Proc. of STOC 87."},{"key":"3_CR11","unstructured":"Feigenbaum, Lipton and Mahaney: \u201cA Completeness Theorem for Almost-Everywhere Invulnerable Generators\u201d, manuscript, AT& T Bell Labs. Tech. Memo, Febr. 89."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich and Levin: \u201cA Hard-Core Predicate for all One-Way Functions\u201d, Proc. of STOC 89, pp.25\u201332.","DOI":"10.1090\/ulect\/055\/09"},{"issue":"2","key":"3_CR13","first-page":"270","volume":"28","author":"Goldwasser","year":"1984","unstructured":"Goldwasser, Micali: \u201cProbabilistic Encryption\u201d, JCSS, vol 28, no 2, 1984, pp 270\u2013299.","journal-title":"JCSS"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Goldwasser, Micali, Rackoff: \u201cThe Knowledge Complexity of Interactive Proof Systems\u201d, Proc. of STOC 85, pp.291\u2013304.","DOI":"10.1145\/22145.22178"},{"key":"3_CR15","unstructured":"Goldreich, Micali, Wigderson: \u201cProof that Yield Nothing but the Validity of the Assertion, and the Methodology of Cryptographic Protocol Design\u201d, Proc. of FOCS 86."},{"key":"3_CR16","unstructured":"Goldreich, Micali and Wigderson: \u201cHow to Play any Mental Game\u201d, Proc. of FOCS 87."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Kranakis: Primality and Cryptography, Wiley-Teubner Series in Computer Science, 1986.","DOI":"10.1007\/978-3-322-96647-6"},{"key":"3_CR18","unstructured":"Naor: \u201cBit Commitment using Pseudo-Randomness\u201d, these proceedings."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Tompa, Woll: \u201cRandom Self-Reducibility and Zero-Knowledge Proofs of Information Possession\u201d, Proc. of FOCS 87.","DOI":"10.1109\/SFCS.1987.49"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-34805-0_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T05:28:28Z","timestamp":1737523708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34805-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387973173"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/0-387-34805-0_3","relation":{},"subject":[]}}