Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions

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

Volumn 3621 LNCS, Issue , 2006, Pages 205-222

  Abdalla, Michel ^a   Bellare, Mihir ^b   Catalano, Dario ^a   Kiltz, Eike ^b   Kohno, Tadayoshi ^b   Lange, Tanja ^c   Malone Lee, John ^d   Neven, Gregory ^e   Paillier, Pascal ^f   Shi, Haixia ^b  

^a Centre National de la Recherche Scientifique   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^d UNIVERSITY OF BRISTOL   (United Kingdom)

^e UNIVERSITY OF LEUVEN   (Belgium)

^f GEMPLUS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ANONYMOUS IBE SCHEME; COMPUTATIONALLY CONSISTENT; IDENTITY-BASED ENCRYPTION; PUBLIC-KEY ENCRYPTION;

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MATHEMATICAL TRANSFORMATIONS; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA; STATISTICAL METHODS;

COMPUTER CRIME;

EID: 33745134401     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (20)

1. M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi. Searchable encryption revisited: Consistency properties, relation to anonymous ibe, and extensions. Full version of current paper. Available at IACR Cryptology ePrint Archive, http://eprint.iacr.org.
2. M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In 29th ACM STOC. ACM Press, 1997.
3. M. Bellare, A. Boldyreva, A. Desai, and D. Pointcheval. Key-privacy in public-key encryption. In ASIACRYPT 2001, LNCS 2248. Springer, 2001.
4. M. Bellare and S. K. Miner. A forward-secure digital signature scheme. In CRYPTO'99, LNCS 1666. Springer, 1999.
5. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In ACM CCS 93. ACM Press, 1993.
6. D. Boneh, X. Boyen, and E.-J. Goh. Hierarchical identity based encryption with constant size ciphertext. In EUROCRYPT 2005, LNCS 3494. Springer, 2005.
7. D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano. Public key encryption with keyword search. In EUROCRYPT 2004, LNCS 3027. Springer, 2004.
8. D. Boneh and M. K. Franklin. Identity based encryption from the Weil pairing. SIAM Journal on Computing, 32(3), 2003.
9. R. Canetti, S. Halevi, and J. Katz. A forward-secure public-key encryption scheme. In EUROCRYPT 2003, LNCS 2656. Springer, 2003.
10. C. Dwork, M. Naor, and O. Reingold. Immunizing encryption schemes from decryption errors. In EUROCRYPT 2004, LNCS 3027. Springer, 2004.
11. C. Gentry and A. Silverberg. Hierarchical ID-based cryptography. In ASIACRYPT 2002, LNCS 2501. Springer, 2002.
12. E.-J. Goh. Secure indexes. Cryptology ePrint Archive, Report 2003/216, 2003.
13. O. Goldreich. Foundations of Cryptography: Basic Applications, volume 2. Cambridge University Press, Cambridge, UK, 2004.
14. P. Golle, J. Staddon, and B. R. Waters. Secure conjunctive keyword search over encrypted data. In ACNS 2004, LNCS 3089. Springer, 2004.
15. S. Halevi. A sufficient condition for key-privacy. Cryptology ePrint Archive, Report 2005/005, 2005.
16. J. Horwitz and B. Lynn. Toward hierarchical identity-based encryption. In EUROCRYPT 2002, LNCS 2332, Springer, 2002.
17. A. Shamir. Identity-based cryptosystems and signature schemes. In CRYPTO'84, LNCS 196. Springer, 1985.
18. D. X. Song, D. Wagner, and A. Perrig. Practical techniques for searches on encrypted data. In 2000 IEEE Symposium on Security and Privacy, 2000.
19. B. R. Waters. Efficient identity-based encryption without random oracles. In EUROCRYPT 2005, LNCS 3494. Springer, 2005.
20. B. R. Waters, D. Balfanz, G. Durfee, and D. K. Smetters. Building an encrypted and searchable audit log. In ISOC NDSS 2004, 2004.