{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:51:52Z","timestamp":1778215912216,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540003243","type":"print"},{"value":"9783540362883","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36288-6_3","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T20:45:01Z","timestamp":1180903501000},"page":"31-46","source":"Crossref","is-referenced-by-count":549,"title":["Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme"],"prefix":"10.1007","author":[{"given":"Alexandra","family":"Boldyreva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols. First ACM Conference on Computer and Communications Security, ACM, 1993.","DOI":"10.1145\/168588.168596"},{"key":"3_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Financial Cryptography 01","author":"M. Bellare","year":"2001","unstructured":"M. Bellare, C. Namprempre, D. Pointcheval and M. Semanko, \u201cThe One-More-RSA-Inversion Problems and the security of Chaum\u2019s Blind Signature Scheme,\u201d Financial Cryptography 01, Lecture Notes in Computer Science, 2001. 36 35, 43"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, J. Garay and T. Rabin, \u201cFast batch verification for modular exponentiation and digital signatures,\u201d Eurocrypt 98, 1998.. 40","DOI":"10.1007\/BFb0054130"},{"key":"3_CR4","unstructured":"E. Berlekamp and L. Welch, \u201cError correction of algebraic block codes,\u201d US Patent 4,633,470. 33"},{"key":"3_CR5","unstructured":"A. Boldyreva \u201cThreshold signatures, multisignatures and blind signatures based on the Gap-Diffie-Hellman-group signature scheme,\u201d Full version of this paper. Available at http:\/\/www-cse.ucsd.edu\/users\/aboldyre\/ . 35, 36, 39, 42, 44"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"D. Boneh and M. Franklin. \u201cIdentity-based encryption from the Weil Pairing,\u201d Crypto 01, 2001.","DOI":"10.1007\/3-540-44647-8_13"},{"key":"3_CR7","unstructured":"D. Boneh, C. Gentry, B. Lynn and H. Shacham, \u201cAggregate signatures from bilinear maps,\u201d Manuscript. 34"},{"key":"3_CR8","unstructured":"D. Boneh, B. Lynn and H. Shacham, \u201cShort signatures from theWeil pairing,\u201d Asiacrypt 01, 2001. 31, 32, 36, 37, 40, 42"},{"key":"3_CR9","unstructured":"C. Boyd, \u201cDigital multisignatures,\u201d Cryptography and Coding, 198632"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"J. Camenisch and M. Stadler, \u201cEfficient group signatures for large groups,\u201d Crypto 97, 1997. 34","DOI":"10.1007\/BFb0052252"},{"key":"3_CR11","unstructured":"D. Chaum, \u201cBlind signatures for untreaceable payments,\u201d Crypto 82, 1982. 35, 43"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"D. Chaum and E. van Heyst, \u201cGroup signatures,\u201d Eurocrypt 91, 1991.","DOI":"10.1007\/3-540-46416-6_22"},{"key":"3_CR13","unstructured":"R. Canetti and A. Herzberg, \u201cMaintaining security in the presence of transient faults,\u201d Crypto 94, 1994. 32, 34"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Y. Desmedt, \u201cSociety and group oriented cryptography,\u201d Crypto 87, 1987. 32","DOI":"10.1007\/3-540-48184-2_8"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Y. Desmedt, \u201cThreshold cryptography,\u201d, European Transactions on Telecommunications, 5(4), 1994. 32","DOI":"10.1002\/ett.4460050407"},{"key":"3_CR16","unstructured":"Y. Desmedt and Y. Frankel, \u201cThreshold cryptosystems,\u201d Crypto 89, 1989. 32, 33"},{"key":"3_CR17","unstructured":"Y. Desmedt and Y. Frankel, \u201cShared generation of authenticators and signatures,\u201d Crypto 91, 1991. 33"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"P. Feldman \u201cAp ractical scheme for non-interactive verifiable secret sharing,\u201d FOCS 87, 1987. 38","DOI":"10.1109\/SFCS.1987.4"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. Gemmal, P. Mac Kenzie and M. Yung, \u201cProactive RSA,\u201d Crypto 97, 1997. 33","DOI":"10.1007\/BFb0052254"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"S. Galbraith, J. Malone-Lee, N.P. Smart, \u201cPublic key signatures in the multi-user setting\u201d, Information Processing Letters, Vol. 83, Issue 5, 2002.","DOI":"10.1016\/S0020-0190(01)00338-6"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin, \u201cRobust threshold DSS signatures,\u201d Eurocrypt 96, 1996. 33, 38","DOI":"10.1007\/3-540-68339-9_31"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin, \u201cSecure distributed key generation for discrete-log based cryptosystems\u201d, Eurocrypt 99, 1999. 38","DOI":"10.1007\/3-540-48910-X_21"},{"issue":"2","key":"3_CR23","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. Rivest, \u201cAd igital signature secure against adaptive chosen-message attacks\u201d, SIAM Journal on Computing, 17(2):281\u2013308, 1988. 36, 42","journal-title":"SIAM Journal on Computing"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"L. Harn, \u201cGroup-oriented (t,n) threshold digital signature scheme and digital multisignature,\u201d IEE Proc. Computers and Digital Techniques, 141(5), 1994. 33, 34","DOI":"10.1049\/ip-cdt:19941293"},{"key":"3_CR25","first-page":"612","volume":"22","author":"A. Herzberg","year":"1979","unstructured":"A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk and M. Yung, \u201cProactive public key and signature systems,\u201d ACM Conference on Computers and Communication Security, 1997. 22:612\u2013613, (1979). 33, 39","journal-title":"Proactive public key and signature systems"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"A. Herzberg, S. Jarecki, H. Krawczyk and M. Yung, \u201cProactive secret sharing, or: How to cope with perpetual leakage,\u201d, Crypto 95, 1995. 33, 39","DOI":"10.1007\/3-540-44750-4_27"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"P. Horster, M. Michels and H. Petersen, \u201cMeta-multisignatures schemes based on the discrete logarithm problem,\u201d IFIP\/Sec1995. 34","DOI":"10.1007\/978-0-387-34873-5_11"},{"key":"3_CR28","first-page":"1","volume":"71","author":"K. Itakura","year":"1983","unstructured":"K. Itakura and K. Nakamura, \u201cApublic key cryptosystem suitable for digital multisignatures,\u201d NEC Research & Development, 71:1\u20138, 1983. 34","journal-title":"NEC Research & Development"},{"key":"3_CR29","unstructured":"A. Joux, \u201cAon e-round protocol for tripartite Diffie-Hellman,\u201d ANTS-IV conference, vol. 1838. 31, 36"},{"key":"3_CR30","unstructured":"A. Joux and K. Nguyen, \u201cSeparating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups,\u201d e-print archive, report #2001\/03. 31, 36"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"C. Li, T. Hwang and N. Lee, \u201cThreshold-multisignature schemes where suspected forgery implies traceability of adversarial shareholders,\u201d Eurocrypt 94, 1994. 34","DOI":"10.1007\/BFb0053435"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"A. Lysyanskaya, \u201cUnique signatures and verifiiable random functions from the DH-DDH separation\u201d, Crypto 02, 2002. 31","DOI":"10.1007\/3-540-45708-9_38"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"S. Micali, K. Ohta and L. Reyzin, \u201cAccountable-subgroup multisignatures,\u201d ACM Conference on Computer and Communications Security, 2001. 34, 35, 40, 41, 44","DOI":"10.1145\/501983.502017"},{"issue":"4","key":"3_CR34","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1145\/48012.48246","volume":"6","author":"T. Okamoto","year":"1988","unstructured":"T. Okamoto, \u201cAdigital multisignature schema using bijective public-key cryptosystems,\u201d ACM Transaction on Computer Systems, 6(4): 432\u2013441, 1988. 34","journal-title":"ACM Transaction on Computer Systems"},{"key":"3_CR35","unstructured":"K. Ohta and T. Okamoto, \u201cAdigital multisignature scheme based on the Fiat-Shamir scheme\u201d, Asiacrypt 91, 1991. 34"},{"issue":"1","key":"3_CR36","first-page":"21","volume":"E82-A","author":"K. Ohta","year":"1999","unstructured":"K. Ohta and T. Okamoto, \u201cMulti-signature scheme secure against active insider attacks\u201d, IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, E82-A(1):21\u201331, 1999. 34","journal-title":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky and M. Yung, \u201cHow to withstand mobile virus attacks,\u201d PODC, 1991. 32","DOI":"10.1145\/112600.112605"},{"key":"3_CR38","unstructured":"T. Pedersen, \u201cNon-interactive and information-theoretic secure verifiable secret sharing,\u201d Eurocrypt 91, 1991. 38"},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"D. Pointcheval and J. Stern, \u201cProvably secure blind signature schemes,\u201d Asiacrypt 96, 1996. 42","DOI":"10.1007\/BFb0034852"},{"issue":"3","key":"3_CR40","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D. Pointcheval","year":"2000","unstructured":"D. Pointcheval and J. Stern, \u201cSecurity arguments for digital signatures and blind signatures,\u201d Journal of Cryptology, 13(3):361\u2013396, 2000. 42","journal-title":"Journal of Cryptology"},{"key":"3_CR41","doi-asserted-by":"crossref","unstructured":"T. Rabin, \u201cAsim plified approach to threshold and proactive RSA,\u201d Crypto 98, 1998. 33","DOI":"10.1007\/BFb0055722"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"R. Rivest, A. Shamir and Y. Tauman, \u201cHow to leak a secret\u201d, Asiacrypt 01, 2001. 34","DOI":"10.1007\/3-540-45682-1_32"},{"key":"3_CR43","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, \u201cHow to share a secret,\u201d Communications of the ACM, 22:612\u2013613, (1979). 32, 38","journal-title":"Communications of the ACM"},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"V. Shoup, \u201cPractical threshold signatures\u201d, Eurocrypt 00, 2000.","DOI":"10.1007\/3-540-45539-6_15"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2014 PKC 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36288-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T16:56:29Z","timestamp":1556470589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36288-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,18]]},"ISBN":["9783540003243","9783540362883"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/3-540-36288-6_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12,18]]}}}