Shared-key signature and its application to anonymous authentication in ad hoc group

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

Volumn 3225, Issue , 2004, Pages 330-341

  Wu, Qianhong ^a   Chen, Xiaofeng ^b   Wang, Changjie ^c   Wang, Yumin ^a  

^a XIDIAN UNIVERSITY   (China)

^b SUN YAT SEN UNIVERSITY   (China)

^c CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK SECURITY; QUANTUM COMPUTERS; SECURITY OF DATA;

ANONYMOUS AUTHENTICATION; AUTHENTICATION PROTOCOLS; GROUP MANAGERS; GROUP SIGNATURES; ITS APPLICATIONS; RING SIGNATURES; SPECIAL STRUCTURE; WEAK DEPENDENCES;

AUTHENTICATION;

EID: 33745859419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30144-8_28     Document Type: Article

References (16)

1. D. Chaum and E. van Heyst. Group signatures. In Proc. of Eurocrypt'91, LNCS 547, pp. 257-265, Springer-Verlag, 1992.
2. R. Cramer, I. Damgård and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Proc. of Crypto'95, LNCS 839, pp. 174-187, Springer- verlag, 1994.
3. R. L. Rivest, A. Shamir, and Y. Tauman. How to leak a secret. In Proc. of Asiacrypt'01, LNCS 2248, pp. 552-565, Springer-Verlag, 2001.
4. M. Abe, M. Ohkubo, and K. Suzuki. 1-out -of-n Signatures from a Variety of Keys. In Proc. In Proc. of Asiacrypt'02, LNCS 2501, pp. 415-432, Springer-verlag, 2002.
5. F. Zhang and K. Kim. ID-Based blind signature and ring signature from pairings. In Proc. of Asiacrypt'02, LNCS 2501, pp. 533-547, Springer-Verlag, 2002.
6. D. S. Wong, K. Fung, J. K. Liu and V. K. Wei. On the RS-code construction of ring signature schemes and a threshold setting of RST. In Proc. of ICICS'03, LNCS 2836, pp. 34-46, Springer-verlag, 2003.
7. I. S. Reed and G. Solomon. Polynomial Codes over finite field. SIAM J. Applied Math., 8: 300-304, June 1960.
8. M. Jakobsson, K. Sako, and R. Impagliazzo. Designated verifier proofs and their applications. In Proc. of Eurocrypt'96, LNCS 1070, pp. 143-154, Springer-Verlag, 1996.
9. A. Fiat and A. Shamir. How to prove yourself: practical solutions of identification and signature problems. In Proc. of Crypto'86, LNCS 263, pp. 186-194, Springer-Verlag, 1987.
10. M. Blum. How to prove a theorem so no one else can claim it. In Proc. of the International Congress of Mathematicians, Berkeley, CA, pp. 1444-1451, 1986.
11. O. Goldreich, S. Micali and A. Wigderson: How to prove all NP statements in zero- knowledge and a methodology of cryptographic protocol design. In Proc. of Crypto'86, pp. 171-185, Springer-verlag, 1987.
12. P.W. Shor. Polynomial-time algorithm for prime factorization and discrete logarithms on a quantum computer. SIAM Journal of Computing, 26: 1484-1509, 1997.
13. C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computing. SIAM J. Comput. 26, 5, pp. 1510-1523, 1997.
14. T. Okamoto, K. Tanaka, and S. Uchiyama. Quantum Public-Key Cryptosystems, In Proc. of Crypto'00, LNCS 1880, pp. 147-165, Springer-Verlag 2000.
15. C. Dwork. Lattices and their application to cryptography. Stanford University, Springer Quarter Press. 1998.
16. A. K Lenstra, Jr. H. W. Lenstra, and Lovasz. Factorization polynomials with rational coefficients, Mathematische Annalen, 261, pp. 515-534, 1982.