k-Resilient identity-based encryption in the standard model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2964, Issue , 2004, Pages 67-80

  Heng, Swee Huay ^a   Kurosawa, Kaoru ^b  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b IBARAKI UNIVERSITY   (Japan)

Author keywords

Identity based encryption; Standard model

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CIPHERTEXTS; DECISIONAL DIFFIE HELLMAN; IDENTITY BASED ENCRYPTION; IDENTITY BASED ENCRYPTION SCHEMES; PROVABLY SECURE; RANDOM ORACLE MODEL; STANDARD MODEL; THE STANDARD MODEL;

CRYPTOGRAPHY;

EID: 32244433334     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24660-2_6     Document Type: Article

References (22)

1. D. Boneh and M. Franklin. An efficient public key traitor tracing scheme. Advances in Cryptology - CRYPTO '99, LNCS1666, pp. 338-353, Springer-Verlag, 1999.
2. 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.
3. D. Boneh and M. Franklin. Identity-based encryption from the weil pairing. Siam Journal of Computing, Vol. 32, pp. 586-615, 2003. Updated version of [2].
4. 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.
5. C. Cocks. An identity based encryption scheme based on quadratic residues. Cryptography and Coding, LNCS 2260, pp. 360-363, Springer-Verlag, 2001.
6. 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.
7. R. Cramer and V. Shoup. Design and analysis of practical public-key encryption scheme secure against adaptive chosen ciphertext attack. Manuscript, 2001. To appear in Siam Journal of Computing.
8. 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.
9. 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 available at http://eprint.iacr.org/.
10. 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.
11. T. El Gamal. A public-key cryptosystem and a signature scheme based on the discrete logarithm. IEEE Transactions on Information Theory, vol. 31 No. 4, pp. 469-472, 1985.
12. 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.
13. K. Kurosawa and Y. Desmedt. Optimum traitor tracing and asymmetric schemes. Advances in Cryptology - EUROCRYPT '98, LNCS 1403, pp. 145-157, Springer-Verlag, 1998.
14. 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.
15. U. Maurer and Y. Yacobi. Non-interactive public-key cryptography. Advances in Cryptology - EUROCRYPT '91, LNCS 0547, pp. 498-507, Springer-Verlag, 1991.
16. T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. Advances in Cryptology - CRYPTO '91, LNCS 0576, pp. 129-140, Springer-Verlag, 1992.
17. 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.
18. A. Shamir. Identity-based cryptosystems and signature schemes. Advances in Cryptology - CRYPTO '84, LNCS 0196, pp. 47-53, Springer-Verlag, 1985.
19. 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 (In Japanese).
20. H. Tanaka. A realization scheme for the identity-based cryptosystem. Advances in Cryptology - CRYPTO '87, LNCS 0293, pp. 341-349, Springer-Verlag, 1987.
21. S. Tsuji and T. Itoh. An ID-based cryptosystem based on the discrete logarithm problem. IEEE Journal on Selected Areas in Communication, vol. 7, no. 4, pp. 467-473, 1989.
22. 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/.