{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:02:29Z","timestamp":1737435749314,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540629757"},{"type":"electronic","value":"9783540690535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-69053-0_31","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:24:05Z","timestamp":1186363445000},"page":"450-464","source":"Crossref","is-referenced-by-count":23,"title":["Distributed \u201cMagic Ink\u201d Signatures"],"prefix":"10.1007","author":[{"given":"Markus","family":"Jakobsson","sequence":"first","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, \u201cCompleteness Theorems for Non-cryptographic Fault-Tolerant Distributed Computations,\u201d STOC\u2019 88, pp. 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"31_CR2","unstructured":"E. Brickell, P. Gemmell, D. Kravitz, \u201cTrustee-based Tracing Extensions to Anonymous Cash and the Making of Anonymous Change,\u201d Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1995, pp. 457\u2013466."},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"J. Camenisch, U. Maurer, M. Stadler, \u201cDigital Payment Systems with Passive Anonymity-Revoking Trustees,\u201d Computer Security-ESORICS 96, volume 1146, pp. 33\u201343.","DOI":"10.1007\/3-540-61770-1_26"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"J. Camenisch, J-M. Piveteau, M. Stadler, \u201cAn Efficient Fair Payment System,\u201d 3rd ACM Conf. on Comp. and Comm. Security, 1996, pp. 88\u201394.","DOI":"10.1145\/238168.238193"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"D. Chaum, \u201cBlind Signatures for Untraceable Payments,\u201d Advances in Cryptology \u2014 Proceedings of Crypto\u2019 82, 1983, pp. 199\u2013203.","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"D. Chaum, H. Van Antwerpen, \u201cUndeniable Signatures,\u201d Advances in Cryptology \u2014 Proceedings of Crypto\u2019 89, pp. 212\u2013216.","DOI":"10.1007\/0-387-34805-0_20"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"D. Chaum, A. Fiat and M. Naor, \u201cUntraceable Electronic Cash,\u201d Advances in Cryptology \u2014 Proceedings of Crypto\u2019 88, pp. 319\u2013327.","DOI":"10.1007\/0-387-34799-2_25"},{"key":"31_CR8","unstructured":"G.I. Davida, Y. Frankel, Y. Tsiounis, and M. Yung, \u201cAnonymity Control in E-Cash Systems,\u201d Financial Cryptography 97."},{"key":"31_CR9","unstructured":"Y. Desmedt, Y. Frankel, \u201cThreshold Cryptosystems,\u201d Advances in Cryptology \u2014 Proceedings of Crypto\u2019 89."},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"P. Feldman, \u201cA Practical Scheme for Non-Interactive Verifiable Secret Sharing\u201d FOCS\u2019 87, pp. 427\u2013437.","DOI":"10.1109\/SFCS.1987.4"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Y. Frankel, Y. Tsiounis, and M. Yung, \u201cIndirect Discourse Proofs: Achieving Efficient Fair Off-Line E-Cash,\u201d Advances in Cryptology \u2014 Proceedings of Asiacrypt 96, pp. 286\u2013300.","DOI":"10.1007\/BFb0034855"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, T. Rabin, \u201cRobust Threshold DSS Signatures\u201d, Advances in Cryptology \u2014 Proceedings of Eurocrypt\u2019 96, pp. 354\u2013371.","DOI":"10.1007\/3-540-68339-9_31"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali, \u201cProbabilistic Encryption\u201d. J. Comp. Sys. Sci. 28, pp 270\u2013299, 1984.","journal-title":"J. Comp. Sys. Sci."},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, M. Yung, \u201cProactive Public Key and Signature Systems,\u201d 4th ACM Conf. on Comp. and Comm. Security, 1997.","DOI":"10.1145\/266420.266442"},{"key":"31_CR15","unstructured":"A. Herzberg, S. Jarecki, H. Krawczyk, M. Yung, \u201cProactive Secret Sharing, or How to Cope with Perpetual Leakage,\u201d Advances in Cryptology \u2014 Proceedings of Crypto\u2019 95."},{"key":"31_CR16","unstructured":"R. Impagliazzo and S. Rudich, Limits on the Provable Consequences of One-way Permutations, STOC\u2019 89."},{"key":"31_CR17","volume-title":"Privacy vs. Authenticity","author":"M. Jakobsson","year":"1997","unstructured":"M. Jakobsson, \u201cPrivacy vs. Authenticity,\u201d PhD Thesis, University of California, San Diego, Department of Computer Science and Engineering, 1997. Available at http:\/\/www-cse.ucsd.edu\/users\/markus\/ ."},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"M. Jakobsson and M. Yung, \u201cRevocable and Versatile Electronic Money,\u201d 3rd ACM Conference on Comp. and Comm. Security, 1996, pp. 76\u201387.","DOI":"10.1145\/238168.238191"},{"key":"31_CR19","unstructured":"M. Jakobsson and M. Yung, \u201cApplying Anti-Trust Policies to Increase Trust in a Versatile E-Money System,\u201d Financial Cryptography\u2019 97."},{"key":"31_CR20","unstructured":"S. Micali, \u201cFair Cryptosystems,\u201d Advances in Cryptology \u2014 Proceedings of Crypto\u2019 92."},{"issue":"169","key":"31_CR21","first-page":"30","volume":"56","author":"National Institute for Standards and Technology, \u201cDigital Signature Standard (DSS)","year":"1991","unstructured":"National Institute for Standards and Technology, \u201cDigital Signature Standard (DSS),\u201d Federal Register Vol 56(169), Aug 30, 1991.","journal-title":"Federal Register Vol"},{"key":"31_CR22","doi-asserted-by":"crossref","unstructured":"T.P. Pedersen, \u201cDistributed Provers with Applications to Undeniable Signatures,\u201d Advances in Cryptology \u2014 Proceedings of Eurocrypt\u2019 91, pp. 221\u2013242.","DOI":"10.1007\/3-540-46416-6_20"},{"key":"31_CR23","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/0167-4048(92)90193-U","volume":"11","author":"S. Solms von","year":"1992","unstructured":"S. von Solms and D. Naccache, \u201cOn Blind Signatures and Perfect Crimes,\u201d Computers and Security, 11 (1992) pp. 581\u2013583.","journal-title":"Computers and Security"},{"key":"31_CR24","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, \u201cHow to Share a Secret,\u201d CACM, V. 22, 1979, pp. 612\u2013613.","journal-title":"CACM"},{"key":"31_CR25","doi-asserted-by":"crossref","unstructured":"M. Stadler, J-M. Piveteau, J. Camenisch, \u201cFair Blind Signatures,\u201d Advances in Cryptology \u2014 Proceedings of Eurocrypt\u2019 95, 1995.","DOI":"10.1007\/3-540-49264-X_17"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69053-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T04:19:34Z","timestamp":1737346774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69053-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540629757","9783540690535"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-69053-0_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1997]]}}}