We present the first fully secure Identity-Based Encryption scheme (IBE) from the standard assumptions where the security loss depends only on the security parameter and is independent of the number of secret key queries. This partially answers an open problem posed by Waters (Eurocrypt 2005). Our construction combines the Waters' dual system encryption methodology (Crypto 2009) with the Naor-Reingold pseudo-random function (J. ACM, 2004) in a novel way. The security of our scheme relies on the DLIN assumption in prime-order groups. Along the way, we introduce a novel notion of dual system groups and a new randomization and parameter-hiding technique for prime-order bilinear groups. © 2013 International Association for Cryptologic Research.
CITATION STYLE
Chen, J., & Wee, H. (2013). Fully, (almost) tightly secure IBE and dual system groups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8043 LNCS, pp. 435–460). https://doi.org/10.1007/978-3-642-40084-1_25
Mendeley helps you to discover research relevant for your work.