Unconditionally secure anonymous encryption and group authentication

Computer Journal

Volumn 49, Issue 3, 2006, Pages 310-321

  Hanaoka, Goichiro ^a   Shikata, Junji ^b   Hanaoka, Yumiko ^c   Imai, Hideki ^d  

^a NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

^b YOKOHAMA NATIONAL UNIVERSITY   (Japan)

^c NTT DOCOMO   (Japan)

^d INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTER RECOGNITION; CODES (SYMBOLS); DATA PRIVACY; MATHEMATICAL MODELS; POLYNOMIALS; PUBLIC POLICY; SECURITY OF DATA;

ANONYMOUS ENCRYPTION; GROUP AUTHENTICATION; SHANNON'S MODEL;

CRYPTOGRAPHY;

EID: 33646240366     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxh149     Document Type: Article

References (28)

1. Chaum, D. (1981) Untraceable electronic mail, return address, and digital pseudonyms. Commun. ACM, 24, 84-88.
2. Chaum, D. (1987) The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptol., 1(1), 65-75.
3. Abe, M. (1998) Universally verifiable mix-net with verification work independent of the number of mix-servers. In Proc. EUROCRYPT'98, Espoo, May 31-June 4, pp. 437-447. Springer-Verlag, Berlin.
4. Diffie, W. and Hellman, M. E. (1976) New directions in cryptography. IEEE Trans. Inform. Theor., IT-22, 644-654.
5. Rivest, R., Shamir, A. and Adieman, L. (1978) A method for obtaining digital signature and public-key cryptosystems. Commun. ACM, 21(2), 120-126.
6. ElGamal, T. (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theor., IT-31 (4), 469-472.
7. Chaum, D. and van Heyst, E. (1991) Group signatures. In Proc. EUROCRYPT'91, Brighton, April 8-11, pp. 257-265. Springer-Verlag, Berlin.
8. Camenisch, J. and Stadler, M. (1997) Efficient group signature schemes for large groups. In Proc. CRYPTO'97, Santa Barbara, CA, August 17-21, pp. 410-424. Springer-Verlag, Berlin.
9. Erdös, P., Frankl, P. and Furedi, Z. (1982) Families of finite sets in which no sets is covered by the union of two others. J. Combin. Theor.Ser.A,33,158-166.
10. Blom, R. (1983) Non-public key distribution. In Proc. CRYPTO'82, Santa Barbara, CA, August, pp. 231-236. Plenum, New York.
11. Matsumoto, T. and Imai, H. (1988) On the Key Predistribution System: A practical solution to the key distribution problem. In Proc. CRYPTO'87, Santa Barbara, CA, August 16-20, pp. 185-193. Springer-Verlag, Berlin.
12. Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U. and Yung, M. (1993) Perfectly secure key distribution for dynamic conferences. In Proc. CRYPTO'92, Santa Barbara, CA, August 16-20, pp. 471-486. Springer-Verlag, Berlin.
13. Blundo, C., FrotaMattos, L. A. and Stinson, D. R. (1996) Trade-offs between communication and storage in unconditionally secure schemes for broadcast encryption and interactive key distribution. In Proc. CRYPTO'96, Santa Barbara, CA, August 18-22, pp. 387-400. Springer-Verlag, Berlin.
14. Kurosawa, K., Yoshida, T., Desmedt, Y. and Burmester, M. (1998) Some bounds and a construction for secure broadcast encryption. In Proc. ASIACRYPT'98, Beijing, October 18-22, pp. 420-33. Springer-Verlag, Berlin.
15. Stinson, D. R. (1997) On some methods for unconditionally secure key distribution and broadcast encryption. Design. Code. Cryptogr., 12, pp. 215-243.
16. Gilbert, E. N., MaeWilliams P. J. and Sloane, N. J. A. (1974) Codes which detect deception. Bell Syst. Tech. J., 53, 405-25.
17. Simmons, G. J. (1985) Authentication theory/coding theory. In Proc. CRYPTO'84, Santa Barbara, CA, August 19-22, pp. 411-431. Springer-Verlag, Berlin.
18. Simmons, G. J. (1988) Message authentication with arbitration of transmitter/receiver disputes. In Proc. EUROCRYPT'87, Amsterdam, April 13-15, pp. 151-165. Springer-Verlag, Berlin.
19. Desmedt, Y., Frankel, Y. and Yung, M. (1992) Multi-receiver/Multi-sender network security: Efficient authenticated multicast/feedback. In Proc. IEEE lnfocom'92, Florence, May 4-8, pp. 2045-2054. IEEE, Piscataway, NJ.
20. Hanaoka, G., Shikata, J., Zheng, Y. and Imai, H. (2000) Unconditionally secure digital signature schemes admitting transferability. In Proc. ASIACRYPT'00, Kyoto, December 3-7, pp. 130-142. Springer-Verlag, Berlin.
21. Hanaoka, G., Shikata, J., Zheng, Y. and Imai, H. (2002) Efficient and unconditionally secure digital signatures and a security analysis of a multireceiver authentication code. In Proc. PKC'02, Paris, February 12-14, pp. 64-79. Springer-Verlag, Berlin.
22. Shikata, J., Hanaoka, G., Zheng, Y. and Imai, H. (2002) Security notions for unconditionally secure signature schemes. In Proc. EUROCRYPT'02, Amsterdam, April 28-May 2, pp. 434-449. Springer-Verlag, Berlin.
23. Ben-Or, M., Goldwasser, S. and Wigderson, A. (1988) Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. STOC'88, Chicago, IL, May 2-4, pp. 1-10. ACM, New York, NY.
24. Shannon, C. E. (1949) Communication theory of secrecy systems. Bell Syst. Tech. J., 28, 656-715.
25. Erdös, P., Frankl, P. and Furedi, Z. (1985) Families of finite sets in which no sets is covered by the union of others. Israel J. Math., 51,79-89.
26. Dolev, D., Dwork, C. and Naor, M. (1991) Non-malleable cryptography. In Proc. STOC'91, New Orleans, LA, May 6-8, pp. 542-552. ACM, New York, NY.
27. Bellare, M., Desai, A., Jokipii, E. and Rogaway, P. (1997) A concrete security treatment of symmetric encryption. In Proc. FOCS'97, Miami Beach, FL, October 19-22, pp. 394-403. IEEE, Piscataway, NJ.
28. Bellare, M., Desai, A., Pointcheval, D. and Rogaway, P. (1998) Relations among notions of security for public-key encryption schemes. In Proc. CRYPTO'98, Santa Barbara, CA, August 23-27, pp. 26-45. Springer-Verlag, Berlin.