K-resilient identity-based encryption in the standard model

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E89-A, Issue 1, 2006, Pages 39-46

  Heng, Swee Huay ^a   Kurosawa, Kaoru ^b,c,d,e,f  

^a MULTIMEDIA UNIVERSITY   (Malaysia)

^b IBARAKI UNIVERSITY   (Japan)

^c IEEE   (Japan)

^d ACM   (Japan)

^e ROTHAMSTED RESEARCH   (United Kingdom)

^f Sita Messtechnik GmbH   (Germany)

Author keywords

Identity based encryption; Standard model

Indexed keywords

ADAPTIVE SYSTEMS; DECISION MAKING; IDENTIFICATION (CONTROL SYSTEMS); MATHEMATICAL MODELS;

IDENTITY-BASED ENCRYPTION; STANDARD MODEL;

CRYPTOGRAPHY;

EID: 32244433690     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e89-a.1.39     Document Type: Article

References (26)

1. D. Boneh and X. Boyen, "Efficient selective-ID secure identity-based encryption without random oracles," Advances in Cryptology - EUROCRYPT '04, LNCS 3027, pp.223-238, Springer-Verlag, 2004.
2. D. Boneh and X. Boyen, "Secure identity based encryption without random oracles," Advances in Cryptology - CRYPTO '04, LNCS 3152, pp.443-459, Springer-Verlag, 2004.
3. D. Boneh and M. Franklin, "An efficient public key traitor tracing scheme," Advances in Cryptology - CRYPTO '99, LNCS 1666, pp.338-353, Springer-Verlag, 1999.
4. D. Boneh and M. Franklin, "Identity-based encryption from the Weil pairing," Advances in Cryptology - CRYPTO '01, LNCS 2139, pp.213-229, Springer-Verlag, 2001.
5. D. Boneh and M. Franklin, "Identity-based encryption from the Weil pairing," SIAM J. Comput., vol.32, no.3, pp.586-615, 2003. Updated version of [4].
6. R. Canetti, O. Goldreich, and S. Halevi, "The random oracle model, revisited," 30th Annual ACM Symposium on Theory of Computing - STOC '98, pp.209-218, 1998.
7. C. Cocks, "An identity based encryption scheme based on quadratic residues," Cryptography and Coding, LNCS 2260, pp.360-363, Springer-Verlag, 2001.
8. R. Cramer and V. Shoup, "A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack," Advances in Cryptology - CRYPTO '98, LNCS 1462, pp. 13-25, Springer-Verlag, 1998.
9. R. Cramer and V. Shoup, "Design and analysis of practical public-key encryption scheme secure against adaptive chosen ciphertext attack," SIAM J. Comput., vol.33, no.1, pp.167-226, 2003.
10. Y. Desmedt and J. Quisquater, "Public-key systems based on the difficulty of tampering," Advances in Cryptology - CRYPTO '86, LNCS 0263, pp.111-117, Springer-Verlag, 1986.
11. Y. Dodis and N. Fazio, "Public key trace and revoke scheme secure against adaptive chosen ciphertext attack," Public Key Cryptography-PKC '03, LNCS 2567, pp.100-115, Springer-Verlag, 2003. Full version is available at http://eprint.iacr.org/
12. Y. Dodis, J. Katz, S. Xu, and M. Yung, "Key-insulated public key cryptosystems," Advances in Cryptology - EUROCRYPT '02, LNCS 2332, pp.65-82, Springer-Verlag, 2002.
13. T. El Gamal, "A public-key cryptosystem and a signature scheme based on the discrete logarithm," IEEE Trans. Inf. Theory, vol.31, no.4, pp.469-472, 1985.
14. S.-H. Heng and K. Kurosawa, "k-Resilient identity-based encryption in the standard model," Topics in Cryptology - CT-RSA '04, LNCS 2964, pp.67-80, Springer-Verlag, 2004. Full version is available at http://kuro.cis.ibaraki.ac.jp/~kurosawa/04.html
15. D. Hühnlein, M.J. Jacobson, and D. Weber, "Towards practical non-interactive public key cryptosystems using non-maximal imaginary quadratic orders," Selected Areas in Cryptography -SAC '00, LNCS 2012, pp.275-287, Springer-Verlag, 2001.
16. K. Kurosawa and Y. Desmedt, "Optimum traitor tracing and asymmetric schemes," Advances in Cryptology - EUROCRYPT '98, LNCS 1403, pp. 145-157, Springer-Verlag, 1998.
17. K. Kurosawa and T. Yoshida, "Linear code implies public-key traitor tracing," Public Key Cryptography - PKC '02, LNCS 2274, pp. 172-187, Springer-Verlag, 2002.
18. U. Maurer and Y. Yacobi, "Non-interactive public-key cryptogra phy," Advances in Cryptology -EUROCRYPT '91, LNCS 0547, pp.498-507, Springer-Verlag, 1991.
19. T. Pedersen, "Non-interactive and information-theoretic secure verifiable secret sharing," Advances in Cryptology - CRYPTO '91, LNCS 0576, pp. 129-140, Springer-Verlag, 1992.
20. C. Rackoff and D. Simon, "Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack," Advances in Cryptology - CRYPTO '91, LNCS 0576, pp.433-444, Springer-Verlag, 1992.
21. A. Shamir, "Identity-based cryptosystems and signature schemes," Advances in Cryptology - CRYPTO '84, LNCS 0196, pp.47-53, Springer-Verlag, 1985.
22. R. Sakai, K. Ohgishi, and M. Kasahara, "Cryptosystems based on pairing over elliptic curve," Symposium on Cryptography and Information Security - SCIS '01, pp.369-372, 2001.
23. H. Tanaka, "A realization scheme for the identity-based cryptosystem," Advances in Cryptology - CRYPTO '87, LNCS 0293, pp.341-349, Springer-Verlag, 1987.
24. S. Tsuji and T. Itoh, "An ID-based cryptosystem based on the discrete logarithm problem," IEEE J. Sel. Areas Commun., vol.7, no.4, pp.467-473, 1989.
25. R. Waters, "Efficient identity-based ecryption without random oracles," Advances in Cryptology - EUROCRYPT '05, LNCS 3494, pp.114-127, 2005.
26. Y. Yacobi, "A note on the bilinear Diffie-Hellman assumption," IACR Cryptology ePrint Archive, Report 2002/113. Available from http://eprint.iacr.org/2002/113/