{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:50:35Z","timestamp":1725475835001},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673804"},{"type":"electronic","value":"9783540455684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10719994_17","type":"book-chapter","created":{"date-parts":[[2006,12,30]],"date-time":"2006-12-30T15:38:40Z","timestamp":1167493120000},"page":"208-220","source":"Crossref","is-referenced-by-count":0,"title":["A New Approach to Efficient Verifiable Secret Sharing for Threshold KCDSA Signature"],"prefix":"10.1007","author":[{"given":"Ho-Sun","family":"Yoon","sequence":"first","affiliation":[]},{"given":"Heung-Youl","family":"Youm","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M., Rabin, T.: Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold cryptography (1998) (preprint), http:\/\/theory.lcs.mit.edu\/~rosario\/research.html","DOI":"10.1145\/277697.277716"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to Share a Secret. Communication of the ACM\u00a022, 612\u2013613 (1979)","journal-title":"Communication of the ACM"},{"key":"17_CR3","first-page":"427","volume-title":"Proc. 28th Annual Symposium Foundations of Computer Science","author":"P. Feldman","year":"1987","unstructured":"Feldman, P.: A Practical Scheme for Non-Interactive Verifiable Secret Sharing. In: Proc. 28th Annual Symposium Foundations of Computer Science, pp. 427\u2013437. IEEE, Los Alamitos (1987)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Pedersen, T.: Non-interactive and Information-theoretic Secure Verifiable Secret Sharing. In: Crypto 1991, pp. 129\u2013140 (1991)","DOI":"10.1007\/3-540-46766-1_9"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"T. Pedersen","year":"1991","unstructured":"Pedersen, T.: A Threshold Cryptosystem Without a Trusted Party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 522\u2013526. Springer, Heidelberg (1991)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive Secret Sharing Or: How to Cope With Perpetual Leakage. In: Crypto 1995 (1995)","DOI":"10.1007\/3-540-44750-4_27"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Cachin, C.: On-line secret sharing. In: Proceeding of the 5th IMA conference on Cryptography and Coding, pp. 190\u2013198 (1995)","DOI":"10.1007\/3-540-60693-9_22"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Pinch, R.G.E.: On-line Multiple Secret Sharing. Electronic Letters, 1087\u20131088 (1996)","DOI":"10.1049\/el:19960692"},{"key":"17_CR9","unstructured":"Yeun, C.Y., Mitchell, C.J., Burmester, M.: An Online Secret Sharing which Identifies All Cheater. In: Proceeding of NORDSEC (1998)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Langford, S.: Threshold DSS Signatures Without a Trusted Party. In: Crypto 1995, pp. 397\u2013409 (1995)","DOI":"10.1007\/3-540-44750-4_32"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Boneh, D., Franklin, M.: Efficient Generation of Shared RSA keys. In: Crypto 1997, pp. 425\u2013439 (1997)","DOI":"10.1007\/BFb0052253"},{"key":"17_CR12","unstructured":"Malkin, M., Wu, T., Boneh, D.: Experimenting with Shared Generation of RSA keys. http:\/\/theory.stanford.edu\/~dabo\/pubs.html (preprint)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Rabin, T.: A simplified approach to threshold and proactive RSA. In: Crypto 1998 (1998)","DOI":"10.1007\/BFb0055722"},{"key":"17_CR14","unstructured":"Park, C., Kurosawa, K.: New ElGamal Type Threshold Digital Signature Scheme. IEICE Trans. Fundamentals\u00a0E79-A(l), 86\u201393 (1996)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust Threshold DSS signature. In: Eurocrypt 1996, pp. 354\u2013371 (1996)","DOI":"10.1007\/3-540-68339-9_31"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/3-540-49649-1_15","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"C.H. Lim","year":"1998","unstructured":"Lim, C.H., Lee, P.J.: A Study on the Proposed Korean Digital Signature Algorithm. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 175\u2013186. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10719994_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T07:58:56Z","timestamp":1556006336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10719994_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673804","9783540455684"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/10719994_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}