research-article

A Survey of Provably Secure Searchable Encryption

Authors:

Christoph Bösch,

Andreas PeterAuthors Info & Claims

ACM Computing Surveys (CSUR), Volume 47, Issue 2

Article No.: 18, Pages 1 - 51

https://doi.org/10.1145/2636328

Published: 25 August 2014 Publication History

Abstract

We survey the notion of provably secure searchable encryption (SE) by giving a complete and comprehensive overview of the two main SE techniques: searchable symmetric encryption (SSE) and public key encryption with keyword search (PEKS). Since the pioneering work of Song, Wagner, and Perrig (IEEE S&P '00), the field of provably secure SE has expanded to the point where we felt that taking stock would provide benefit to the community.

The survey has been written primarily for the nonspecialist who has a basic information security background. Thus, we sacrifice full details and proofs of individual constructions in favor of an overview of the underlying key techniques. We categorize and compare the different SE schemes in terms of their security, efficiency, and functionality. For the experienced researcher, we point out connections between the many approaches to SE and identify open research problems.

Two major conclusions can be drawn from our work. While the so-called IND-CKA2 security notion becomes prevalent in the literature and efficient (sublinear) SE schemes meeting this notion exist in the symmetric setting, achieving this strong form of security efficiently in the asymmetric setting remains an open problem. We observe that in multirecipient SE schemes, regardless of their efficiency drawbacks, there is a noticeable lack of query expressiveness that hinders deployment in practice.

References

[1]

Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, Pascal Paillier, and Haixia Shi. 2008. Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions. Journal of Cryptology 21, 3 (2008), 350--391.

Digital Library

[2]

Masayuki Abe, Rosario Gennaro, Kaoru Kurosawa, and Victor Shoup. 2005. Tag-KEM/DEM: A new framework for hybrid encryption and a new analysis of kurosawa-desmedt KEM. In EUROCRYPT 2005 (LNCS), Vol. 3494. Springer, 128--146.

Digital Library

[3]

Michael Adjedj, Julien Bringer, Hervé Chabanne, and Bruno Kindarji. 2009. Biometric identification over encrypted data made feasible. In ICISS (LNCS), Vol. 5905. Springer, 86--100.

Digital Library

[4]

Rakesh Agrawal, Jerry Kiernan, Ramakrishnan Srikant, and Yirong Xu. 2004. Order-Preserving encryption for numeric data. In SIGMOD. ACM, 563--574.

Digital Library

[5]

Georgios Amanatidis, Alexandra Boldyreva, and Adam O'Neill. 2007. Provably-Secure schemes for basic query support in outsourced databases. In DBSec (LNCS), Vol. 4602. Springer, 14--30.

Digital Library

[6]

Joonsang Baek, Reihaneh Safavi-Naini, and Willy Susilo. 2006. On the integration of public key data encryption and public key encryption with keyword search. In ISC (LNCS), Vol. 4176. Springer, 217--232.

Digital Library

[7]

Joonsang Baek, Reihaneh Safavi-Naini, and Willy Susilo. 2008. Public key encryption with keyword search revisited. In ICCSA (LNCS), Vol. 5072. Springer, 1249--1259.

Digital Library

[8]

Lucas Ballard, Matthew Green, Breno de Medeiros, and Fabian Monrose. 2005a. Correlation-Resistant storage via keyword-searchable encryption. IACR Cryptology ePrint Archive 2005 (2005), 417.

[9]

Lucas Ballard, Seny Kamara, and Fabian Monrose. 2005b. Achieving efficient conjunctive keyword searches over encrypted data. In ICICS (LNCS), Vol. 3783. Springer, 414--426.

Digital Library

[10]

Feng Bao, Robert H. Deng, Xuhua Ding, and Yanjiang Yang. 2008. Private query on encrypted data in multi-user settings. In ISPEC (LNCS), Vol. 4991. Springer, 71--85.

Digital Library

[11]

Niko Bari and Birgit Pfitzmann. 1997. Collision-Free accumulators and fail-stop signature schemes without trees. In EUROCRYPT (LNCS), Vol. 1233. Springer, 480--494.

Digital Library

[12]

Olivier Baudron, David Pointcheval, and Jacques Stern. 2000. Extended notions of security for multicast public key cryptosystems. In ICALP (LNCS), Vol. 1853. Springer, 499--511.

Digital Library

[13]

Mihir Bellare, Alexandra Boldyreva, K. Kurosawa, and Jessica Staddon. 2007a. Multirecipient encryption schemes: How to save on bandwidth and computation without sacrificing security. IEEE Transactions on Information Theory 53, 11 (2007), 3927--3943.

Digital Library

[14]

Mihir Bellare, Alexandra Boldyreva, and Silvio Micali. 2000. Public-Key encryption in a multi-user setting: Security proofs and improvements. In EUROCRYPT (LNCS), Vol. 1807. Springer, 259--274.

Digital Library

[15]

Mihir Bellare, Alexandra Boldyreva, and Adam O'Neill. 2007b. Deterministic and efficiently searchable encryption. In CRYPTO (LNCS), Vol. 4622. Springer, 535--552.

Digital Library

[16]

Mihir Bellare, Alexandra Boldyreva, and Jessica Staddon. 2003. Randomness re-use in multi-recipient encryption schemeas. In PKC (LNCS), Vol. 2567. Springer, 85--99.

Digital Library

[17]

Mihir Bellare and Phillip Rogaway. 1993. Random oracles are practical: A paradigm for designing efficient protocols. In CCS. 62--73.

Digital Library

[18]

Mihir Bellare and Phillip Rogaway. 1994. Optimal asymmetric encryption. In EUROCRYPT (LNCS), Vol. 950. Springer, 92--111.

Digital Library

[19]

Steven M. Bellovin and William R. Cheswick. 2004. Privacy-enhanced searches using encrypted bloom filters. IACR Cryptology ePrint Archive 2004 (2004), 22.

[20]

Josh Cohen Benaloh and Michael de Mare. 1993. One-Way accumulators: A decentralized alternative to digital sinatures (extended abstract). In EUROCRYPT (LNCS), Vol. 765. 274--285.

Digital Library

[21]

John Bethencourt, Dawn Xiaodong Song, and Brent Waters. 2006. New constructions and practical applications for private stream searching (extended abstract). In S&P. IEEE Computer Society, 132--139.

Digital Library

[22]

John Bethencourt, Dawn Xiaodong Song, and Brent Waters. 2009. New techniques for private stream searching. ACM Transactions on Information and System Security. 12, 3 (Jan. 2009), Article 16, 32 pages.

Digital Library

[23]

Matt Blaze, Gerrit Bleumer, and Martin Strauss. 1998. Divertible protocols and atomic proxy cryptography. In EUROCRYPT (LNCS), Vol. 1403. Springer, 127--144.

[24]

Burton H. Bloom. 1970. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13, 7 (1970), 422--426.

Digital Library

[25]

Carlo Blundo, Vincenzo Iovino, and Giuseppe Persiano. 2009. Private-key hidden vector encryption with key confidentiality. In CANS (LNCS), Vol. 5888. 259--277.

Digital Library

[26]

Alexandra Boldyreva, Nathan Chenette, Younho Lee, and Adam O'Neill. 2009. Order-preserving symmetric encryption. In EUROCRYPT (LNCS), Vol. 5479. Springer, 224--241.

Digital Library

[27]

Alexandra Boldyreva, Nathan Chenette, and Adam O'Neill. 2011. Order-preserving encryption revisited: Improved security analysis and alternative solutions. In CRYPTO (LNCS), Vol. 6841. Springer, 578--595.

Digital Library

[28]

Dan Boneh. 1998. The decision diffie-hellman problem. In ANTS (LNCS), Vol. 1423. Springer, 48--63.

Digital Library

[29]

Dan Boneh and Xavier Boyen. 2004. Efficient selective-ID secure identity-based encryption without random oracles. In EUROCRYPT (LNCS), Vol. 3027. Springer, 223--238.

Digital Library

[30]

Dan Boneh, Xavier Boyen, and Eu-Jin Goh. 2005a. Hierarchical identity based encryption with constant size ciphertext. In EUROCRYPT (LNCS), Vol. 3494. Springer, 440--456.

Digital Library

[31]

Dan Boneh, Xavier Boyen, and Hovav Shacham. 2004a. Short group signatures. In CRYPTO (LNCS), Vol. 3152. Springer, 41--55.

Digital Library

[32]

Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, and Giuseppe Persiano. 2004b. Public key encryption with keyword search. In EUROCRYPT (LNCS), Vol. 3027. 506--522.

[33]

Dan Boneh and Matthew K. Franklin. 2001. Identity-based encryption from the weil pairing. In CRYPTO (LNCS), Vol. 2139. Springer, 213--229.

Digital Library

[34]

Dan Boneh and Matthew K. Franklin. 2003. Identity-based encryption from the weil pairing. SIAM J. Comput. 32, 3 (2003), 586--615.

Digital Library

[35]

Dan Boneh, Craig Gentry, Ben Lynn, and Hovav Shacham. 2003. Aggregate and verifiably encrypted signatures from bilinear maps. In EUROCRYPT (LNCS), Vol. 2656. Springer, 416--432.

Digital Library

[36]

Dan Boneh, Eu-Jin Goh, and Kobbi Nissim. 2005b. Evaluating 2-DNF formulas on ciphertexts. In TCC (LNCS), Vol. 3378. Springer, 325--341.

Digital Library

[37]

Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, and William E. Skeith III. 2007. Public key encryption that allows PIR queries. In CRYPTO (LNCS), Vol. 4622. Springer, 50--67.

Digital Library

[38]

Dan Boneh, Ben Lynn, and Hovav Shacham. 2001. Short signatures from the weil pairing. In ASIACRYPT (LNCS), Vol. 2248. Springer, 514--532.

Digital Library

[39]

Dan Boneh and Brent Waters. 2007. Conjunctive, subset, and range queries on encrypted data. In TCC (LNCS), Vol. 4392. Springer, 535--554.

Digital Library

[40]

Christoph Bösch, Qiang Tang, Pieter Hartel, and Willem Jonker. 2012. Selective document retrieval from encrypted database. In ISC (LNCS), Vol. 7483. Springer, 224--241.

Digital Library

[41]

Xavier Boyen and Brent Waters. 2006. Anonymous hierarchical identity-based encryption (without random oracles). In CRYPTO (LNCS), Vol. 4117. Springer, 290--307.

Digital Library

[42]

Zvika Brakerski and Vinod Vaikuntanathan. 2011. Fully homomorphic encryption from ring-LWE and security for key dependent messages. In CRYPTO (LNCS), Vol. 6841. 505--524.

Digital Library

[43]

Julien Bringer, Hervé Chabanne, and Bruno Kindarji. 2009. Error-Tolerant searchable encryption. In ICC. 1--6.

Digital Library

[44]

Richard Brinkman, Ling Feng, Jeroen Doumen, Pieter H. Hartel, and Willem Jonker. 2004. Efficient tree search in encrypted data. Information Systems Security 13, 3 (2004), 14--21.

[45]

Jin Wook Byun, Dong Hoon Lee, and Jongin Lim. 2006a. Efficient conjunctive keyword search on encrypted data storage system. In EuroPKI (LNCS), Vol. 4043. Springer, 184--196.

Digital Library

[46]

Jin Wook Byun, Hyun Suk Rhee, Hyun-A Park, and Dong Hoon Lee. 2006b. Off-Line keyword guessing attacks on recent keyword search schemes over encrypted data. In SDM (LNCS), Vol. 4165. Springer, 75--83.

Digital Library

[47]

Jan Camenisch, Susan Hohenberger, and Anna Lysyanskaya. 2005. Compact e-cash. In EUROCRYPT (LNCS), Vol. 3494. Springer, 302--321.

Digital Library

[48]

Jan Camenisch and Anna Lysyanskaya. 2002. Dynamic accumulators and application to efficient revocation of anonymous credentials. In CRYPTO (LNCS), Vol. 2442. Springer, 61--76.

Digital Library

[49]

Ran Canetti, Shai Halevi, and Jonathan Katz. 2003. A forward-secure public-key encryption scheme. In EUROCRYPT (LNCS), Vol. 2656. Springer, 255--271.

Digital Library

[50]

Angelo De Caro, Vincenzo Iovino, and Giuseppe Persiano. 2011. Hidden vector encryption fully secure against unrestricted queries. IACR Cryptology ePrint Archive 2011 (2011), 546.

[51]

David Cash, Stanislaw Jarecki, Charanjit S. Jutla, Hugo Krawczyk, Marcel Rosu, and Michael Steiner. 2013. Highly-Scalable searchable symmetric encryption with support for Boolean queries. IACR 2013 (2013), 169.

[52]

Yan-Cheng Chang and Michael Mitzenmacher. 2005. Privacy preserving keyword searches on remote encrypted data. In (ACNS). 442--455.

Digital Library

[53]

Melissa Chase and Seny Kamara. 2010. Structured encryption and controlled disclosure. In ASIACRYPT (LNCS), Vol. 6477. Springer, 577--594. Available at http://dblp.uni-trier.de/db/conf/asiacrypt/ asiacrypt2010.html&num;ChaseK10.

[54]

Sanjit Chatterjee and Alfred Menezes. 2009. On cryptographic protocols employing asymmetric pairings - The role of psi revisited. IACR Cryptology ePrint Archive 2009 (2009), 480.

[55]

David Chaum. 1982. Blind signatures for untraceable payments. In CRYPTO. Plenum Press, New York, 199--203.

[56]

Liqun Chen and Zhaohui Cheng. 2005. Security proof of sakai-kasahara's identity-based encryption scheme. In IMA Int. Conf. (LNCS), Vol. 3796. Springer, 442--459.

Digital Library

[57]

Benny Chor, Oded Goldreich, Eyal Kushilevitz, and Madhu Sudan. 1995. Private information retrieval. In Proceedings of the 36th Annuual IEEE Symposium on Foundations of Computer Science. 41--50.

Digital Library

[58]

Clifford Cocks. 2001. An identity based encryption scheme based on quadratic residues. In IMA Int. Conf. (LNCS), Vol. 2260. Springer, 360--363.

Digital Library

[59]

Ronald Cramer and Victor Shoup. 2000. Signature schemes based on the strong RSA assumption. ACM Trans. Inf. Syst. Secur. 3, 3 (2000), 161--185.

Digital Library

[60]

Giovanni Di Crescenzo and Vishal Saraswat. 2007. Public key encryption with searchable keywords based on jacobi symbols. In INDOCRYPT (LNCS), Vol. 4859. Springer, 282--296.

Digital Library

[61]

Reza Curtmola, Juan Garay, Seny Kamara, and Rafail Ostrovsky. 2006. Searchable symmetric encryption: Improved definitions and efficient constructions. In CCS. ACM, New York, NY, 79--88.

Digital Library

[62]

Whitfield Diffie and Martin E. Hellman. 1976. New directions in cryptography. IEEE Transactions on Information Theory 22, 6 (November 1976), 644--654.

Digital Library

[63]

Changyu Dong, Giovanni Russello, and Naranker Dulay. 2008. Shared and searchable encrypted data for untrusted servers. In DBSec. Springer-Verlag, Berlin, Heidelberg, 127--143. 10.1007/978-3-540-70567-3_10

Digital Library

[64]

Taher ElGamal. 1985. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31, 4 (1985), 469--472.

Digital Library

[65]

Amos Fiat and Moni Naor. 1994. Broadcast encryption. In CRYPTO (LNCS), Vol. 773. Springer, 480--491.

Digital Library

[66]

Michael L. Fredman, János Komlós, and Endre Szemerédi. 1984. Storing a sparse table with 0(1) worst case access time. J. ACM 31, 3 (1984), 538--544.

Digital Library

[67]

Eiichiro Fujisaki and Tatsuaki Okamoto. 1997. Statistical zero knowledge protocols to prove modular polynomial relations. In CRYPTO (LNCS), Vol. 1294. Springer, 16--30.

Digital Library

[68]

Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval, and Jacques Stern. 2001. RSA-OAEP is secure under the RSA assumption. In CRYPTO (LNCS), Vol. 2139. Springer, 260--274.

Digital Library

[69]

Craig Gentry. 2006. Practical identity-based encryption without random oracles. In EUROCRYPT (LNCS), Vol. 4004. Springer, 445--464.

Digital Library

[70]

Craig Gentry. 2009. Fully homomorphic encryption using ideal lattices. In STOC. ACM, 169--178.

Digital Library

[71]

Craig Gentry. 2010. Computing arbitrary functions of encrypted data. Commun. ACM 53, 3 (2010), 97--105.

Digital Library

[72]

Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan. 2010. A simple BGN-type cryptosystem from LWE. In EUROCRYPT (LNCS), Vol. 6110. Springer, 506--522.

Digital Library

[73]

Craig Gentry and Alice Silverberg. 2002. Hierarchical ID-based cryptography. In ASIACRYPT (LNCS), Vol. 2501. Springer, 548--566.

Digital Library

[74]

Eu-Jin Goh. 2003. Secure Indexes. Cryptology ePrint Archive, Report 2003/216. (2003). http://eprint.iacr. org/2003/216/.

[75]

Oded Goldreich. 2004. The Foundations of Cryptography - Volume 2, Basic Applications. Cambridge University Press.

Digital Library

[76]

Oded Goldreich and Rafail Ostrovsky. 1996. Software protection and simulation on oblivious RAMs. Journal of the ACM 43, 3 (1996), 431--473.

Digital Library

[77]

Shafi Goldwasser and Silvio Micali. 1982. Probabilistic encryption and how to play mental poker keeping secret all partial information. In STOC. ACM, 365--377.

Digital Library

[78]

Philippe Golle, Jessica Staddon, and Brent Waters. 2004. Secure conjunctive keyword search over encrypted data. In ACNS. LNCS 3089, 31--45.

[79]

Mitsuhiro Hattori, Takato Hirano, Takashi Ito, Nori Matsuda, Takumi Mori, Yusuke Sakai, and Kazuo Ohta. 2011. Ciphertext-Policy delegatable hidden vector encryption and its application to searchable encryption in multi-user setting. In IMACC (LNCS), Vol. 7089. Springer, 190--209.

Digital Library

[80]

Swee-Huay Heng and Kaoru Kurosawa. 2004. k-Resilient identity-based encryption in the standard model. In CT-RSA (LNCS), Vol. 2964. Springer, 67--80.

[81]

Swee-Huay Heng and Kaoru Kurosawa. 2006. k-Resilient identity-based encryption in the standard model. IEICE Transactions 89-A, 1 (2006), 39--46.

Digital Library

[82]

Jeremy Horwitz and Ben Lynn. 2002. Toward hierarchical identity-based encryption. In EUROCRYPT (LNCS), Vol. 2332. Springer, 466--481.

Digital Library

[83]

Yong Ho Hwang and Pil Joong Lee. 2007. Public key encryption with conjunctive keyword search and its extension to a multi-user system. In Pairing (LNCS), Vol. 4575. Springer, 2--22.

Digital Library

[84]

Luan Ibraimi, Svetla Nikova, Pieter H. Hartel, and Willem Jonker. 2011. Public-key encryption with delegated search. In ACNS (LNCS), Vol. 6715. 532--549.

Digital Library

[85]

Vincenzo Iovino and Giuseppe Persiano. 2008. Hidden-vector encryption with groups of prime order. In Pairing (LNCS), Vol. 5209. Springer, 75--88.

Digital Library

[86]

Antoine Joux. 2002. The Weil and Tate pairings as building blocks for public key cryptosystems. In ANTS (LNCS), Vol. 2369. Springer, 20--32.

Digital Library

[87]

Seny Kamara and Charalampos Papamanthou. 2013. Parallel and dynamic searchable symmetric encryption. In FC.

[88]

Seny Kamara, Charalampos Papamanthou, and Tom Roeder. 2012. Dynamic searchable symmetric encryption. In CCS. ACM, 965--976.

Digital Library

[89]

Jonathan Katz, Amit Sahai, and Brent Waters. 2008. Predicate encryption supporting disjunctions, polynomial equations, and inner products. In EUROCRYPT (LNCS), Vol. 4965. 146--162.

Digital Library

[90]

Dalia Khader. 2007. Public key encryption with keyword search based on k-resilient IBE. In ICCSA (LNCS), Vol. 4707. Springer, 1086--1095.

Digital Library

[91]

Aggelos Kiayias, Yiannis Tsiounis, and Moti Yung. 2007. Group encryption. In ASIACRYPT (LNCS), Vol. 4833. Springer, 181--199.

Digital Library

[92]

Eike Kiltz. 2007. From Selective-ID to Full Security: The Case of the Inversion-Based Boneh-Boyen IBE Scheme. Cryptology ePrint Archive, Report 2007/033. Available at http://eprint.iacr.org/.

[93]

Eike Kiltz and David Galindo. 2006. Direct chosen-ciphertext secure identity-based key encapsulation without random oracles. In ACISP (LNCS), Vol. 4058. Springer, 336--347.

Digital Library

[94]

Kaoru Kurosawa. 2002. Multi-recipient public-key encryption with shortened ciphertext. In PKC (LNCS), Vol. 2274. Springer, 48--63.

Digital Library

[95]

Kaoru Kurosawa and Yvo Desmedt. 2004. A new paradigm of hybrid encryption scheme. In CRYPTO (LNCS), Vol. 3152. Springer, 426--442.

[96]

Kaoru Kurosawa and Yasuhiro Ohtaki. 2012. UC-Secure searchable symmetric encryption. In FC (LNCS), Vol. 7397. Springer, 285--298.

[97]

Mehmet Kuzu, Mohammad Saiful Islam, and Murat Kantarcioglu. 2012. Efficient similarity search over encrypted data. In ICDE. IEEE Computer Society, 1156--1167.

Digital Library

[98]

Kwangsu Lee and Dong Hoon Lee. 2010. New techniques for anonymous HIBE with short ciphertexts in prime order groups. TIIS 4, 5 (2010), 968--988.

[99]

Kwangsu Lee and Dong Hoon Lee. 2011. Improved hidden vector encryption with short ciphertexts and tokens. Des. Codes Cryptography 58, 3 (2011), 297--319.

Digital Library

[100]

Allison B. Lewko, Tatsuaki Okamoto, Amit Sahai, Katsuyuki Takashima, and Brent Waters. 2010. Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption. In EUROCRYPT (LNCS), Vol. 6110. Springer, 62--91.

Digital Library

[101]

Jin Li, Qian Wang, Cong Wang, Ning Cao, Kui Ren, and Wenjing Lou. 2010. Fuzzy keyword search over encrypted data in cloud computing. In INFOCOM 2010. IEEE, 441--445.

Digital Library

[102]

Qin Liu, Guojun Wang, and Jie Wu. 2009. An efficient privacy preserving keyword search scheme in cloud computing. In CSE (2). IEEE Computer Society, 715--720.

Digital Library

[103]

S. Mitsunari, R. Sakai, and M. Kasahara. 2002. A new traitor tracing. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences E85-A (2002), 481--484.

[104]

Michael Naehrig, Kristin Lauter, and Vinod Vaikuntanathan. 2011. Can homomorphic encryption be practical&quest; In CCSW. ACM, 113--124.

Digital Library

[105]

Takashi Nishide, Kazuki Yoneyama, and Kazuo Ohta. 2008. Attribute-based encryption with partially hidden encryptor-specified access structures. In ACNS (LNCS), Vol. 5037. 111--129.

Digital Library

[106]

Takashi Nishide, Kazuki Yoneyama, and Kazuo Ohta. 2009. Attribute-based encryption with partially hidden ciphertext policies. IEICE Transactions 92-A, 1 (2009), 22--32.

[107]

Kaisa Nyberg. 1996. Fast accumulated hashing. In FSE (LNCS), Vol. 1039. 83--87.

Digital Library

[108]

Tatsuaki Okamoto and David Pointcheval. 2001. The gap-problems: A new class of problems for the security of cryptographic schemes. In PKC (LNCS), Vol. 1992. Springer, 104--118.

Digital Library

[109]

Tatsuaki Okamoto and Katsuyuki Takashima. 2009. Hierarchical predicate encryption for inner-products. In ASIACRYPT (LNCS), Vol. 5912. Springer, 214--231.

Digital Library

[110]

Tatsuaki Okamoto and Katsuyuki Takashima. 2010. Fully secure functional encryption with general relations from the decisional linear assumption. In CRYPTO (LNCS), Vol. 6223. 191--208.

Digital Library

[111]

Tatsuaki Okamoto and Katsuyuki Takashima. 2012. Adaptively attribute-hiding (hierarchical) inner product encryption. In EUROCRYPT (LNCS), Vol. 7237. 591--608.

Digital Library

[112]

Rafail Ostrovsky. 1990. Efficient computation on oblivious RAMs. In STOC. ACM, 514--523.

Digital Library

[113]

Rafail Ostrovsky. 1992. Software Protection and Simulations on Oblivious RAMs. Ph.D. Dissertation. MIT.

Digital Library

[114]

Rafail Ostrovsky and William E. Skeith III. 2005. Private searching on streaming data. In CRYPTO (LNCS), Vol. 3621. Springer, 223--240.

Digital Library

[115]

Rafail Ostrovsky and William E. Skeith. 2007. Private searching on streaming data. Journal of Cryptology 20, 4 (October 2007), 397--430.

Digital Library

[116]

Pascal Paillier. 1999. Public-Key cryptosystems based on composite degree residuosity classes. In EUROCRYPT (LNCS), Vol. 1592. Springer, 223--238.

Digital Library

[117]

Dong Jin Park, Juyoung Cha, and Pil Joong Lee. 2005. Searchable keyword-based encryption. IACR Cryptology ePrint Archive 2005 (2005), 367.

[118]

Dong Jin Park, Kihyun Kim, and Pil Joong Lee. 2004. Public key encryption with conjunctive field keyword search. In WISA (LNCS), Vol. 3325. Springer, 73--86.

Digital Library

[119]

Hyun-A Park, Bum Han Kim, Dong Hoon Lee, Yon Dohn Chung, and Justin Zhan. 2007. Secure similarity search. In GrC. IEEE, 598--604.

Digital Library

[120]

Jong Hwan Park. 2011. Inner-product encryption under standard assumptions. Designs, Codes and Cryptography 58, 3 (2011), 235--257.

Digital Library

[121]

Jong Hwan Park and Dong Hoon Lee. 2010. A hidden vector encryption scheme with constant-size tokens and pairing computations. IEICE Transactions 93-A, 9 (2010), 1620--1631.

[122]

Raluca A. Popa, Catherine M. S. Redfield, Nickolai Zeldovich, and Hari Balakrishnan. 2011. CryptDB: Protecting confidentiality with encrypted query processing. In SOSP. ACM, 85--100.

Digital Library

[123]

Mariana Raykova, Binh Vo, Steven M. Bellovin, and Tal Malkin. 2009. Secure anonymous database search. In CCSW. ACM, 115--126.

Digital Library

[124]

Hyun Sook Rhee, Jong Hwan Park, Willy Susilo, and Dong Hoon Lee. 2009. Improved searchable public key encryption with designated tester. In ASIACCS. ACM, 376--379.

Digital Library

[125]

Hyun Sook Rhee, Jong Hwan Park, Willy Susilo, and Dong Hoon Lee. 2010. Trapdoor security in a searchable public-key encryption scheme with a designated tester. Journal of Systems and Software 83, 5 (2010), 763--771.

Digital Library

[126]

Ronald L. Rivest, Adi Shamir, and Leonard M. Adleman. 1978. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21, 2 (1978), 120--126.

Digital Library

[127]

Eun-Kyung Ryu and Tsuyoshi Takagi. 2007. Efficient conjunctive keyword-searchable encryption. In AINAW. IEEE Computer Society, Washington, DC, 409--414.

Digital Library

[128]

Amit Sahai and Brent Waters. 2005. Fuzzy identity-based encryption. In Proceeding of EUROCRYPT 2005, Vol. 3494. Springer, 457--473.

Digital Library

[129]

Mike Scott. 2002. Authenticated ID-based Key Exchange and remote log-in with simple token and PIN number. IACR Cryptology ePrint Archive 2002 (2002), 164.

[130]

Saeed Sedghi, Peter van Liesdonk, Svetla Nikova, Pieter H. Hartel, and Willem Jonker. 2010. Searching keywords with wildcards on encrypted data. In SCN (LNCS), Vol. 6280. Springer, 138--153.

Digital Library

[131]

Adi Shamir. 1979. How to share a secret. Commun. ACM 22, 11 (November 1979), 612--613.

Digital Library

[132]

Adi Shamir. 1985. Identity-Based cryptosystems and signature schemes. In CRYPTO (LNCS), Vol. 196. Springer, 47--53.

Digital Library

[133]

Emily Shen, Elaine Shi, and Brent Waters. 2009. Predicate privacy in encryption systems. In TCC (LNCS), Vol. 5444. Springer, 457--473.

Digital Library

[134]

Elaine Shi, John Bethencourt, Hubert T.-H. Chan, Dawn Xiaodong Song, and Adrian Perrig. 2007. Multi-Dimensional range query over encrypted data. In S&P. IEEE Computer Society, 350--364.

Digital Library

[135]

Elaine Shi and Brent Waters. 2008. Delegating capabilities in predicate encryption systems. In ICALP (LNCS), Vol. 5126. Springer, 560--578.

Digital Library

[136]

V. Shoup. 2004. ISO 18033-2: An Emerging Standard for Public-Key Encryption (committee draft). Available at http://shoup.net/iso/.

[137]

Dawn Xiaodong Song, David Wagner, and Adrian Perrig. 2000. Practical techniques for searches on encrypted data. In IEEE Symposium on Security and Privacy. IEEE Computer Society, Washington, DC, 44--55.

Digital Library

[138]

Qiang Tang. 2011. Towards public key encryption scheme supporting equality test with fine-grained authorization. In ACISP (LNCS), Vol. 6812. Springer, 389--406.

Digital Library

[139]

Qiang Tang. 2012a. Public key encryption schemes supporting equality test with authorisation of different granularity. IJACT 2, 4 (2012), 304--321.

Digital Library

[140]

Qiang Tang. 2012b. Public key encryption supporting plaintext equality test and user-specified authorization. Security and Communication Networks 5, 12 (2012), 1351--1362.

Digital Library

[141]

Qiang Tang and Liqun Chen. 2009. Public-Key encryption with registered keyword search. In EuroPKI (LNCS), Vol. 6391. Springer, 163--178.

Digital Library

[142]

Marten van Dijk, Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan. 2010. Fully homomorphic encryption over the integers. In EUROCRYPT (LNCS), Vol. 6110. Springer, 24--43.

Digital Library

[143]

Peter van Liesdonk, Saeed Sedghi, Jeroen Doumen, Pieter H. Hartel, and Willem Jonker. 2010. Computationally efficient searchable symmetric encryption. In SDM (LNCS), Vol. 6358. Springer, 87--100.

Digital Library

[144]

Peishun Wang, Huaxiong Wang, and Josef Pieprzyk. 2007a. A new dynamic accumulator for batch updates. In ICICS (LNCS), Vol. 4861. Springer, 98--112.

Digital Library

[145]

Peishun Wang, Huaxiong Wang, and Josef Pieprzyk. 2007b. Common secure index for conjunctive keyword-based retrieval over encrypted data. In SDM (LNCS), Vol. 4721. Springer, 108--123.

Digital Library

[146]

Peishun Wang, Huaxiong Wang, and Josef Pieprzyk. 2008a. An efficient scheme of common secure indices for conjunctive keyword-based retrieval on encrypted data. In WISA (LNCS), Vol. 5379. Springer, 145--159.

[147]

Peishun Wang, Huaxiong Wang, and Josef Pieprzyk. 2008b. Keyword field-free conjunctive keyword searches on encrypted data and extension for dynamic groups. In CANS (LNCS), Vol. 5339. Springer, 178--195.

Digital Library

[148]

Peishun Wang, Huaxiong Wang, and Josef Pieprzyk. 2008c. Threshold privacy preserving keyword searches. In SOFSEM (LNCS), Vol. 4910. Springer, 646--658.

Digital Library

[149]

Guomin Yang, Chik How Tan, Qiong Huang, and Duncan S. Wong. 2010. Probabilistic public key encryption with equality test. In CT-RSA (LNCS), Vol. 5985. Springer, 119--131.

Digital Library

[150]

Yanjiang Yang, Feng Bao, Xuhua Ding, and Robert H. Deng. 2009. Multiuser private queries over encrypted databases. IJACT 1, 4 (2009), 309--319.

Digital Library

[151]

Yanjiang Yang, Haibing Lu, and Jian Weng. 2011. Multi-User private keyword search for cloud computing. In CloudCom. IEEE, 264--271.

Digital Library

[152]

Andrew Chi-Chih Yao. 1982. Protocols for secure computations (extended abstract). In IEEE Symposium on Foundations of Computer Science (FOCS '82). IEEE Computer Society, 160--164.

Digital Library

[153]

Wei-Chuen Yau, Swee-Huay Heng, and Bok-Min Goi. 2008. Off-Line keyword guessing attacks on recent public key encryption with keyword search schemes. In ATC (LNCS), Vol. 5060. Springer, 100--105.

Digital Library

[154]

Dae Hyun Yum, Duk Soo Kim, Jin Seok Kim, Pil Joong Lee, and Sung Je Hong. 2011. Order-Preserving encryption for non-uniformly distributed plaintexts. In WISA (LNCS), Vol. 7115. Springer, 84--97.

Digital Library

[155]

Rui Zhang and Hideki Imai. 2009. Combining public key encryption with keyword search and public key encryption. IEICE Transactions 92-D, 5 (2009), 888--896.

Cited By

Manikanta K. M A. G Akshay Aftab Ahmed Gavi Siddhana Gowda Prof. Shivakeshi Choupiri (2024)Authorized Keyword Search over Outsourced Encrypted Data in Cloud EnvironmentInternational Journal of Advanced Research in Science, Communication and Technology10.48175/IJARSCT-18468(418-420)Online publication date: 24-May-2024
https://doi.org/10.48175/IJARSCT-18468
Dou YChan H(2024)Leakage-Suppressed Encrypted Keyword Queries Over Multiple Cloud ServersIEEE Transactions on Cloud Computing10.1109/TCC.2023.333322312:1(26-39)Online publication date: Jan-2024
https://doi.org/10.1109/TCC.2023.3333223
Zhou QHuang DMi B(2024)Lightweight Multi-Keyword Ranking Searchable Encryption for Internet of Vehicles2024 IEEE 13th Data Driven Control and Learning Systems Conference (DDCLS)10.1109/DDCLS61622.2024.10606884(751-758)Online publication date: 17-May-2024
https://doi.org/10.1109/DDCLS61622.2024.10606884
Show More Cited By

Index Terms

A Survey of Provably Secure Searchable Encryption

Recommendations

Improvement of Provably Secure Self-Certified Proxy Convertible Authenticated Encryption Scheme
INCOS '12: Proceedings of the 2012 Fourth International Conference on Intelligent Networking and Collaborative Systems

By integrating self-certified public-key systems and the designated verifier proxy signature with message recovery, Wu and Lin proposed the first self-certified proxy convertible authenticated encryption (SP-CAE) scheme and its variants based on ...
Provably secure delegation-by-certification proxy signature schemes
InfoSecu '04: Proceedings of the 3rd international conference on Information security

In this paper, we first show that a previous proxy signature scheme by delegation with certificate is not provably secure under adaptive-chosen message attacks and adaptive-chosen warrant attacks. The scheme does not provide the strong undeniability. ...
Towards asymmetric searchable encryption with message recovery and flexible search authorization
ASIA CCS '13: Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security

When outsourcing data to third-party servers, searchable encryption is an important enabling technique which simultaneously allows the data owner to keep his data in encrypted form and the third-party servers to search in the ciphertexts. Motivated by ...

Comments

Information & Contributors

Information

Published In

cover image ACM Computing Surveys

ACM Computing Surveys Volume 47, Issue 2

January 2015

827 pages

ISSN:0360-0300

EISSN:1557-7341

DOI:10.1145/2658850

Editor:
Sartaj Sahni
Department of Computer and Information Science and Engineering/University of Florida/Gainesville

Issue’s Table of Contents

Copyright © 2014 Owner/Author.

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 August 2014

Accepted: 01 June 2014

Revised: 01 May 2014

Received: 01 December 2012

Published in CSUR Volume 47, Issue 2

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

228
Total Citations
View Citations
4,336
Total Downloads

Downloads (Last 12 months)258
Downloads (Last 6 weeks)18

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Manikanta K. M A. G Akshay Aftab Ahmed Gavi Siddhana Gowda Prof. Shivakeshi Choupiri (2024)Authorized Keyword Search over Outsourced Encrypted Data in Cloud EnvironmentInternational Journal of Advanced Research in Science, Communication and Technology10.48175/IJARSCT-18468(418-420)Online publication date: 24-May-2024
https://doi.org/10.48175/IJARSCT-18468
Dou YChan H(2024)Leakage-Suppressed Encrypted Keyword Queries Over Multiple Cloud ServersIEEE Transactions on Cloud Computing10.1109/TCC.2023.333322312:1(26-39)Online publication date: Jan-2024
https://doi.org/10.1109/TCC.2023.3333223
Zhou QHuang DMi B(2024)Lightweight Multi-Keyword Ranking Searchable Encryption for Internet of Vehicles2024 IEEE 13th Data Driven Control and Learning Systems Conference (DDCLS)10.1109/DDCLS61622.2024.10606884(751-758)Online publication date: 17-May-2024
https://doi.org/10.1109/DDCLS61622.2024.10606884
Walid RJoshi KChoi S(2024)Leveraging semantic context to establish access controls for secure cloud-based electronic health recordsInternational Journal of Information Management Data Insights10.1016/j.jjimei.2023.1002114:1(100211)Online publication date: Apr-2024
https://doi.org/10.1016/j.jjimei.2023.100211
Guo JTian CLu XZhao LDuan Z(2024)Multi-keyword ranked search with access control for multiple data owners in the cloudJournal of Information Security and Applications10.1016/j.jisa.2024.10374282(103742)Online publication date: May-2024
https://doi.org/10.1016/j.jisa.2024.103742
Li FMa JMiao YLiu XNing JDeng R(2023)A Survey on Searchable Symmetric EncryptionACM Computing Surveys10.1145/361799156:5(1-42)Online publication date: 27-Nov-2023
https://dl.acm.org/doi/10.1145/3617991
Wu HDüdder BWang LCao ZZhou JFeng X(2023)Survey on Secure Keyword Search over Outsourced Data: From Cloud to Blockchain-assisted ArchitectureACM Computing Surveys10.1145/361782456:3(1-40)Online publication date: 5-Oct-2023
https://dl.acm.org/doi/10.1145/3617824
Miao YYang YLi XChoo KMeng XDeng R(2023)Comprehensive Survey on Privacy-Preserving Spatial Data Query in Transportation SystemsIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2023.329579824:12(13603-13616)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1109/TITS.2023.3295798
Bauspieß PKolberg JDrozdowski PRathgeb CBusch C(2023)Privacy-Preserving Preselection for Protected Biometric Identification Using Public-Key Encryption With Keyword SearchIEEE Transactions on Industrial Informatics10.1109/TII.2022.319994419:5(6972-6981)Online publication date: May-2023
https://doi.org/10.1109/TII.2022.3199944
Wang WLiu DXu PYang LLiang K(2023)Keyword Search Shareable Encryption for Fast and Secure Data ReplicationIEEE Transactions on Information Forensics and Security10.1109/TIFS.2023.330694118(5537-5552)Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1109/TIFS.2023.3306941
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents