1-out-of-n signatures from a variety of keys

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2501, Issue , 2002, Pages 415-432

  Abe, Masayuki ^a   Ohkubo, Miyako ^b   Suzuki, Koutarou ^a  

^a NTT CORPORATION   (Japan)

^b CHUO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; NETWORK SECURITY; SECURITY OF DATA;

PUBLIC KEYS; RING SIGNATURES; SIGNATURE SCHEME; STORAGE COSTS;

AUTHENTICATION;

EID: 84958744427     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36178-2_26     Document Type: Conference Paper

References (23)

1. M. Abe and F. Hoshino. Remarks on mix-network based on permutation network. PKC 2001, LNCS 1992, pp. 317–324. Springer-Verlag, 2001.
2. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the weil pairing. Asiacrypt 2001, LNCS 2248, pp. 514–532. Springer-Verlag, 2001.
3. M. Bellare, and P. Rogaway. Random Oracles are practical: a paradigm for designing efficient protocols. 1st ACM CCCS, pp. 62–73. ACM, 1993.
4. E. Bresson, J. Stern, and M. Szydlo. Threshold ring signatures and applications to ad-hoc groups. CRYPTO 2002, LNCS 2442, pp. 465–480. Springer-Verlag, 2002.
5. J. Camenisch. Efficient and generalized groupsignatures. EUROCRYPT’97, LNCS 1233, pp. 465–479. Springer-Verlag, 1997.
6. J. Camenisch and M. Michels. Proving in zero-knowledge that a number is the product of two safe primes. EUROCRYPT’99, LNCS 1592, pp. 107–122. Springer-Verlag, 1999.
7. C. Chan, Y. Frankel, and Y. Tsiounis. Easy come - easy go divisible cash. EUROCRYPT’98, LNCS 1403, pp. 561–575. Springer-Verlag, 1998.
8. D. Chaum and E. Van Heyst. Groupsignatures. EUROCRYPT’91, LNCS 547, pp. 257–265. Springer-Verlag, 1991.
9. R. Cramer, I. Damgard, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. CRYPTO’94, LNCS 839, pp. 174–187. Springer-Verlag, 1994.
10. R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung. Multi-authority secretballot elections with linear work. EUROCRYPT’96, LNCS 1070, pp. 72–83. Springer-Verlag, 1996.
11. R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. EUROCRYPT’97, LNCS 1233, pp. 103–118. Springer-Verlag, 1997.
12. U. Feige, A. Fiat, and A. Shamir. Zero-knowledge proofs of identity. J.Cryptolo gy, 1:77–94, 1988.
13. U. Feige and A. Shamir. Witness indistinguishable and witness hiding protocols. STOC’90, pp. 416–426, 1990.
14. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. CRYPTO’86, LNCS 263, pp. 186–199. Springer-Verlag, 1987.
15. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J.Computing, 17(2):281–308, April 1988.
16. L. C. Guillou and J.-J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. EUROCRYPT’88, LNCS 330 of Lecture Notes in Computer Science, pp. 123–128. Springer-Verlag, 1988.
17. M. Jakobsson, K. Sako, and R. Impagliazzo. Designated verifier proofs and their applications. EUROCRYPT’96, LNCS 1070, pp. 143–154. Springer-Verlag, 1996.
18. M.Naor. Deniable ring authentication. CRYPTO 2002, LNCS 2442, pp. 481–498. Springer-Verlag, 2002.
19. K. Ohta and T. Okamoto. On concrete security treatment of signatures derived from identification. CRYPTO’98, LNCS 1462, pp. 354–369. Springer-Verlag, 1998.
20. D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. J.Cryptolo gy, 2000.
21. R. Rivest, A. Shamir, and Y. Tauman. How to leak a secret. Asiacrypt 2001, LNCS 2248, pp. 552–565. Springer-Verlag, 2001.
22. A. De Santis, G. Di Crescenzo, G. Persiano, and M. Yung. On monotone formula closure of SZK. FOCS’94, pp. 454–465, 1994.
23. C. P. Schnorr. Efficient signature generation for smart cards. J.Cryptolo gy, 4(3):239–252, 1991