{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T09:36:50Z","timestamp":1773653810231,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540545088","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-38424-3_14","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T13:05:56Z","timestamp":1196687156000},"page":"189-205","source":"Crossref","is-referenced-by-count":93,"title":["Convertible Undeniable Signatures"],"prefix":"10.1007","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[]},{"given":"David","family":"Chaum","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[]},{"given":"Torben","family":"Pedersen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_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, and Claude Cr\u00e9peau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37:156\u2013189, 1988.","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"J\u00f8rgen Brandt, Ivan Damg\u00e5rd, Peter Landrock, and Torben Pedersen. Zero-knowledge authentication scheme with secret key exchange. Submitted to Journal of Cryptology, 1989.","DOI":"10.1007\/0-387-34799-2_43"},{"key":"14_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-39118-5","volume-title":"Advances in Cryptology \u2014 proceedings of EURO-CRYPT 87","author":"D. Chaum","year":"1988","unstructured":"David Chaum, Jan-Hendrik Evertse, and Jeroen van de Graaf. An improved protocol for demonstrating possession of discrete logarithms and some generalizations. In Advances in Cryptology \u2014 proceedings of EURO-CRYPT 87, Lecture Notes in Computer Science. Springer-Verlag, 1988."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"David Chaum. Zero-knowledge undeniable signatures. To appear in the proceedings of EUROCRYPT\u201990, 1990.","DOI":"10.1007\/3-540-46877-3_41"},{"key":"14_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-proceedings of CRYPTO 89","author":"D. Chaum","year":"1990","unstructured":"David Chaum and Hans van Antwerpen. Undeniable signatures. In Advances in Cryptology-proceedings of CRYPTO 89, Lecture Notes in Computer Science. Springer Verlag, 1990."},{"key":"14_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-proceedings of CRYPTO 84","author":"T. Gamal El","year":"1985","unstructured":"Taher El Gamal. A public key cryptosystem and a signatures scheme based on discrete logarithms. In Advances in Cryptology-proceedings of CRYPTO 84, Lecture Notes in Computer Science. Springer-Verlag, 1985."},{"key":"14_CR7","unstructured":"Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to construct random functions. In Proceedings of the 25th IEEE Symposium on the Foundations of Computer Science, 1984."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Oded Goldreich and Leonid A. Levin. A hard-core predicate for all one-way functions. In Proceedings of the 21st Annual ACM Symposium on the Theory of Computing, 1989.","DOI":"10.1145\/73007.73010"},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen message attack. SIAM Journal on Computing, 17(2):281\u2013308, April 1988.","journal-title":"SIAM Journal on Computing"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science, pages 174\u2013187, 1986.","DOI":"10.1109\/SFCS.1986.47"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Russel Impagliazzo and Michael Luby. One-way functions are essential for complexity based cryptography. In Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science, 1989.","DOI":"10.1109\/SFCS.1989.63483"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Russell Impagliazzo, Leonid A. Levin, and Michael Luby. Pseudo-random generation from one-way functions. In Proceedings of the 21st Annual ACM Symposium on the Theory of Computing, 1989.","DOI":"10.1145\/73007.73009"},{"key":"14_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-48184-2_4","volume-title":"Advances in Cryptology \u2014 proceedings of CRYPTO 87","author":"R. Impagliazzo","year":"1988","unstructured":"Russel Impagliazzo and Moti Yung. Direct minimum-knowledge computations. In Advances in Cryptology \u2014 proceedings of CRYPTO 87, Lecture Notes in Computer Science, pages 40\u201351. Springer-Verlag, 1988."},{"key":"14_CR14","unstructured":"S. Micali, August 1990. Personal communication."},{"key":"14_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/0-387-34805-0_13","volume-title":"Advances in Cryptology \u2014 proceedings of CRYPTO 89","author":"M. Naor","year":"1990","unstructured":"Moni Naor. Bit commitment using randomness. In Advances in Cryptology \u2014 proceedings of CRYPTO 89, Lecture Notes in Computer Science, pages 128\u2013136, 1990."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"John Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, 1990.","DOI":"10.1145\/100216.100269"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology-CRYPT0\u2019 90"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-38424-3_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:05:12Z","timestamp":1605647112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-38424-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540545088"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-38424-3_14","relation":{},"subject":[]}}