{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T08:39:00Z","timestamp":1771576740317,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540551881","type":"print"},{"value":"9783540467663","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-46766-1_38","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T11:03:27Z","timestamp":1186830207000},"page":"470-484","source":"Crossref","is-referenced-by-count":88,"title":["Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer"],"prefix":"10.1007","author":[{"given":"David","family":"Chaum","sequence":"first","affiliation":[]},{"given":"Eug\u00e8ne","family":"van Heijst","sequence":"additional","affiliation":[]},{"given":"Birgit","family":"Pfitzmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,5,18]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Gilles Brassard, David Chaum, Claude Cr\u00e9peau: Minimum Disclosure Proofs of Knowledge; Journal of Computer and System Sciences 37 (1988) 156\u2013189.","journal-title":"Journal of Computer and System Sciences"},{"key":"38_CR2","unstructured":"Joan Boyar, David Chaum, Ivan Damg\u00e5rd, Torben Pedersen: Convertible Undeniable Signatures; Crypto\u201990, Abstracts, 195\u2013208."},{"key":"38_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BFb0020803","volume-title":"STACS\u201991","author":"G. Brassard","year":"1991","unstructured":"Gilles Brassard, Claude Cr\u00e9peau, Sophie Laplante, Christian L\u00e9ger: Computationally Convincing Proofs of Knowledge: STACS\u201991, LNCS 480, Springer-Verlag, Berlin 1991, 251\u2013262."},{"key":"38_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1007\/0-387-34805-0_49","volume-title":"Crypto\u201989","author":"D. Beaver","year":"1990","unstructured":"Donald Beaver: Multiparty Protocols Tolerating Half Faulty Processors; Crypto\u201989, LNCS 435, Springer-Verlag, Berlin 1990, 560\u2013572."},{"key":"38_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/0-387-34805-0_45","volume-title":"Crypto\u201989","author":"J. Boyar","year":"1990","unstructured":"Joan Boyar, Ren\u00e9 Peralta: On the concrete complexity of zero-knowledge proofs; Crypto\u201989, LNCS 435, Springer-Verlag, Heidelberg 1990, 507\u2013525."},{"key":"38_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/3-540-46877-3_39","volume-title":"Eurocrypt\u201990","author":"G. Bleumer","year":"1991","unstructured":"Gerrit Bleumer, Birgit Pfitzmann, Michael Waidner: A Remark on a Signature Scheme where Forgery can be Proved; Eurocrypt\u201990, LNCS 473, Springer-Verlag, Berlin 1991, 441\u2013445."},{"key":"38_CR7","volume-title":"Efficient constant-round perfect zero-knowledge","author":"G. Brassard","year":"1990","unstructured":"Gilles Brassard: Efficient constant-round perfect zero-knowledge; D\u00e9partement d\u2019informatique et de R.O., Universit\u00e9 de Montr\u00e9al, C.P. 6128, Succ. \u201cA\u201d, Montr\u00e9al, Qu\u00e9bec Canada H3C 3J7, Dec. 1990. (Manuscript available from the author.)"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"David Chaum: Zero-Knowledge Undeniable Signatures; Eurocrypt\u201990, Abstracts, \u00c5rhus 1990, 419\u2013426.","DOI":"10.1007\/3-540-46877-3_41"},{"key":"38_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/3-540-46877-3_41","volume-title":"Eurocrypt\u201990","author":"D. Chaum","year":"1991","unstructured":"David Chaum: Zero-Knowledge Undeniable Signatures; Eurocrypt\u201990, LNCS 473, Springer-Verlag, Berlin 1991, 458\u2013464."},{"key":"38_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/0-387-34805-0_20","volume-title":"Crypto\u201989","author":"D. Chaum","year":"1990","unstructured":"David Chaum, Hans van Antwerpen: Undeniable signatures; Crypto\u201989, LNCS 435, Springer-Verlag, Heidelberg 1990, 212\u2013216."},{"key":"38_CR11","unstructured":"David Chaum, Joan Boyar, Ivan Damg\u00e5rd, Torben Pedersen: Undeniable Signatures: Applications and Theory; July 1, 1991. (Manuscript available from Ivan Damg\u00e5rd.)"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"David Chaum, Eug\u00e8ne van Heijst, Birgit Pfitzmann: Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer; Fakult\u00e4t f. Informatik, Univ. Karlsruhe, Internal Report 1\/91, February 1991.","DOI":"10.1007\/3-540-46766-1_38"},{"key":"38_CR13","unstructured":"David Chaum, Sandra Roijakkers: Unconditionally secure digital signatures; Crypto\u2019 90 Abstracts, 209\u2013217."},{"key":"38_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-39118-5_19","volume-title":"Eurocrypt\u201987","author":"I. Damg\u00e5rd","year":"1988","unstructured":"Ivan Damg\u00e5rd: Collision free hash functions and public key signature schemes; Eurocrypt\u201987, LNCS 304, Springer-Verlag, Berlin 1988, 203\u2013216."},{"key":"38_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Crypto\u201989","author":"I. Damg\u00e5rd","year":"1990","unstructured":"Ivan Damg\u00e5rd: A design principle for hash functions; Crypto\u201989, LNCS 435, Springer-Verlag, Heidelberg 1990, 416\u2013427."},{"issue":"6","key":"38_CR16","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22\/","author":"W. Diffie","year":"1976","unstructured":"Whitfield Diffie, Martin Hellman: New Directions in Cryptography; IEEE Transactions on Information Theory 22\/6 (1976) 644\u2013654.","journal-title":"IEEE Transactions on Information Theory"},{"key":"38_CR17","unstructured":"Yvo Desmedt, Moti Yung: Weaknesses of Undeniable Signature Schemes; Eurocrypt\u201991, Brighton, 8\u201311 April 1991, Abstracts, 111\u2013116."},{"issue":"2","key":"38_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17\/","author":"S. Goldwasser","year":"1988","unstructured":"Shafi Goldwasser, Silvio Micali, Ronald L. Rivest: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks; SIAM J. Comput. 17\/2 (1988) 281\u2013308.","journal-title":"SIAM J. Comput."},{"issue":"3","key":"38_CR19","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/j.1538-7305.1974.tb02751.x","volume":"53\/","author":"E. N. Gilbert","year":"1974","unstructured":"E. N. Gilbert, F. J. Mac Williams, N. J. A. Sloane: Codes which detect deception; The Bell System Technical Journal 53\/3 (1974) 405\u2013424.","journal-title":"The Bell System Technical Journal"},{"key":"38_CR20","doi-asserted-by":"crossref","unstructured":"Oded Goldreich, Silvio Micali, Avi Wigderson: Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design; 27th FOCS, IEEE Computer Society, 1986, 174\u2013187.","DOI":"10.1109\/SFCS.1986.47"},{"key":"38_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/3-540-48184-2_9","volume-title":"Crypto\u201987","author":"J. Graaf van de","year":"1988","unstructured":"Jeroen van de Graaf, Ren\u00e9 Peralta: A simple and secure way to show the validity of your public key; Crypto\u201987, LNCS 293, Springer-Verlag, Berlin 1988, 128\u2013134."},{"key":"38_CR22","doi-asserted-by":"crossref","unstructured":"Ralph Merkle: Protocols for Public Key Cryptosystems; Proceedings of the 1980 Symposium on Security and Privacy, April 14\u201316, 1980 Oakland, California, 122\u2013134.","DOI":"10.1109\/SP.1980.10006"},{"key":"38_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/3-540-48184-2_32","volume-title":"Crypto\u201987","author":"R. Merkle","year":"1988","unstructured":"Ralph Merkle: A digital signature based on a conventional encryption function; Crypto\u201987, LNCS 293, Springer-Verlag, Berlin 1988, 369\u2013378."},{"key":"38_CR24","first-page":"33","volume-title":"21st STOC","author":"M. Naor","year":"1989","unstructured":"Moni Naor, Moti Yung: Universal One-way Hash Functions and their Cryptographic Applications; 21st STOC, ACM, New York 1989, 33\u201343."},{"key":"38_CR25","doi-asserted-by":"crossref","unstructured":"Yair Oren: On the cunning power of cheating verifiers: some observations about zero-knowledge proofs; 28th FOCS, IEEE Computer Society, 1987, 462\u2013471.","DOI":"10.1109\/SFCS.1987.43"},{"key":"38_CR26","unstructured":"Torben Pedersen: Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing; Crypto\u201991, Santa Barbara, CA, 11.\u201315. August 1991, Abstracts 3.12\u20133.17."},{"key":"38_CR27","unstructured":"Birgit Pfitzmann: Fail-stop Signatures: Making Signers Unconditionally Secure; invited for Compsec, London 30.10.-1.11.1991, Proc. to be published by Elsevier."},{"key":"38_CR28","unstructured":"Birgit Pfitzmann, Michael Waidner: Formal Aspects of Fail-stop Signatures; Fakult\u00e4t f. Informatik, Univ. Karlsruhe, Internal Report 22\/90, 1990."},{"key":"38_CR29","unstructured":"Birgit Pfitzmann, Michael Waidner: Fail-stop Signatures and their Application; Securicom 91, Paris 1991, 145\u2013160."},{"key":"38_CR30","doi-asserted-by":"crossref","unstructured":"Martin Tompa, Heather Woll: Random self-reducibility and zero knowledge proofs of possession of information; 28th FOCS, IEEE Computer Society, 1987, 472\u2013482.","DOI":"10.1109\/SFCS.1987.49"},{"key":"38_CR31","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. Wegman","year":"1981","unstructured":"Mark Wegman, Lawrence Carter: New Hash Functions and Their Use in Authentication and Set Equality\u201d; Journal of Computer and System Sciences 22 (1981) 265\u2013279.","journal-title":"Journal of Computer and System Sciences"},{"key":"38_CR32","unstructured":"Michael Waidner, Birgit Pfitzmann: Unconditional Sender and Recipient Untraceability in spite of Active Attacks-Some Remarks; Fakult\u00e4t f. Informatik, Univ. Karlsruhe, Interner Bericht 5\/89, 1989."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201991"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46766-1_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:30:27Z","timestamp":1556739027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46766-1_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551881","9783540467663"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-46766-1_38","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1992]]}}}