{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:33:49Z","timestamp":1726407229614},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428800"},{"type":"electronic","value":"9783540456001"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45600-7_25","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T12:21:49Z","timestamp":1186834909000},"page":"221-232","source":"Crossref","is-referenced-by-count":7,"title":["Threshold Undeniable RSA Signature Scheme"],"prefix":"10.1007","author":[{"given":"Guilin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sihan","family":"Qing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingsheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhanfei","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,24]]},"reference":[{"key":"25_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/3-540-38424-3_14","volume-title":"Crypto\u201990","author":"J. Boyar","year":"1991","unstructured":"J. Boyar, D. Chaum, I. Damg\u00e5ard, and T. Pedersen. Convertible Undeniable Signatures. In Crypto\u201990, LNCS 537, pp. 189\u2013205. Springer-Verlag, 1991."},{"key":"25_CR2","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":"D. Chaum. Zero-Knowledge Undeniable Signatures. In: Eurocrypt\u201990, LNCS 473, pp. 458\u2013464. Springer-Verlag, 1991."},{"key":"25_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-48910-X_8","volume-title":"Eurocrypt\u201999","author":"J. Camenisch","year":"1999","unstructured":"J. Camenisch, and M. Michels. Proving in Zero-knowledge that a Number Is the Product of Two Safe Primes. In Eurocrypt\u201999, LNCS 1592, pp.107\u2013122. Springer-Verlag, 1999."},{"key":"25_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/3-540-47555-9_32","volume-title":"Eurocrypt\u201992","author":"D. Chaum","year":"1993","unstructured":"D. Chaum, and T.P. Pedersen. Transferred Cash Grows in Size. In Eurocrypt\u201992, LNCS 658, pp. 390\u2013407. Springer-Verlag, 1993."},{"key":"25_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Crypto\u201992","author":"D. Chaum","year":"1993","unstructured":"D. Chaum, and T.P. Pedersen. Wallet Databases With Observers. In Crypto\u201992, LNCS 740, pp. 89\u2013105. Springer-Verlag, 1993."},{"key":"25_CR6","series-title":"Lect Notes Comput Sci","first-page":"212","volume-title":"Crypto\u201989","author":"D. Chaum","year":"1989","unstructured":"D. Chaum, and H. Van Antwerpen. Undeniable Signatures. In Crypto\u201989, LNCS 435, pp. 212\u2013216. Springer-Verlag, 1989."},{"key":"25_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/3-540-48184-2_8","volume-title":"Crypto\u201987","author":"Y. Desmedt","year":"1988","unstructured":"Y. Desmedt. Society and Group Oriented Cryptography: A New Concept. In Crypto\u201987, LNCS 293, pp. 120\u2013127. Springer-Verlag, 1988."},{"key":"25_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Crypto\u201989","author":"Y. Desmedt","year":"1990","unstructured":"Y. Desmedt, and Y. Frankel. Threshold Cryptosystems. In Crypto\u201989, LNCS 435, pp. 307\u2013315. Springer-Verlag, 1990."},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5ard, and M. Koprowski. Practical Threshold RSA Signature Without a Trusted Dealer. In Eurocrypt 2001 (to appear). Available from http:\/\/www.daimi. au.dk\/ ivan\/papers.html","DOI":"10.1007\/3-540-44987-6_10"},{"key":"25_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/3-540-68339-9_32","volume-title":"Eurocrypt\u201996","author":"I. Damg\u00e5ard","year":"1996","unstructured":"I. Damg\u00e5ard, and T. Pedersen. New Convertible Undeniable Signature Schemes. In Eurocrypt\u201996, LNCS 1070, pp. 372\u2013386. Springer-Verlag, 1996."},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. D. MacKenzie, and M. Yung. Robust Efficient Distributed RSA-Key Generation. In 30th STOC, pp. 663\u2013672. ACM, 1998.","DOI":"10.1145\/276698.276882"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"R. Gennaro, H. Krawczyk, and T. Rabin. RSA-Based Undeniable Signature. In Crypto\u201997, pp. 132\u2013148. Springer-Verlag, 1997.","DOI":"10.1007\/BFb0052232"},{"key":"25_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/3-540-57220-1_57","volume-title":"Auscrypt\u201992","author":"L. Harn","year":"1993","unstructured":"L. Harn, and S. Yang. Group-Oriented Undeniable Signature Schemes without the Assistance of a Mutually Trusted Party. In Auscrypt\u201992, LNCS 718, pp. 133\u2013142. Springer-Verlag, 1993."},{"key":"25_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-68697-5_6","volume-title":"Crypto\u201996","author":"S.K. Langford","year":"1996","unstructured":"S.K. Langford. Weakness in Some Threshold Cryptosystems. In Crypto\u201996, LNCS 1109, pp. 74\u201382. Springer-Verlag, 1996."},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1016\/S0140-3664(99)00042-0","volume":"22","author":"N.-Y. Lee","year":"1999","unstructured":"N.-Y. Lee, and T. Hwang. Group-Oriented Undeniable Signature Schemes with a Trusted Center. Computer Communications, 1999, 22: 730\u2013734.","journal-title":"Computer Communications"},{"key":"25_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/BFb0023305","volume-title":"Information Security and Privacy, ACISP\u201996","author":"C.-H. Lin","year":"1996","unstructured":"C.-H. Lin, C.-T. Wang, and C.-C. Chang. A Group-Oriented (t, n) Undeniable Signature Scheme without Trusted Center. In: Information Security and Privacy, ACISP\u201996, LNCS 1172, pp. 266\u2013274. Springer-Verlag, 1996."},{"key":"25_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Crypto\u201991","author":"T.P. Pedersen","year":"1992","unstructured":"T.P. Pedersen. No-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In Crypto\u201991, LNCS 576, pp. 129\u2013140. Springer-Verlag, 1992."},{"key":"25_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/3-540-48405-1_10","volume-title":"Crypto\u201999","author":"B. Schoenmakers","year":"1999","unstructured":"B. Schoenmakers. A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting. In Crypto\u201999, LNCS 1666, pp. 148\u2013164. Springer-Verlag, 1999."},{"issue":"11","key":"25_CR19","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to Share a Secret. Communications of the ACM, 1979, 22(11): 612\u2013613.","journal-title":"Communications of the ACM"},{"key":"25_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/3-540-45539-6_15","volume-title":"Eurocrypt\u20192000","author":"V. Shoup","year":"2000","unstructured":"V. Shoup. Practical Threshold Signatures. In Eurocrypt\u20192000, LNCS 1807, pp. 207\u2013220. Springer-Verlag, 2000. Avalaible from http:\/\/www.shoup.net\/papers\/"},{"key":"25_CR21","series-title":"Lect Notes Comput Sci","first-page":"191","volume-title":"Eurocrypt\u201996","author":"M. Stadler","year":"1996","unstructured":"M. Stadler. Publicly Verifiable Secret Sharing. In Eurocrypt\u201996, LNCS 1070, pp. 191\u2013199. Springer-Verlag, 1996."}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45600-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:20:43Z","timestamp":1556752843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45600-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428800","9783540456001"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45600-7_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}