Linkable ring signatures: Security models and new schemes

Lecture Notes in Computer Science

Volumn 3481, Issue II, 2005, Pages 614-623

  Liu, Joseph K ^a   Wong, Duncan S ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; MATHEMATICAL MODELS; POLYNOMIALS; SECURITY OF DATA;

ATTACKING SCENARIOS; RANDOM ORACLE MODEL; RING SIGNATURES; SIGN MESSAGES;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 24944589673     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11424826_65     Document Type: Conference Paper

References (13)

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, D. Micciancio, and B. Warinschi. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. In Proc. EUROCRYPT 2003, pages 614-629. Springer-Verlag, 2003. Lecture Notes in Computer Science No. 2656.
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. 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.
5. 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.
6. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In Proc. CRYPTO 97, pages 410-424. Springer-Verlag, 1997. Lecture Notes in Computer Science No. 1294.
7. D. Chaum and E. Van Heyst. Group signatures. In Proc. EUROCRYPT 91, pages 257-265. Springer-Verlag, 1991. Lecture Notes in Computer Science No. 547.
8. Y. Dodis, A. Kiayias, A. Nicolosi, and V. Shoup. Anonymous identification in ad-hoc groups. In Proc. EUROCRYPT 2004. Springer-Verlag, 2004.
9. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Proc. CRYPTO 86, pages 186-199. Springer-Verlag, 1987. Lecture Notes in Computer Science No. 263.
10. J. K. Liu, V. K. Wei, and D. S. Wong. Linkable and anonymous signature for ad hoc groups. In The 9th Australasian Conference on Information Security and Privacy (ACISP 2004), pages 325-335. Springer-Verlag, 2004. Lecture Notes in Computer Science No. 3108.
11. K. Ohta and T. Okamoto. On concrete security treatment of signatures derived from identification. In Proc. CRYPTO 98, pages 354-369. Springer-Verlag, 1998. Lecture Notes in Computer Science No. 1462.
12. D. Pointcheval and J. Stern. Security proofs for signature schemes. In Proc. EUROCRYPT 96, pages 387-398. Springer-Verlag, 1996. Lecture Notes in Computer Science No. 1070.
13. R. Rivest, A. Shamir, and Y. Tauman. How to leak a secret. In Proc. ASIACRYPT 2001, pages 552-565. Springer-Verlag, 2001. Lecture Notes in Computer Science No. 2248.