Efficient Linkable and/or Threshold Ring Signature Without Random Oracles

Computer Journal

Volumn 56, Issue 4, 2013, Pages 407-421

  Yuen, Tsz Hon ^a   Liu, Joseph K ^b   Au, Man Ho ^c   Susilo, Willy ^c   Zhou, Jianying ^b  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^c UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

linkable; random oracles; ring signature; threshold

Indexed keywords

LINKABLE; LINKABLE RING SIGNATURES; RANDOM ORACLE; RING SIGNATURES; THRESHOLD; THRESHOLD RING SIGNATURE SCHEMES; THRESHOLD RING SIGNATURES; WITHOUT RANDOM ORACLES;

COMPUTER SCIENCE;

AUTHENTICATION;

EID: 84875690586     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxs115     Document Type: Article

References (49)

1. Rivest, R.L., Shamir, A. and Tauman, Y. (2001) How to Leak a Secret. ASIACRYPT 2001, Lecture Notes in Computer Science 2248, pp. 552-565. Springer. (Pubitemid 33371206)
2. Abe, M., Ohkubo, M. and Suzuki, K. (2002) 1-out-of-n Signatures from a Variety of Keys. ASIACRYPT 2002, Lecture Notes in Computer Science 2501, pp. 415-432. Springer.
3. Zhang, F. and Kim, K. (2002) ID-Based Blind Signature and Ring Signature from Pairings. ASIACRYPT 2002, Lecture Notes in Computer Science 2501, pp. 533-547. Springer.
4. Boneh, D., Gentry, C., Lynn, B. and Shacham, H. (2003) Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. EUROCRYPT 2003, Lecture Notes in Computer Science 2656, pp. 416-432. Springer.
5. Wong, D.S., Fung, K., Liu, J.K. and Wei, V.K. (2003) On the rs-code construction of ring signature schemes and a threshold setting of rst. ICICS 2003, Lecture Notes in Computer Science 2836, pp. 34-46. Springer.
6. Dodis, Y., Kiayias, A., Nicolosi, A. and Shoup, V. (2004) Anonymous Identification in Ad Hoc Groups. EUROCRYPT 2004, Lecture Notes in Computer Science 3027, pp. 609-626. Springer.
7. Chow, S.S.M., Yiu, S.-M. and Hui, L.C.K. (2005) Efficient Identity Based Ring Signature. ACNS 2005, Lecture Notes in Computer Science 3531, pp. 499-512. Also available at Cryptology ePrint Archive, Report 2004/327. (Pubitemid 41422135)
8. Chaum, D. and vanHeyst, E. (1991) Group Signatures. In Davies, D.W. (ed.), EUROCRYPT 1991, Lecture Notes in Computer Science 547, pp. 257-265. Springer.
9. Camenisch, J. and Stadler, M. (1997) Efficient Group Signature Schemes for Large Groups (Extended Abstract). CRYPTO 97, Lecture Notes in Computer Science 1294, pp. 410-424. Springer. (Pubitemid 127112569)
10. Bellare, M., Micciancio, D. and Warinschi, B. (2003) Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. EUROCRYPT 2003, Lecture Notes in Computer Science 2656, pp. 614-629. Springer.
11. Bresson, E., Stern, J. and Szydlo, M. (2002) Threshold Ring Signatures and Applications to Ad-Hoc Groups. In Yung, M. (ed.), CRYPTO 2002, Lecture Notes in Computer Science 2442, pp. 465-480. Springer.
12. Susilo, W. and Mu, Y. (2004) Non-interactive Deniable Ring Authentication. ICISC 2003, Lecture Notes in Computer Science 2971, pp. 386-401. Springer.
13. Liu, J.K., Yuen, T.H. and Zhou, J. (2011) Forward Secure Ring Signature without Random Oracles. ICICS, Lecture Notes in Computer Science 7043, pp. 1-14. Springer.
14. Susilo, W., Mu, Y. and Zhang, F. (2004) Perfect Concurrent Signature Schemes. ICICS 2004, Lecture Notes in Computer Science 3269, Malaga, Spain, October 27-29, pp. 14-26. Springer. (Pubitemid 39737126)
15. Laguillaumie, F. and Vergnaud, D. (2004) Multi-designated Verifiers Signatures. ICICS 2004, Malaga, Spain, October, Lecture Notes in Computer Science 3269, pp. 495-507. Springer.
16. Liu, J.K.,Wei,V.K. andWong, D.S. (2004) Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups (Extended Abstract). ACISP, Lecture Notes in Computer Science 3108. Springer.
17. Chow, S.S.M., Liu, J.K. andWong, D.S. (2008) Robust Receipt- Free Election System with Ballot Secrecy and Verifiability. NDSS. The Internet Society.
18. Tsang, P.P. andWei,V.K. (2005) Short Linkable Ring Signatures for E-Voting, E-Cash andAttestation. ISPEC 2005, Lecture Notes in Computer Science 3439, pp. 48-60. Springer. (Pubitemid 41273777)
19. Liu, J.K. and Wong, D.S. (2005) Linkable Ring Signatures: Security Models and New Schemes. ICCSA (2), Lecture Notes in Computer Science 3481, pp. 614-623. Springer. (Pubitemid 41313741)
20. Liu, J.K. and Wong, D.S. (2006) Enhanced security models and a generic construction approach for linkable ring signature. Int. J. Found. Comput. Sci., 17, 1403-1422. (Pubitemid 44924927)
21. Tsang, P.P.,Wei,V.K., Chan, T.K., Au, M.H., Liu, J.K. andWong, D.S. (2004) Separable Linkable Threshold Ring Signatures. INDOCRYPT 2004, Lecture Notes in Computer Science, pp. 384- 398. Springer. (Pubitemid 39748322)
22. Au, M.H., Liu, J.K., Susilo,W. andYuen, T.H. (2006) Constantsize ID-based linkable and revocable-iff-linked ring signature. INDOCRYPT 2006, Lecture Notes in Computer Science 4329, pp. 364-378. Springer.
23. Au, M.H., Chow, S.S.M., Susilo,W. and Tsang, P.P. (2006) Short Linkable Ring Signatures Revisited. EuroPKI, Lecture Notes in Computer Science 4043, pp. 101-115. Springer. (Pubitemid 44097506)
24. Au, M.H., Liu, J.K., Susilo,W. andYuen, T.H. (2007) Certificate Based (Linkable) Ring Signature. ISPEC 2007, Lecture Notes in Computer Science 4464, pp. 79-92. Springer. (Pubitemid 350259418)
25. Zheng, D., Li, X., Chen, K. and Li, J. (2007) Linkable Ring Signatures from Linear Feedback Shift Register.EUCWorkshops, Lecture Notes in Computer Science 4809, Taipei, Taiwan, December 17-20, pp. 716-727. Springer.
26. Tsang, P.P.,Au, M.H., Liu, J.K., Susilo,W. andWong, D.S. (2010) A Suite of Non-pairing Id-Based Threshold Ring Signature Schemes with Different Levels of Anonymity. ProvSec 2010, Lecture Notes in Computer Science 6402, pp. 166-183. Springer.
27. Fujisaki, E. (2011) Sub-linear Size Traceable Ring Signatures without Random Oracles. CT-RSA 2011, Lecture Notes in Computer Science 6558, pp. 393-415. Springer.
28. Wang, H. and Zhao, S. (2010) Cryptanalysis of Several Linkable Ring Signature Schemes. NSWCTC 2010, pp. 302-305. IEEE Computer Society.
29. Boneh, D. and Boyen, X. (2004) Short Signatures Without Random Oracles. EUROCRYPT 2004, Lecture Notes in Computer Science 3027, pp. 56-73. Springer.
30. Boneh, D., Goh, E.-J. and Nissim, K. (2005) Evaluating 2- DNF Formulas on Ciphertexts. TCC, Lecture Notes in Computer Science 3378, pp. 325-341. Springer.
31. Tsang, P.P. (2005). Cryptography in privacy-preserving applications. Master Thesis, The Chinese University of Hong Kong.
32. Chandran, N., Groth, J. and Sahai, A. (2007) Ring Signatures of Sub-linear Size without Random Oracles. ICALP 2007, Lecture Notes in Computer Science 4596, pp. 423-434. Springer.
33. Groth, J., Ostrovsky, R. and Sahai, A. (2006) Non-interactive Zaps and New Techniques for NIZK. CRYPTO, Lecture Notes in Computer Science 4117, pp. 97-111. Springer. (Pubitemid 44532111)
34. Groth, J., Ostrovsky, R. and Sahai, A. (2006) Perfect Noninteractive Zero Knowledge for NP.EUROCRYPT, Lecture Notes in Computer Science 4004, pp. 339-358. Springer. (Pubitemid 44072249)
35. Lamport, L. (1979). Constructing Digital Signatures from a One- Way Function. Technical Report SRI-CSL-98, SRI International Computer Science Laboratory.
36. Merkle, R.C. (1987)ADigital Signature Based on a Conventional Encryption Function. CRYPTO, Lecture Notes in Computer Science 293, pp. 369-378. Springer.
37. Merkle, R.C. (1989) A Certified Digital Signature. CRYPTO, Lecture Notes in Computer Science 435, pp. 218-238. Springer.
38. Bleichenbacher,D. and Maurer, U.M. (1996) OptimalTree-Based One-Time Digital Signature Schemes. STACS, Lecture Notes in Computer Science 1046, pp. 363-374. Springer. (Pubitemid 126040190)
39. Bleichenbacher, D. and Maurer, U.M. (1996) On the Efficiency of One-Time Digital Signatures. ASIACRYPT, Lecture Notes in Computer Science 1163, pp. 145-158. Springer. (Pubitemid 126146221)
40. Perrig, A. (2001) The Biba One-Time Signature and Broadcast Authentication Protocol. ACMConf. Computer and Communications Security, Philadelphia, Pennsylvania, USA, November 6-8, pp. 28-37. ACM. (Pubitemid 34974703)
41. Reyzin, L. and Reyzin, N. (2002) Better than BiBa: Short One- Time Signatures with Fast Signing andVerifying. ACISP, Lecture Notes in Computer Science 2384, pp. 144-153. Springer.
42. Bender, A., Katz, J. and Morselli, R. (2006) Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles. TCC, Lecture Notes in Computer Science 3876, pp. 60- 79. Springer. (Pubitemid 43979844)
43. Yuen, T.H., Liu, J.K., Au, M.H., Susilo, W. and Zhou, J. (2011) Threshold Ring Signatures Without Random Oracles. ASIACCS 2011, pp. 261-267. ACM Press.
44. Chow, S.S., Hui, L.C. andYiu, S. (2004) Identity Based Threshold Ring Signature. ICISC 2004, Lecture Notes in Computer Science 3506, pp. 218-232. Springer, Seoul, Korea. Also available at Cryptology ePrint Archive, Report 2004/179.
45. Liu, J.K.,Wei,V.K. andWong, D.S. (2003)ASeparable Threshold Ring Signature Scheme. ICISC 2003, Lecture Notes in Computer Science 2971, pp. 352-369. Springer.
46. Han, J., Xu, Q. and Chen, G. (2008) Efficient Id-Based Threshold Ring Signature Scheme. EUC (2), pp. 437-442. IEEE Computer Society.
47. Melchor, C.A., Cayrel, P.-L. and Gaborit, P. (2008) A New Efficient Threshold Ring Signature Scheme Based on Coding Theory. PQCrypto, Lecture Notes in Computer Science 5299, pp. 1-16. Springer.
48. Dallot, L. andVergnaud, D. (2009) Provably Secure Code-Based Threshold Ring Signatures. IMA Int. Conf., Lecture Notes in Computer Science 5921, Cirencester, UK, December 15-17, pp. 222-235. Springer.
49. Cayrel, P.-L., Lindner, R., Rückert, M. and Silva, R. (2010) A Lattice-Based Threshold Ring Signature Scheme. LATINCRYPT, Lecture Notes in Computer Science 6212, pp. 255-272. Springer.