{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T07:17:19Z","timestamp":1772695039350,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540546207","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-46416-6_20","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T18:02:07Z","timestamp":1186423327000},"page":"221-242","source":"Crossref","is-referenced-by-count":124,"title":["Distributed Provers with Applications to Undeniable Signatures"],"prefix":"10.1007","author":[{"given":"Torben Pryds","family":"Pedersen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"J. Boyar, D. Chaum, I. Damg\u00e5rd, and T. Pedersen. Convertible undeniable signatures, 1990. To appear in the proceedings of Crypto\u201990.","DOI":"10.7146\/dpb.v19i330.6719"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multiprover interactive proofs: How to remove intractability. In Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, pages 113\u2013131, 1988.","DOI":"10.1145\/62212.62223"},{"key":"20_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-48184-2_7","volume-title":"Advances in Cryptology \u2014 proceedings of CRYPTO 87","author":"D. Chaum","year":"1988","unstructured":"D. Chaum, I. Damg\u00e5rd, and J. van de Graaf. Multiparty computations ensuring privacy of each party\u2019s input and correctness of the result. In Advances in Cryptology \u2014 proceedings of CRYPTO 87, Lecture Notes in Computer Science, pages 87\u2013119. Springer-Verlag, 1988."},{"key":"20_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/3-540-46877-3_41","volume-title":"Advances in Cryptology \u2014 proceedings of EUROCRYPT 90","author":"D. Chaum","year":"1991","unstructured":"D. Chaum. Zero-knowledge undeniable signatures. In Advances in Cryptology \u2014 proceedings of EUROCRYPT 90, Lecture Notes in Computer Science, pages 458\u2013464. Springer Verlag, 1991."},{"key":"20_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 proceedings of CRYPTO 89","author":"D. Chaum","year":"1990","unstructured":"D. Chaum and H. van Antwerpen. Undeniable signatures. In Advances in Cryptology \u2014 proceedings of CRYPTO 89, Lecture Notes in Computer Science. Springer Verlag, 1990."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science, pages 427\u2013437, 1987.","DOI":"10.1109\/SFCS.1987.4"},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to share a secret. CACM, 22:612\u2013613, 1979.","journal-title":"CACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201991"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46416-6_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:11:24Z","timestamp":1605647484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46416-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540546207"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-46416-6_20","relation":{},"subject":[]}}