{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T18:10:38Z","timestamp":1778263838124,"version":"3.51.4"},"publisher-location":"Boston, MA","reference-count":14,"publisher":"Springer US","isbn-type":[{"value":"9781441959058","type":"print"},{"value":"9781441959065","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-1-4419-5906-5_233","type":"book-chapter","created":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T09:50:45Z","timestamp":1319709045000},"page":"1294-1296","source":"Crossref","is-referenced-by-count":5,"title":["Threshold Signature"],"prefix":"10.1007","author":[{"given":"Gerrit","family":"Bleumer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"233_CR1_233","volume-title":"Public key cryptography (PKC) 2003, Lecture notes in computer science, vol 2567","author":"A Boldyreva","year":"2003","unstructured":"Boldyreva A (2003) Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie\u2013Hellman-Group signature scheme. In: Desmedt YG (ed) Public key cryptography (PKC) 2003, Lecture notes in computer science, vol 2567. Springer, Berlin"},{"key":"233_CR2_233","unstructured":"Boyd C (1989) Digital multisignatures. In: First IMA symposium on cryptography and coding, Cirencester, 1986. Clarendon, Oxford, pp 241\u2013246"},{"key":"233_CR3_233","unstructured":"Camenisch J, Michels M (1999) Separability and efficiency of generic group signatures. In: Wiener J (ed) Advances in cryptology\u00a0\u2013 CRYPTO\u201999. Lecture notes in computer science, vol 1666. Springer, Berlin, pp 413\u2013430"},{"key":"233_CR4_233","unstructured":"Desmedt Y (1993) Threshold cryptography. In: Seberny J, Zheng Y (eds) Advances in cryptology\u00a0\u2013 ASIACRYPT\u201992. Lecture notes in computer science, vol 718. Springer, Berlin, pp\u00a03\u201314"},{"key":"233_CR5_233","unstructured":"Desmedt Y (1997) Some recent research aspects of threshold cryptography. In: Vulkov LG, Wasniewski J, Yalamov PY (eds) Information security, first international workshop ISW\u201997. Lecture notes in computer science, vol 1196. Springer, Berlin, pp\u00a0158\u2013173"},{"key":"233_CR6_233","unstructured":"Desmedt YG, Frankel Y (1990) Threshold cryptosystems. In: Brassard G (ed) Advances in cryptology\u00a0\u2013 CRYPTO\u201989. Lecture notes in computer science, vol 435. Springer, Berlin, pp 307\u2013315"},{"key":"233_CR7_233","unstructured":"Desmedt Y, Frankel Y (1992) Shared generation of authenticators and signatures. In: Feigenbaum J (ed) Advances in cryptology\u00a0\u2013 CRYPTO\u201991. Lecture notes in computer science, vol 576. Springer, Berlin, pp 457\u2013469"},{"key":"233_CR8_233","unstructured":"Gennaro R, Jarecki S, Krawczyk H, Rabin T (1996) Robust threshold DSS signatures. In: Maurer U (ed) Advances in cryptology\u00a0\u2013 EUROCRYPT\u201996. Lecture notes in computer science, vol 1070. Springer, Berlin, pp 354\u2013371"},{"issue":"2","key":"233_CR9_233","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S Goldwasser","year":"1988","unstructured":"Goldwasser S, Micali S, Rivest RL (1988) A digital signature scheme secure against adaptive chosen-message attacks. SIAM J Comput 17(2):281\u2013308","journal-title":"SIAM J Comput"},{"key":"233_CR10_233","unstructured":"Herzberg A, Jarecki S, Krawczyk H, Yung M (1995) Proactive secret sharing, or: how to deal with perpetual leakeage. In: Coppersmith D (ed) Advances in cryptology\u00a0\u2013 CRYPTO\u201995. Lecture notes in computer science, vol 963. Springer, Berlin, pp 339\u2013352"},{"key":"233_CR11_233","unstructured":"Jarecki S, Lysyanskaya A (2000) Adaptively secure threshold cryptography. Introducing concurrency, removing erasures. In: Preneel B (ed) Advances in cryptology\u00a0\u2013 EUROCRYPT 2000. Lecture notes in computer science, vol 1807. Springer, Berlin, pp\u00a0221\u2013242"},{"key":"233_CR12_233","unstructured":"Micali S, Ohta K, Reyzin L (2001) Accountable subgroup multisignatures. In: Eighth ACM conference on computer and communication security (CCS-8). ACM Press, New York, pp\u00a0245\u2013254"},{"key":"233_CR13_233","unstructured":"Rabin T (1998) A simplified approach to threshold and proactive RSA. In: Krawczyk H (ed) Advances in cryptology\u00a0\u2013 CRYPTO\u201998. Lecture notes in computer science, vol 1462. Springer, Berlin, pp 89\u2013104"},{"key":"233_CR14_233","unstructured":"Shoup V (2000) Practical threshold signatures. In: Preneel B (ed) Advances in cryptology\u00a0\u2013 EUROCRYPT 2000. Lecture notes in computer science, vol 1807. Springer, Berlin, pp 207\u2013220"}],"container-title":["Encyclopedia of Cryptography and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-5906-5_233","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T17:37:17Z","timestamp":1778261837000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-5906-5_233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9781441959058","9781441959065"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_233","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}