{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:05:35Z","timestamp":1773795935810,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540001713","type":"print"},{"value":"9783540361787","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36178-2_26","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T17:30:14Z","timestamp":1178213414000},"page":"415-432","source":"Crossref","is-referenced-by-count":216,"title":["1-out-of-n Signatures from a Variety of Keys"],"prefix":"10.1007","author":[{"given":"Masayuki","family":"Abe","sequence":"first","affiliation":[]},{"given":"Miyako","family":"Ohkubo","sequence":"additional","affiliation":[]},{"given":"Koutarou","family":"Suzuki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"26_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/3-540-44586-2_23","volume-title":"PKC 2001","author":"M. Abe","year":"2001","unstructured":"M. Abe and F. Hoshino. Remarks on mix-network based on permutation network. PKC 2001, LNCS 1992, pp. 317\u2013324. Springer-Verlag, 2001."},{"key":"26_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Asiacrypt 2001","author":"D. Boneh","year":"2001","unstructured":"D. Boneh, B. Lynn, and H. Shacham. Short signatures from the weil pairing. Asiacrypt 2001, LNCS 2248, pp. 514\u2013532. Springer-Verlag, 2001."},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, and P. Rogaway. Random Oracles are practical: a paradigm for designing efficient protocols. 1st ACM CCCS, pp. 62\u201373. ACM, 1993.","DOI":"10.1145\/168588.168596"},{"key":"26_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/3-540-45708-9_30","volume-title":"CRYPTO 2002","author":"E. Bresson","year":"2002","unstructured":"E. Bresson, J. Stern, and M. Szydlo. Threshold ring signatures and applications to ad-hoc groups. CRYPTO 2002, LNCS 2442, pp. 465\u2013480. Springer-Verlag, 2002."},{"key":"26_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/3-540-69053-0_32","volume-title":"EUROCRYPT\u2019 97","author":"J. Camenisch","year":"1997","unstructured":"J. Camenisch. Efficient and generalized group signatures. EUROCRYPT\u2019 97, LNCS 1233, pp. 465\u2013479. Springer-Verlag, 1997."},{"key":"26_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-48910-X_8","volume-title":"EUROCRYPT\u2019 99","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. EUROCRYPT\u2019 99, LNCS 1592, pp. 107\u2013122. Springer-Verlag, 1999."},{"key":"26_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BFb0054154","volume-title":"EURO-CRYPT\u2019 98","author":"C. Chan","year":"1998","unstructured":"C. Chan, Y. Frankel, and Y. Tsiounis. Easy come-easy go divisible cash. EURO-CRYPT\u2019 98, LNCS 1403, pp. 561\u2013575. Springer-Verlag, 1998."},{"key":"26_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"EUROCRYPTr\u201991","author":"D. Chaum","year":"1991","unstructured":"D. Chaum and E. Van Heyst. Group signatures. EUROCRYPTr\u201991, LNCS 547, pp. 257\u2013265. Springer-Verlag, 1991."},{"key":"26_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"CRYPTO\u2019 94","author":"R. Cramer","year":"1994","unstructured":"R. Cramer, I. Damg\u2134ard, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. CRYPTO\u2019 94, LNCS 839, pp. 174\u2013187. Springer-Verlag, 1994."},{"key":"26_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-68339-9_7","volume-title":"EUROCRYPT\u2019 96","author":"R. Cramer","year":"1996","unstructured":"R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung. Multi-authority secret-ballot elections with linear work. EUROCRYPT\u2019 96, LNCS 1070, pp. 72\u201383. Springer-Verlag, 1996."},{"key":"26_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"EUROCRYPT\u2019 97","author":"R. Cramer","year":"1997","unstructured":"R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. EUROCRYPT\u2019 97, LNCS 1233, pp. 103\u2013118. Springer-Verlag, 1997."},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat, and A. Shamir. Zero-knowledge proofs of identity. J. Cryptology, 1:77\u201394, 1988.","journal-title":"J. Cryptology"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"U. Feige and A. Shamir. Witness indistinguishable and witness hiding protocols. STOC\u201990, pp. 416\u2013426, 1990.","DOI":"10.1145\/100216.100272"},{"key":"26_CR14","series-title":"Lect Notes Comput Sci","first-page":"186","volume-title":"CRYPTO\u2019 86","author":"A. Fiat","year":"1987","unstructured":"A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. CRYPTO\u2019 86, LNCS 263, pp. 186\u2013199. Springer-Verlag, 1987."},{"issue":"2","key":"26_CR15","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17(2):281\u2013308, April 1988.","journal-title":"SIAM J. Computing"},{"key":"26_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-45961-8_11","volume-title":"EUROCRYPT\u2019 88","author":"L. C. Guillou","year":"1988","unstructured":"L. C. Guillou and J.-J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. EUROCRYPT\u2019 88, LNCS 330 of Lecture Notes in Computer Science, pp. 123\u2013128. Springer-Verlag, 1988."},{"key":"26_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-68339-9_13","volume-title":"EUROCRYPT\u2019 96","author":"M. Jakobsson","year":"1996","unstructured":"M. Jakobsson, K. Sako, and R. Impagliazzo. Designated verifier proofs and their applications. EUROCRYPT\u2019 96, LNCS 1070, pp. 143\u2013154. Springer-Verlag, 1996."},{"key":"26_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/3-540-45708-9_31","volume-title":"CRYPTO 2002","author":"M. Naor","year":"2002","unstructured":"M.Naor. Deniable ring authentication. CRYPTO 2002, LNCS 2442, pp. 481\u2013498. Springer-Verlag, 2002."},{"key":"26_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BFb0055741","volume-title":"CRYPTO\u2019 98","author":"K. Ohta","year":"1998","unstructured":"K. Ohta and T. Okamoto. On concrete security treatment of signatures derived from identification. CRYPTO\u2019 98, LNCS 1462, pp. 354\u2013369. Springer-Verlag, 1998."},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. J. Cryptology, 2000.","DOI":"10.1007\/s001450010003"},{"key":"26_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/3-540-45682-1_32","volume-title":"Asiacrypt 2001","author":"R. Rivest","year":"2001","unstructured":"R. Rivest, A. Shamir, and Y. Tauman. How to leak a secret. Asiacrypt 2001, LNCS 2248, pp. 552\u2013565. Springer-Verlag, 2001."},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"A. De Santis, G. Di Crescenzo, G. Persiano, and M. Yung. On monotone formula closure of SZK. FOCS\u201994, pp. 454\u2013465, 1994.","DOI":"10.1109\/SFCS.1994.365745"},{"issue":"3","key":"26_CR23","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00196725","volume":"4","author":"C. P. Schnorr","year":"1991","unstructured":"C. P. Schnorr. Efficient signature generation for smart cards. J. Cryptology, 4(3):239\u2013252, 1991.","journal-title":"J. Cryptology"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36178-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T12:18:56Z","timestamp":1550319536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36178-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001713","9783540361787"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-36178-2_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}