Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions |
| |
| Authors: | Michel Abdalla Mihir Bellare Dario Catalano Eike Kiltz Tadayoshi Kohno Tanja Lange John Malone-Lee Gregory Neven Pascal Paillier Haixia Shi |
| |
| Affiliation: | (1) Departement d’Informatique, école Normale Supérieure & CNRS, 45 Rue d’Ulm, 75230 Paris Cedex 05, France;(2) Department of Computer Science & Engineering, University of California San Diego, 9500 Gilman Drive, La Jolla, CA 92093, USA;(3) Dipartimento di Matematica e Informatica, Università di Catania, Viale Andrea Doria 6, 95125 Catania, Italy;(4) CWI Amsterdam, P.O. Box 94079, 1090, GB, Amsterdam, The Netherlands;(5) Department of Computer Science and Engineering, University of Washington, P.O. Box 352350, Seattle, WA 98195-2350, USA;(6) Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600, MB, Eindhoven, The Netherlands;(7) EMB Consultancy LLP, Bristol, UK;(8) Department of Electrical Engineering, Katholieke Universiteit Leuven, Kasteelpark Arenberg 10, 3001 Heverlee-Leuven, Belgium;(9) Cryptography & Innovation, Security Labs, Gemalto, 6, Rue de la Verrerie, 92197 Meudon Cedex, France;(10) NVIDIA Corporation, 2701 San Tomas Expressway, Santa Clara, CA 95050, USA |
| |
| Abstract: | We identify and fill some gaps with regard to consistency (the extent to which false positives are produced) for public-key encryption with keyword search (PEKS). We define computational and statistical relaxations of the existing notion of perfect consistency, show that the scheme of Boneh et al. (Advances in Cryptology—EUROCRYPT 2004, ed. by C. Cachin, J. Camenisch, pp. 506–522, 2004) is computationally consistent, and provide a new scheme that is statistically consistent. We also provide a transform of an anonymous identity-based encryption (IBE) scheme to a secure PEKS scheme that, unlike the previous one, guarantees consistency. Finally, we suggest three extensions of the basic notions considered here, namely anonymous hierarchical identity-based encryption, public-key encryption with temporary keyword search, and identity-based encryption with keyword search. An extended abstract of this paper appears in Advances in Cryptology—CRYPTO 2005, ed. by V. Shoup, Santa Barbara, California, August 14–18, 2005, Lecture Notes in Computer Science, vol. 3621 (Springer, Berlin, 2005), pp. 205–222. This is the full version. |
| |
| Keywords: | Foundations Random-oracle model Anonymity Identity-based encryption Searchable encryption |
| 本文献已被 SpringerLink 等数据库收录！ |
|
