Direct chosen-ciphertext secure identity-based key encapsulation without random oracles

Theoretical Computer Science

Volumn 410, Issue 47-49, 2009, Pages 5093-5111

  Kiltz, Eike ^a   Galindo, David ^b  

^a CWI   (Netherlands)

^b UNIVERSITY OF LUXEMBOURG   (Luxembourg)

Author keywords

Bilinear maps; Chosen ciphertext security; Identity based encryption; Public key cryptography

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

BILINEAR MAP; CHOSEN CIPHERTEXT ATTACK; CHOSEN CIPHERTEXT SECURITY; EFFICIENCY IMPROVEMENT; HIERARCHICAL IDENTITY-BASED ENCRYPTIONS; IDENTITY BASED ENCRYPTION; IDENTITY BASED ENCRYPTION SCHEMES; WITHOUT RANDOM ORACLES;

CRYPTOGRAPHY;

EID: 79951515923     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.08.007     Document Type: Article

References (58)

1. American National Standards Institute (ANSI) X9.F1 subcommittee, ANSI X9.63 Public-key cryptography for the Financial Services Industry: Elliptic curve key agreement and key transport schemes, July 5, 1998. Working draft version 2.0.
2. Mihir Bellare, Anand Desai, David Pointcheval, Phillip Rogaway, Relations among notions of security for public-key encryption schemes, in: Hugo Krawczyk (Ed.), Advances in Cryptology-CRYPTO'98, in: Lecture Notes in Computer Science, vol. 1462, Springer-Verlag, Berlin, Germany, August 1998, pp. 26-45.
3. Mihir Bellare, Chanathip Namprempre, Authenticated encryption: Relations among notions and analysis of the generic composition paradigm, in: Tatsuaki Okamoto (Ed.), Advances in Cryptology-ASIACRYPT 2000, in: Lecture Notes in Computer Science, vol. 1976, Springer-Verlag, Berlin, Germany, December 2000, pp. 531-545.
4. Mihir Bellare, Thomas Ristenpart, Simulation without the artificial abort: Improved concrete security for waters' IBE scheme, in: Antoine Joux (Ed.), Advances in Cryptology - EUROCRYPT 2009, in: Lecture Notes in Computer Science, vol.5479, Springer-Verlag, Berlin, Germany, April 2009, pp. 407-424.
5. Mihir Bellare, Phillip Rogaway, Random oracles are practical: A paradigm for designing efficient protocols, in: V. Ashby (Ed.), ACM CCS 93: 1st Conference on Computer and Communications Security, ACM Press, November 1993, pp. 62-73.
6. Mihir Bellare, Phillip Rogaway, The exact security of digital signatures: How to sign with RSA and Rabin, in: Ueli M. Maurer (Ed.), Advances in Cryptology-EUROCRYPT'96, in: Lecture Notes in Computer Science, vol. 1070, Springer-Verlag, Berlin, Germany, May 1996, pp. 399-416. (Pubitemid 126071082)
7. Kamel Bentahar, Pooya Farshim, John Malone-Lee, Nigel P. Smart, Generic constructions of identity-based and certificateless KEMs, Journal of Cryptology 21 (2) (2008) 178-199. (Pubitemid 351653335)
8. Dan Boneh, Xavier Boyen, Efficient selective-ID secure identity based encryption without random oracles, in: Christian Cachin, Jan Camenisch (Eds.), Advances in Cryptology-EUROCRYPT 2004, in: Lecture Notes in Computer Science, vol. 3027, Springer-Verlag, Berlin, Germany, May 2004, pp. 223-238.
9. Dan Boneh, Xavier Boyen, Secure identity based encryption without random oracles, in: Matthew Franklin (Ed.), Advances in Cryptology- CRYPTO 2004, in: Lecture Notes in Computer Science, vol. 3152, Springer-Verlag, Berlin, Germany, August 2004, pp. 443-459.
10. Dan Boneh, Xavier Boyen, Eu-Jin Goh, Hierarchical identity based encryption with constant size ciphertext, in: Ronald Cramer (Ed.), Advances in Cryptology-EUROCRYPT 2005, in: Lecture Notes in Computer Science, vol. 3494, Springer-Verlag, Berlin, Germany, May 2005, pp. 440-456. (Pubitemid 41313968)
11. Dan Boneh, Ran Canetti, Shai Halevi, Jonathan Katz, Chosen-ciphertext security from identity-based encryption, SIAM Journal on Computing 36 (5) (2006) 915-942.
12. Dan Boneh, Matthew K. Franklin, Identity-based encryption from the Weil pairing, in: Joe Kilian (Ed.), in: Lecture Notes in Computer Science, vol. 2139, Springer-Verlag, Berlin, Germany, August 2001, pp. 213-229. (Pubitemid 33317917)
13. Dan Boneh, Matthew K. Franklin, Identity based encryption from the Weil pairing, SIAM Journal on Computing 32 (3) (2003) 586-615.
14. Dan Boneh, Jonathan Katz, Improved efficiency for CCA-secure cryptosystems built using identity-based encryption, in: Alfred Menezes (Ed.), Topics in Cryptology-CT-RSA 2005, in: Lecture Notes in Computer Science, vol. 3376, Springer-Verlag, Berlin, Germany, February 2005, pp. 87-103. (Pubitemid 41235422)
15. Xavier Boyen, Qixiang Mei, Brent Waters, Direct chosen ciphertext security from identity-based techniques, in: Vijayalakshmi Atluri, Catherine Meadows, Ari Juels (Eds.), ACM CCS 05: 12th Conference on Computer and Communications Security, ACM Press, November 2005, pp. 320-329. (Pubitemid 44022015)
16. Ran Canetti, Oded Goldreich, Shai Halevi, The random oracle methodology, revisited (preliminary version), in: 30th Annual ACM Symposium onTheory of Computing, ACM Press, May 1998, pp. 209-218.
17. Ran Canetti, Shai Halevi, Jonathan Katz, Chosen-ciphertext security from identity-based encryption, in: Christian Cachin, Jan Camenisch (Eds.), Advances in Cryptology-EUROCRYPT 2004, in: Lecture Notes in Computer Science, vol. 3027, Springer-Verlag, Berlin, Germany, May 2004, pp. 207-222.
18. Sanjit Chatterjee, Palash Sarkar, Trading time for space: Towards an efficient IBE scheme with short(er) public parameters in the standard model, in: Dongho Won, Seungjoo Kim (Eds.), iClSC 05: 8th International Conference on Information Security and Cryptology, in: Lecture Notes in Computer Science, vol. 3935, Springer-Verlag, Berlin, Germany, December 2005, pp. 424-440. (Pubitemid 44029549)
19. Sanjit Chatterjee, Palash Sarkar, New constructions of constant size ciphertext hibe without random oracle, in: Min Surp Rhee, Byoungcheon Lee (Eds.), Information Security and Cryptology - IClSC 2006, in: Lecture Notes in Computer Science, vol. 3027, Springer-Verlag, Berlin, Germany, December 2006, pp. 310-327. (Pubitemid 47163828)
20. Clifford Cocks, An identity based encryption scheme based on quadratic residues, in: Bahram Honary (Ed.), Cryptography and Coding, 8th IMA International Conference, in: Lecture Notes in Computer Science, vol. 2260, Springer-Verlag, Berlin, Germany, 2001, pp. 360-363. Cirencester, UK, December 17-19.
21. Ronald Cramer, Victor Shoup, Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack, SIAM Journal on Computing 33 (1) (2003) 167-226.
22. Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrzak, On the generic insecurity of the full domain hash, in: Victor Shoup (Ed.), Advances in Cryptology- CRYPTO 2005, in: Lecture Notes in Computer Science, vol. 3621, Springer-Verlag, Berlin, Germany, August 2005, pp. 449-466.
23. Shimon Even, Oded Goldreich, Silvio Micali, On-line/off-line digital signatures, Journal of Cryptology 9 (1) (1996) 35-67. (Pubitemid 126814351)
24. Eiichiro Fujisaki, Tatsuaki Okamoto, How to enhance the security of public-key encryption at minimum cost, in: Hideki Imai, Yuliang Zheng (Eds.), PKC'99: 2nd International Workshop on Theory and Practice in Public Key Cryptography, in: Lecture Notes in Computer Science, vol. 1560, Springer-Verlag, Berlin, Germany, March 1999, pp. 53-68.
25. David Galindo, Eike Kiltz, Chosen-ciphertext secure threshold identity-based key encapsulation without random oracles, in: Roberto De Prisco, Moti Yung (Eds.), SCN 06: 5th International Conference on Security in Communication Networks, in: Lecture Notes in Computer Science, vol. 4116, Springer-Verlag, Berlin, Germany, September 2006, pp. 173-185. (Pubitemid 44568298)
26. Craig Gentry, Practical identity-based encryption without random oracles, in: Serge Vaudenay (Ed.), Advances in Cryptology - EUROCRYPT 2006, in: Lecture Notes in Computer Science, vol. 4004, Springer-Verlag, Berlin, Germany, May/June 2006, pp. 445-464. (Pubitemid 44072255)
27. Craig Gentry, Alice Silverberg, Hierarchical ID-based cryptography, in: Yuliang Zheng (Ed.), Advances in Cryptology-ASIACRYPT 2002, in: Lecture Notes in Computer Science, vol. 2501, Springer-Verlag, Berlin, Germany, December 2002, pp. 548-566.
28. Shai Halevi, EME*: Extending EMEto handle arbitrary-length messages with associated data, in: Anne Canteaut, Kapalee Viswanathan (Eds.), Progress in Cryptology-INDOCRYPT 2004: 5th International Conference in Cryptology in India, in: Lecture Notes in Computer Science, vol. 3348, SpringerVerlag, Berlin, Germany, December 2004, pp. 315-327. (Pubitemid 39748317)
29. Shai Halevi, Phillip Rogaway, A tweakable enciphering mode, in: Dan Boneh (Ed.), Advances in Cryptology-CRYPTO 2003, in: Lecture Notes in Computer Science, vol. 2729, Springer-Verlag, Berlin, Germany, August 2003, pp. 482-499. (Pubitemid 137636959)
30. Shai Halevi, Phillip Rogaway, A parallelizable enciphering mode, in: Tatsuaki Okamoto (Ed.), Topics in Cryptology-CT-RSA 2004, in: Lecture Notes in Computer Science, vol. 2964, Springer-Verlag, Berlin, Germany, February 2004, pp. 292-304.
31. W. Hoeffding, Probability inequalities for sums of bounded random variables, Journal of the American Statistical Association 58 (1963) 13-30.
32. Jeremy Horwitz, Ben Lynn, Toward hierarchical identity-based encryption, in: Lars R. Knudsen (Ed.), Advances in Cryptology-EUROCRYPT 2002, in: Lecture Notes in Computer Science, vol. 2332, Springer-Verlag, Berlin, Germany, April/May 2002, pp. 466-481.
33. IEEE P1363.3 Committee, IEEE 1363.3 / CfS - Standard for identity-based cryptographic techniques using pairings. http://grouper.ieee.org/groups/1363/ index.html /, February 2006. (Call for submissions).
34. IEEE P1363a Committee, IEEE P1363a / D9 - Standard specifications for public key cryptography: Additional techniques. http://grouper.ieee.org/groups/ 1363/index.html /, June 2001. Draft Version 9.
35. IETF, The internet engineering task force. http://www.ietf.org/.
36. Antoine Joux, A one round protocol for tripartite diffie-hellman, in: Algorithmic Number Theory-ANTS IV, in: LNCS, vol. 1838, Springer-Verlag, 2000, pp. 385-394.
37. Eike Kiltz, Chosen-ciphertext secure identity-based encryption in the standard model with short ciphertexts. Cryptology ePrint Archive, Report 2006/122, 2006. http://eprint.iacr.org/.
38. Eike Kiltz, Chosen-ciphertext security from tag-based encryption, in: Shai Halevi, Tal Rabin (Eds.), TCC 2006: 3rd Theory of Cryptography Conference, in: Lecture Notes in Computer Science, vol. 3876, Springer-Verlag, Berlin, Germany, March 2006, pp. 581-600. (Pubitemid 43979869)
39. Eike Kiltz, On the limitations of the spread of an IBE-to-PKE transformation, in: Moti Yung, Yevgeniy Dodis, Aggelos Kiayias,Tal Malkin(Eds.), PKC 2006: 9th International Conference on Theory and Practice of Public Key Cryptography, in: Lecture Notes in Computer Science, vol. 3958, Springer-Verlag, Berlin, Germany, April 2006, pp. 274-289. (Pubitemid 44029587)
40. Eike Kiltz, David Galindo, Direct chosen-ciphertext secure identity-based key encapsulation without random oracles, in: ACISP 2006, in: Lecture Notes in Computer Science, vol. 4058, Springer-Verlag, 2006.
41. Eike Kiltz, Yevgeniy Vahlis, CCA2 secure IBE: Standard model efficiency through authenticated symmetric encryption, in: Tal Malkin (Ed.), Topics in Cryptology-CT-RSA 2008, in: Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, April 2008, pp. 221-238. (Pubitemid 351641986)
42. Kaoru Kurosawa, Yvo Desmedt, A new paradigm of hybrid encryption scheme, in: Matthew Franklin (Ed.), Advances in Cryptology-CRYPTO 2004, in: Lecture Notes in Computer Science, vol. 3152, Springer-Verlag, Berlin, Germany, August 2004, pp. 426-442.
43. David Naccache, Secure and practical identity-based encryption, IET Information Security 1 (1) (2007) 59-64. (Pubitemid 47545873)
44. Moni Naor, Omer Reingold, Number-theoretic constructions of efficient pseudo-random functions, in: 38th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, October 1997, pp. 458-467.
45. Moni Naor, Omer Reingold, On the construction of pseudorandom permutations: Luby-Rackoff revisited, Journal of Cryptology 12 (1) (1999) 29-66.
46. Moni Naor, Moti Yung, Universal one-way hash functions and their cryptographic applications, in: 21st Annual ACM Symposium on Theory of Computing, ACM Press, May 1989, pp. 33-43.
47. Duong Hieu Phan, David Pointcheval, About the security of ciphers (semantic security and pseudo-random permutations), in: Helena Handschuh, Anwar Hasan (Eds.), SAC 2004: 11th Annual International Workshop on Selected Areas in Cryptography, in: Lecture Notes in Computer Science, vol. 3357, Springer-Verlag, Berlin, Germany, August 2004, pp. 182-197. (Pubitemid 39743822)
48. Charles Rackoff, Daniel R. Simon, Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack, in: Joan Feigenbaum (Ed.), Advances in Cryptology-CRYPTO'91, in: Lecture Notes in Computer Science, vol. 576, Springer-Verlag, Berlin, Germany, August 1992, pp. 433-444.
49. John Rompel, One-way functions are necessary and sufficient for secure signatures, in: 22nd Annual ACM Symposium on Theory of Computing, ACM Press, May 1990, pp. 387-394. (Pubitemid 20729144)
50. R. Sakai, K. Ohgishi, M. Kasahara, Cryptosystems based on pairing over elliptic curve (in Japanese), in: Proceedings of the Symposium on Cryptography and Information Security - SCIS 2001, jan 2001.
51. Palash Sarkar, Sanjit Chatterjee, Construction of a hybrid (hierarchical) identity-based encryption protocol secure against adaptive attacks, Cryptology ePrint Archive, Report 2006/362, 2006. http://eprint.iacr.org/.
52. Palash Sarkar, Sanjit Chatterjee, Construction of a hybrid hibe protocol secure against adaptive attacks, in: Willy Susilo, Joseph K. Liu, Yi Mu (Eds.), Provable Security, First International Conference, ProvSec 2007, in: Lecture Notes in Computer Science, vol. 4784, Springer-Verlag, Berlin, Germany, 2007, pp. 51-67. Wollongong, Australia, November 1-2.
53. Michael Scott, Faster pairings using an elliptic curve with an efficient endomorphism, in: Subhamoy Maitra, C.E. Veni Madhavan, Ramarathnam Venkatesan(Eds.), Progress in Cryptology - INDOCRYPT 2005, in: Lecture Notes in Computer Science, vol. 3797, Springer-Verlag, Berlin, Germany, December 2005, pp. 258-269. (Pubitemid 43774873)
54. Adi Shamir, Identity-based cryptosystems and signature schemes, in: G.R. Blakley, David Chaum (Eds.), Advances in Cryptology-CRYPTO'84, in: Lecture Notes in Computer Science, vol. 196, Springer-Verlag, Berlin, Germany, August 1985, pp. 47-53.
55. Victor Shoup, A proposal foran ISO standard for public key encryption (version 2.1). manuscript, 2001. Available on http://shoup.net/papers/.
56. Victor Shoup, Sequences ofgames: A tool for taming complexity in security proofs. manuscript, 2004. Available from http://shoup.net/papers/.
57. Gilbert S. Vernam, Cipher printing telegraph systems for secret wire and radio telegraphic communications, Journal of the IEEE 55 (1926) 109-115.
58. Brent R. Waters, Efficient identity-based encryption without random oracles, in: Ronald Cramer (Ed.), Advances in Cryptology-EUROCRYPT 2005, in: Lecture Notes in Computer Science, vol. 3494, Springer-Verlag, Berlin, Germany, May 2005, pp. 114-127.