Journal of Cryptology

, Volume 21, Issue 3, pp 350–391 | Cite as

Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions

  • Michel Abdalla
  • Mihir Bellare
  • Dario Catalano
  • Eike Kiltz
  • Tadayoshi Kohno
  • Tanja Lange
  • John Malone-Lee
  • Gregory Neven
  • Pascal Paillier
  • Haixia Shi
Article

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.

Keywords

Foundations Random-oracle model Anonymity Identity-based encryption Searchable encryption 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, H. Shi, Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions, Cryptology ePrint Archive, 2005. http://eprint.iacr.org/
  2. [2]
    M. Ajtai, C. Dwork, A public-key cryptosystem with worst-case/average-case equivalence, in 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, USA, May 4–6, 1997 (ACM Press, New York, 1997), pp. 284–293 Google Scholar
  3. [3]
    M. Bellare, A. Boldyreva, A. Desai, D. Pointcheval, Key-privacy in public-key encryption, in Advances in Cryptology—ASIA CRYPT 2001, ed. by C. Boyd, Gold Coast, Australia, December 9–13, 2001. Lecture Notes in Computer Science, vol. 2248 (Springer, Berlin, 2001), pp. 566–582 Google Scholar
  4. [4]
    M. Bellare, S.K. Miner, A forward-secure digital signature scheme, in Advances in Cryptology—CRYPTO’99, ed. by M.J. Wiener, Santa Barbara, CA, USA, August 15–19, 1999. Lecture Notes in Computer Science, vol. 1666 (Springer, Berlin, 1994), pp. 431–448 Google Scholar
  5. [5]
    M. Bellare, P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, in ACM CCS 93: 1st Conference on Computer and Communications Security, Fairfax, VA, November 3–5, 1993 (ACM Press, New York, 1993), pp. 62–73 CrossRefGoogle Scholar
  6. [6]
    D. Boneh, X. Boyen, Secure identity based encryption without random oracles, in Advances in Cryptology—CRYPTO 2004, ed. by M. Franklin, Santa Barbara, CA, August 15–19, 2004. Lecture Notes in Computer Science, vol. 3152 (Springer, Berlin, 2004), pp. 443–459 Google Scholar
  7. [7]
    D. Boneh, X. Boyen, E.-J. Goh, Hierarchical identity based encryption with constant size ciphertext, in Advances in Cryptology—EUROCRYPT 2005, ed. by R. Cramer, Aarhus, Denmark, May 22–26, 2005. Lecture Notes in Computer Science, vol. 3494 (Springer, Berlin, 2005), pp. 440–456 Google Scholar
  8. [8]
    D. Boneh, G. Di Crescenzo, R. Ostrovsky, G. Persiano, Public key encryption with keyword search, in Advances in Cryptology—EUROCRYPT 2004, ed. by C. Cachin, J. Camenisch, Interlaken, Switzerland, May 2–6, 2004. Lecture Notes in Computer Science, vol. 3027 (Springer, Berlin, 2004), pp. 506–522 Google Scholar
  9. [9]
    D. Boneh, M.K. Franklin, Identity based encryption from the Weil pairing, SIAM J. Comput. 32(3), 586–615 (2003) MATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    D. Boneh, Brent R. Waters, Conjunctive, subset, and range queries on encrypted data, in TCC 2007: 4th Theory of Cryptography Conference, ed. by S.P. Vadhan, Amsterdam, The Netherlands, February 21–24, 2007. Lecture Notes in Computer Science, vol. 4392 (Springer, Berlin, 2007). Also available at http://eprint.iacr.org/, Report 2006/287 Google Scholar
  11. [11]
    X. Boyen, B. Waters, Anonymous hierarchical identity-based encryption (without random oracles), in Advances in Cryptology—CRYPTO 2006, ed. by C. Dwork, Santa Barbara, CA, August 20–24, 2006. Lecture Notes in Computer Science, vol. 4117 (Springer, Berlin, 2006), pp. 290–307 CrossRefGoogle Scholar
  12. [12]
    R. Canetti, S. Halevi, J. Katz, A forward-secure public-key encryption scheme, in Advances in Cryptology—EUROCRYPT 2003, ed. by E. Biham, Warsaw, Poland, May 4–8, 2003. Lecture Notes in Computer Science, vol. 2656 (Springer, Berlin, 2003), pp. 255–271 CrossRefGoogle Scholar
  13. [13]
    C. Dwork, M. Naor, O. Reingold, Immunizing encryption schemes from decryption errors, in Advances in Cryptology—EUROCRYPT 2004, ed. by C. Cachin, J. Camenisch, Interlaken, Switzerland, May 2–6, 2004. Lecture Notes in Computer Science, vol. 3027 (Springer, Berlin, 2004), pp. 342–360 Google Scholar
  14. [14]
    C. Gentry, Practical identity-based encryption without random oracles, in Advances in Cryptology—EUROCRYPT 2006, ed. by S. Vaudenay, St. Petersburg, Russia, May 28–June 1, 2006. Lecture Notes in Computer Science, vol. 4004 (Springer, Berlin, 2006), pp. 445–464 CrossRefGoogle Scholar
  15. [15]
    C. Gentry, A. Silverberg, Hierarchical ID-based cryptography, in Advances in Cryptology—ASIACRYPT 2002, ed. by Y. Zheng, Queenstown, New Zealand, December 1–5, 2002. Lecture Notes in Computer Science, vol. 2501 (Springer, Berlin, 2002), pp. 548–566 CrossRefGoogle Scholar
  16. [16]
    E.-J. Goh, Secure indexes, Cryptology ePrint Archive, Report 2003/216, 2003. http://eprint.iacr.org/
  17. [17]
    O. Goldreich, Foundations of Cryptography: Basic Applications, vol. 2 (Cambridge University Press, Cambridge, 2004) MATHGoogle Scholar
  18. [18]
    P. Golle, J. Staddon, B.R. Waters, Secure conjunctive keyword search over encrypted data, in ACNS 04: 2nd International Conference on Applied Cryptography and Network Security, ed. by M. Jakobsson, M. Yung, J. Zhou, Yellow Mountain, China, June 8–11, 2004. Lecture Notes in Computer Science, vol. 3089 (Springer, Berlin, 2004), pp. 31–45 Google Scholar
  19. [19]
    S. Halevi, A sufficient condition for key-privacy, Cryptology ePrint Archive, Report 2005/005, 2005. http://eprint.iacr.org/
  20. [20]
    J. Horwitz, B. Lynn, Toward hierarchical identity-based encryption, in Advances in Cryptology—EUROCRYPT 2002, ed. by L.R. Knudsen, Amsterdam, The Netherlands, April 28–May 2, 2002. Lecture Notes in Computer Science, vol. 2332 (Springer, Berlin, 2002), pp. 466–481 CrossRefGoogle Scholar
  21. [21]
    T. Malkin, D. Micciancio, S.K. Miner, Efficient generic forward-secure signatures with an unbounded number of time periods, in Advances in Cryptology—EUROCRYPT 2002, ed. by L.R. Knudsen, Amsterdam, The Netherlands, April 28–May 2, 2002. Lecture Notes in Computer Science, vol. 2332 (Springer, Berlin, 2002), pp. 400–417 CrossRefGoogle Scholar
  22. [22]
    D.J. Park, K. Kim, P.J. Lee, Public key encryption with conjunctive field keyword search, in WISA 04: 5th International Workshop on Information Security Applications, ed. by C.H. Lim, M. Yung, Jeju Island, Korea, August 23–25, 2004. Lecture Notes in Computer Science, vol. 3325 (Springer, Berlin, 2004), pp. 73–86 Google Scholar
  23. [23]
    A. Shamir, Identity-based cryptosystems and signature schemes, in Advances in Cryptology—CRYPTO’84, ed. by G.R. Blakley, D. Chaum, Santa Barbara, CA, August 19–23, 1985. Lecture Notes in Computer Science, vol. 196 (Springer, Berlin, 1985), pp. 47–53 CrossRefGoogle Scholar
  24. [24]
    D.X. Song, D. Wagner, A. Perrig, Practical techniques for searches on encrypted data, in 2000 IEEE Symposium on Security and Privacy, Oakland, CA, May 2000 (IEEE Computer Society Press, Reading, 2000), pp. 44–55 Google Scholar
  25. [25]
    B.R. Waters, Efficient identity-based encryption without random oracles, in Advances in Cryptology—EUROCRYPT 2005, ed. by R. Cramer, Aarhus, Denmark, May 22–26, 2005. Lecture Notes in Computer Science, vol. 3494 (Springer, Berlin, 2005), pp. 114–127 Google Scholar
  26. [26]
    B.R. Waters, D. Balfanz, G. Durfee, D.K. Smetters, Building an encrypted and searchable audit log, in ISOC Network and Distributed System Security Symposium—NDSS 2004, San Diego, CA, February 4–6, 2004 (The Internet Society, Reston, 2004) Google Scholar

Copyright information

© International Association for Cryptologic Research 2007

Authors and Affiliations

  • Michel Abdalla
    • 1
  • Mihir Bellare
    • 2
  • Dario Catalano
    • 3
  • Eike Kiltz
    • 4
  • Tadayoshi Kohno
    • 5
  • Tanja Lange
    • 6
  • John Malone-Lee
    • 7
  • Gregory Neven
    • 8
  • Pascal Paillier
    • 9
  • Haixia Shi
    • 10
  1. 1.Departement d’InformatiqueÉcole Normale Supérieure & CNRSParis Cedex 05France
  2. 2.Department of Computer Science & EngineeringUniversity of California San DiegoLa JollaUSA
  3. 3.Dipartimento di Matematica e InformaticaUniversità di CataniaCataniaItaly
  4. 4.CWI AmsterdamAmsterdamThe Netherlands
  5. 5.Department of Computer Science and EngineeringUniversity of WashingtonSeattleUSA
  6. 6.Department of Mathematics and Computer ScienceEindhoven University of TechnologyEindhovenThe Netherlands
  7. 7.EMB Consultancy LLPBristolUK
  8. 8.Department of Electrical EngineeringKatholieke Universiteit LeuvenHeverlee-LeuvenBelgium
  9. 9.Cryptography & InnovationSecurity Labs, GemaltoMeudon CedexFrance
  10. 10.NVIDIA CorporationSanta ClaraUSA

Personalised recommendations