Blind spontaneous anonymous group signatures for ad hoc groups

Lecture Notes in Computer Science

Volumn 3313, Issue , 2005, Pages 82-94

  Chan, Tony K ^a   Fung, Karyin ^a   Liu, Joseph K ^a   Wei, Victor K ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; PATTERN RECOGNITION; PROBLEM SOLVING;

AD HOC GROUPS; PUBLIC KEYS; SPONTANEOUS ANONYMOUS GROUP (SAG); THRESHOLDING;

PUBLIC KEY CRYPTOGRAPHY;

EID: 23944497675     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30496-8_8     Document Type: Conference Paper

References (21)

1. M. Abe, M. Ohkubo, and K. Suzuki. 1-out-of-n signatures from a variety of keys. In Proc. ASIACRYPT 2002, pages 415-432. Springer-Verlag, 2002. Lecture Notes in Computer Science No. 2501.
2. M. Bellare and D. Micciancio. a new paradigm for collision-free hasing: incrementality at reduced cost. In Proc. EUROCRYPT 97. Springer-Verlag, 1997. Lecture Notes in Computer Science No. 1233.
3. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proc. 1st ACM Conference on Computer and Communications Security, pages 62-73. ACM Press, 1993.
4. G. R. Blakley. Safeguarding cryptographic keys. In Proc. AFIPS National Computer Conference, volume 48, pages 313-317, 1979.
5. D. Boneh, C. Gentry, B. Lynn, and H. Shacham. Aggregate and verifiably encrypted signatures from bilinear maps. In Proc. EUROCRYPT 2003, pages 416-432. Springer-Verlag, 2003. Lecture Notes in Computer Science No. 2656.
6. E. Bresson, J. Stern, and M. Szydlo. Threshold ring signatures and applications to ad-hoc groups. In Proc. CRYPTO 2002, pages 465-480. Springer-Verlag, 2002. Lecture Notes in Computer Science No. 2442.
7. J. Camenisch and A. Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In Proc. EUROCRYPT 2001, pages 93-118. Springer-Verlag, 2001. Lecture Notes in Computer Science No. 1294.
8. D. Chaum. Blind signatures for untraceable payments. In Proc. CRYPTO 82, pages 199-203. Plenum Press, 1982.
9. D. Chaum. Security without identification: Transaction systems to make big brother obsolete. CACM, 29(10):1030-1044, 1985.
10. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Proc. CRYPTO 94, pages 174-187. Springer-Ver lag, 1994. Lecture Notes in Computer Science No. 839.
11. Y. Desmedt. Some recent research aspects of threshold cryptography. In Proc. First International Workshop on Information Security, ISW 97, pages 158-173. Springer-Ver lag, 1997. Lecture Notes in Computer Science No 1196.
12. J. K. Liu, V. K. Wei, and D. S. Wong. Cryptanalyzing Bresson, et al.'s spontaneous anonymous group threshold signature for ad hoc groups and patching via updating Cramer, et al.'s threshold proof-of-knowledge. eprint, 2004(042), 2004.
13. J. K. Liu, V. K. Wei, and D. S. Wong. Linkable and culpable ring signatures. eprint, 2004(027), 2004.
14. V.I. Nechaev. Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes 55, pages 165-172, 1994.
15. T. Okamoto. Provably secure and practical identification schemes and corresponding signature schemes. In Proc. CRYPTO 92, pages 31-53. Springer-Verlag, 1993. Lecture Notes in Computer Science No. 740.
16. R. Rivest, A. Shamir, and Y. Tauman. How to leak a secret. In Proc. ASIACRYPT 2001, pages 552-565. Springer-Ver lag, 2001. Lecture Notes in Computer Science No. 2248.
17. C. P. Schnorr. Security of blind discrete log signatures against interactive attacks. In ICICS. Springer, 2001. Lecture Notes in Computer Science No. 2229.
18. C.P. Schnorr. Efficient identication and signatures for smart cards. In Proc. CRYPTO 89, pages 239-252. Springer-Verlag, 1990. Lecture Notes in Computer Science No. 435.
19. A. Shamir. How to share a secret. In Communications of the ACM, volume 22(2), pages 612-613. ACM Press, 1979.
20. V. Shoup. Lower bounds for discrete logarithms and related problems. In Proc. EUROCRYPT 97, pages 256-266. Springer-Verlag, 1997. Lecture Notes in Computer Science No. 1233.
21. D. Wagner. A generalized birthday problem. In Proc. CRYPTO 8002, pages 288-303. Springer-Verlag, 2002. Lecture Notes in Computer Science No. 2442.