An efficient threshold anonymous authentication scheme for privacy-preserving communications

IEEE Transactions on Wireless Communications

Volumn 12, Issue 3, 2013, Pages 1018-1025

  Ren, Jian ^a   Harn, Lein ^b  

^a Michigan State University   (United States)

^b UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

Anonymity authentication; random oracle secure; system of linear equations; threshold ring signature; unconditional secure; unforgeability

Indexed keywords

ANONYMITY AUTHENTICATIONS; RANDOM ORACLE; SYSTEM OF LINEAR EQUATIONS; THRESHOLD RING SIGNATURES; UNCONDITIONAL SECURE; UNFORGEABILITY;

AUTHENTICATION; LINEAR EQUATIONS;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 84875591362     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2012.12.112120     Document Type: Article

References (19)

1. Online Victimization, "A report on the nation's youth," by the Crimes Against Children Research Center (founded by the U.S. Congress). Available http//www.missingkids.com/en US/publications/NC62.pdf.
2. G. Yang, Q. Huang, D. S. Wong, and X. Deng, "Universal authentication protocols for anonymous wireless communications," IEEE Trans. Wireless Commun., vol. 9, no. 1, pp. 168-184, Jan. 2010.
3. L. Harn and J. Ren, "Generalized digital certificate for user authentication and key establishment for secure communications," IEEE Trans. Wireless Commun., vol. 10, no. 7, July 2011.
4. R. Rivest, A. Shamir, and Y. Tauman, "How to leak a secret," in Advances in Cryptology-ASIACRYPT, Lecture Notes in Computer Science, vol. 2248/2001. Springer, 2001.
5. D. Chaum and E. van Heyst, "Group signatures," in Advances in Cryptology-EUROCRYPT, Lecture Notes in Computer Science, vol. 547, pp. 257-265, 1991.
6. J. L. Camenisch, "Efficient and generalized group signatures," in Advances in Cryptology-EUROCRYPT, Lecture Notes in Computer Science, vol. 1233, pp. 465-479, 1997.
7. J. L. Camenisch and M. A. Stadler, "Efficient group signature schemes for large groups," in Advances in Cryptology-Crypto'97, Lecture Notes in Computer Science, vol. 1294, pp. 410-424, 1997.
8. M. Mambo, K. Usuda, and E. Okamoto, "Proxy signatures," in Proc. 1995 Symposium on Cryptography and Information Security, pp. 11-17.
9. J. Herranz and G. Saez, "Forking lemmas in the ring signatures' scenario," Technical Report 067, International Association for Cryptologic Research. Available http//eprint.iacr.org/2003/067.ps, 2003.
10. C. P. Schnorr, "Efficient identification and signatures for smart cards," in Advances in Cryptology-Crypto'89, Lecture Notes in Computer Science, vol. 435, pp. 239-252, 1989.
11. M. Abe, M. Ohkubo, and K. Suzuki, "1-out-of-n signatures from a variety of keys," in ASIACRYPT, Lecture Notes in Computer Science, vol. 2501, pp. 415-432, 2002.
12. E. Bresson, J. Stern, and M. Szydlo, "Threshold ring signatures and applications to ad-hoc groups," in Proc. 2002 Advances in Cryptology, Lecture Notes in Computer Science, vol. 2442, pp. 465-480, 2002.
13. L. Harn, "Group-oriented (t, n) threshold signature and multisignature," IEE Proc.-Computers and Digital Techniques, vol. 141, no. 5, pp. 307-313, Sep. 1994.
14. L. Li, "On the arithmetic operational complexity for solving Vandermonde linear equations," Japan J. Industrial and Applied Mathematics, vol. 17, no. 1, pp. 15-18, Feb. 2000.
15. A. Shamir, "How to share a secret," Commun. of the ACM, vol. 22, no. 11, pp. 612-613, 1979.
16. H. Wang, S. Sheng, C. Tan, and Q. Li, "Comparing symmetric-key and public-key based security schemes in sensor networks a case study of user access control," in Proc. 2008 IEEE ICDCS, pp. 11-18.
17. M. J. Wiener, "Performance comparison of public-key cryptosystems," vol. 4, no. 1, pp. 1-5, 1998.
18. H. Handschuh and P. Paillier, "Smart card crypto-coprocessors for public-key cryptography," vol. 4, no. 1, pp. 6-10, 1998.
19. P. Karu and J. Loikkanen, "Practical comparison of fast public-key cryptosystems. Available http//citeseerx.ist.psu.edu/viewdoc/summary? doi=10.1.1.96.5694.