{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T21:05:11Z","timestamp":1773003911187,"version":"3.50.1"},"reference-count":153,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2014,8,25]],"date-time":"2014-08-25T00:00:00Z","timestamp":1408924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2015,1,8]]},"abstract":"<jats:p>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&amp;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.<\/jats:p><jats:p>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.<\/jats:p><jats:p>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.<\/jats:p>","DOI":"10.1145\/2636328","type":"journal-article","created":{"date-parts":[[2014,8,26]],"date-time":"2014-08-26T12:08:55Z","timestamp":1409054935000},"page":"1-51","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":218,"title":["A Survey of Provably Secure Searchable Encryption"],"prefix":"10.1145","volume":"47","author":[{"given":"Christoph","family":"B\u00f6sch","sequence":"first","affiliation":[{"name":"University of Twente, The Netherlands"}]},{"given":"Pieter","family":"Hartel","sequence":"additional","affiliation":[{"name":"University of Twente, The Netherlands"}]},{"given":"Willem","family":"Jonker","sequence":"additional","affiliation":[{"name":"University of Twente, The Netherlands"}]},{"given":"Andreas","family":"Peter","sequence":"additional","affiliation":[{"name":"University of Twente, The Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2014,8,25]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9006-6"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_8"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10772-6_8"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007632"},{"key":"e_1_2_1_5_1","volume-title":"DBSec (LNCS)","author":"Amanatidis Georgios"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11836810_16"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69839-5_96"},{"key":"e_1_2_1_8_1","first-page":"417","article-title":"Correlation-Resistant storage via keyword-searchable encryption","volume":"2005","author":"Ballard Lucas","year":"2005","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602897_35"},{"key":"e_1_2_1_10_1","volume-title":"ISPEC (LNCS)","author":"Bao Feng"},{"key":"e_1_2_1_11_1","volume-title":"EUROCRYPT (LNCS)","author":"Bari Niko"},{"key":"e_1_2_1_12_1","volume-title":"ICALP (LNCS)","author":"Baudron Olivier"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907471"},{"key":"e_1_2_1_14_1","volume-title":"EUROCRYPT (LNCS)","author":"Bellare Mihir"},{"key":"e_1_2_1_15_1","volume-title":"CRYPTO (LNCS)","author":"Bellare Mihir"},{"key":"e_1_2_1_16_1","volume-title":"PKC (LNCS)","author":"Bellare Mihir"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"e_1_2_1_18_1","volume-title":"EUROCRYPT (LNCS)","author":"Bellare Mihir"},{"key":"e_1_2_1_19_1","first-page":"22","article-title":"Privacy-enhanced searches using encrypted bloom filters","volume":"2004","author":"Bellovin Steven M.","year":"2004","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_2_1_20_1","first-page":"274","article-title":"One-Way accumulators: A decentralized alternative to digital sinatures (extended abstract)","volume":"765","author":"Benaloh Josh Cohen","year":"1993","journal-title":"EUROCRYPT (LNCS)"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2006.27"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455526.1455529"},{"key":"e_1_2_1_23_1","volume-title":"EUROCRYPT (LNCS)","author":"Blaze Matt"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10433-6_17"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_13"},{"key":"e_1_2_1_27_1","volume-title":"CRYPTO (LNCS)","author":"Boldyreva Alexandra"},{"key":"e_1_2_1_28_1","volume-title":"ANTS (LNCS)","author":"Boneh Dan"},{"key":"e_1_2_1_29_1","volume-title":"EUROCRYPT (LNCS)","author":"Boneh Dan"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_26"},{"key":"e_1_2_1_31_1","volume-title":"CRYPTO (LNCS)","author":"Boneh Dan"},{"key":"e_1_2_1_32_1","first-page":"506","article-title":"Public key encryption with keyword search","volume":"3027","author":"Boneh Dan","year":"2004","journal-title":"EUROCRYPT (LNCS)"},{"key":"e_1_2_1_33_1","volume-title":"CRYPTO (LNCS)","volume":"2139","author":"Boneh Dan"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398521"},{"key":"e_1_2_1_35_1","volume-title":"EUROCRYPT (LNCS)","author":"Boneh Dan"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"e_1_2_1_37_1","volume-title":"CRYPTO (LNCS)","volume":"4622","author":"Boneh Dan"},{"key":"e_1_2_1_38_1","volume-title":"ASIACRYPT (LNCS)","author":"Boneh Dan"},{"key":"e_1_2_1_39_1","volume-title":"TCC (LNCS)","author":"Boneh Dan"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33383-5_14"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_17"},{"key":"e_1_2_1_42_1","first-page":"505","article-title":"Fully homomorphic encryption from ring-LWE and security for key dependent messages","volume":"6841","author":"Brakerski Zvika","year":"2011","journal-title":"CRYPTO (LNCS)"},{"key":"e_1_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Julien Bringer Herv\u00e9 Chabanne and Bruno Kindarji. 2009. Error-Tolerant searchable encryption. In ICC. 1--6. Julien Bringer Herv\u00e9 Chabanne and Bruno Kindarji. 2009. Error-Tolerant searchable encryption. In ICC. 1--6.","DOI":"10.1109\/ICC.2009.5199004"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1201\/1086\/44530.13.3.20040701\/83065.3"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/11774716_15"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/11844662_6"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_18"},{"key":"e_1_2_1_48_1","volume-title":"CRYPTO (LNCS)","author":"Camenisch Jan"},{"key":"e_1_2_1_49_1","volume-title":"EUROCRYPT (LNCS)","author":"Canetti Ran"},{"key":"e_1_2_1_50_1","first-page":"546","article-title":"Hidden vector encryption fully secure against unrestricted queries","volume":"2011","author":"Caro Angelo De","year":"2011","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_30"},{"key":"e_1_2_1_53_1","volume-title":"ASIACRYPT (LNCS)","author":"Chase Melissa"},{"key":"e_1_2_1_54_1","first-page":"480","article-title":"On cryptographic protocols employing asymmetric pairings - The role of psi revisited","volume":"2009","author":"Chatterjee Sanjit","year":"2009","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_2_1_55_1","doi-asserted-by":"crossref","unstructured":"David Chaum. 1982. Blind signatures for untraceable payments. In CRYPTO. Plenum Press New York 199--203. David Chaum. 1982. Blind signatures for untraceable payments. In CRYPTO. Plenum Press New York 199--203.","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/11586821_29"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796270"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.5555\/647995.742435"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/357830.357847"},{"key":"e_1_2_1_60_1","volume-title":"INDOCRYPT (LNCS)","author":"Crescenzo Giovanni Di"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70567-3_10"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"e_1_2_1_65_1","volume-title":"CRYPTO (LNCS)","author":"Fiat Amos"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"e_1_2_1_67_1","volume-title":"CRYPTO (LNCS)","author":"Fujisaki Eiichiro"},{"key":"e_1_2_1_68_1","volume-title":"CRYPTO (LNCS)","author":"Fujisaki Eiichiro"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_27"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/1666420.1666444"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_26"},{"key":"e_1_2_1_73_1","volume-title":"ASIACRYPT (LNCS)","author":"Gentry Craig"},{"key":"e_1_2_1_75_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich. 2004. The Foundations of Cryptography - Volume 2 Basic Applications. Cambridge University Press. Oded Goldreich. 2004. The Foundations of Cryptography - Volume 2 Basic Applications. Cambridge University Press.","DOI":"10.1017\/CBO9780511721656"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802212"},{"key":"e_1_2_1_78_1","first-page":"31","article-title":"Secure conjunctive keyword search over encrypted data","volume":"3089","author":"Golle Philippe","year":"2004","journal-title":"ACNS. LNCS"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25516-8_12"},{"key":"e_1_2_1_80_1","volume-title":"CT-RSA (LNCS)","author":"Heng Swee-Huay"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.1.39"},{"key":"e_1_2_1_82_1","volume-title":"EUROCRYPT (LNCS)","author":"Horwitz Jeremy"},{"key":"e_1_2_1_83_1","volume-title":"Pairing (LNCS)","author":"Hwang Yong Ho"},{"key":"e_1_2_1_84_1","first-page":"532","article-title":"Public-key encryption with delegated search","volume":"6715","author":"Ibraimi Luan","year":"2011","journal-title":"ACNS (LNCS)"},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85538-5_5"},{"key":"e_1_2_1_86_1","volume-title":"ANTS (LNCS)","author":"Joux Antoine"},{"key":"e_1_2_1_87_1","doi-asserted-by":"crossref","unstructured":"Seny Kamara and Charalampos Papamanthou. 2013. Parallel and dynamic searchable symmetric encryption. In FC. Seny Kamara and Charalampos Papamanthou. 2013. Parallel and dynamic searchable symmetric encryption. In FC.","DOI":"10.1007\/978-3-642-39884-1_22"},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382298"},{"key":"e_1_2_1_89_1","first-page":"146","article-title":"Predicate encryption supporting disjunctions, polynomial equations, and inner products","volume":"4965","author":"Katz Jonathan","year":"2008","journal-title":"EUROCRYPT (LNCS)"},{"key":"e_1_2_1_90_1","volume-title":"ICCSA (LNCS)","author":"Khader Dalia"},{"key":"e_1_2_1_91_1","volume-title":"ASIACRYPT (LNCS)","author":"Kiayias Aggelos"},{"key":"e_1_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1007\/11780656_28"},{"key":"e_1_2_1_94_1","volume-title":"PKC (LNCS)","author":"Kurosawa Kaoru"},{"key":"e_1_2_1_95_1","volume-title":"CRYPTO (LNCS)","author":"Kurosawa Kaoru"},{"key":"e_1_2_1_96_1","volume-title":"FC (LNCS)","author":"Kurosawa Kaoru"},{"key":"e_1_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.23"},{"key":"e_1_2_1_98_1","first-page":"968","article-title":"New techniques for anonymous HIBE with short ciphertexts in prime order groups","volume":"4","author":"Lee Kwangsu","year":"2010","journal-title":"TIIS"},{"key":"e_1_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-010-9412-x"},{"key":"e_1_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_4"},{"key":"e_1_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.5555\/1833515.1833604"},{"key":"e_1_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSE.2009.66"},{"key":"e_1_2_1_103_1","unstructured":"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. 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."},{"key":"e_1_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046660.2046682"},{"key":"e_1_2_1_105_1","first-page":"111","article-title":"Attribute-based encryption with partially hidden encryptor-specified access structures","volume":"5037","author":"Nishide Takashi","year":"2008","journal-title":"ACNS (LNCS)"},{"key":"e_1_2_1_106_1","doi-asserted-by":"crossref","unstructured":"Takashi Nishide Kazuki Yoneyama and Kazuo Ohta. 2009. Attribute-based encryption with partially hidden ciphertext policies. IEICE Transactions 92-A 1 (2009) 22--32. Takashi Nishide Kazuki Yoneyama and Kazuo Ohta. 2009. Attribute-based encryption with partially hidden ciphertext policies. IEICE Transactions 92-A 1 (2009) 22--32.","DOI":"10.1587\/transfun.E92.A.22"},{"key":"e_1_2_1_107_1","first-page":"83","article-title":"Fast accumulated hashing","volume":"1039","author":"Nyberg Kaisa","year":"1996","journal-title":"FSE (LNCS)"},{"key":"e_1_2_1_108_1","volume-title":"PKC (LNCS)","author":"Okamoto Tatsuaki"},{"key":"e_1_2_1_109_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_13"},{"key":"e_1_2_1_110_1","first-page":"191","article-title":"Fully secure functional encryption with general relations from the decisional linear assumption","volume":"6223","author":"Okamoto Tatsuaki","year":"2010","journal-title":"CRYPTO (LNCS)"},{"key":"e_1_2_1_111_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_35"},{"key":"e_1_2_1_112_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100289"},{"key":"e_1_2_1_113_1","unstructured":"Rafail Ostrovsky. 1992. Software Protection and Simulations on Oblivious RAMs. Ph.D. Dissertation. MIT. Rafail Ostrovsky. 1992. Software Protection and Simulations on Oblivious RAMs. Ph.D. Dissertation. MIT."},{"key":"e_1_2_1_114_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_14"},{"key":"e_1_2_1_115_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-0565-3"},{"key":"e_1_2_1_116_1","volume-title":"EUROCRYPT (LNCS)","author":"Paillier Pascal"},{"key":"e_1_2_1_117_1","first-page":"367","article-title":"Searchable keyword-based encryption","volume":"2005","author":"Park Dong Jin","year":"2005","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_2_1_118_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31815-6_7"},{"key":"e_1_2_1_119_1","doi-asserted-by":"publisher","DOI":"10.1109\/GRC.2007.140"},{"key":"e_1_2_1_120_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-010-9405-9"},{"key":"e_1_2_1_121_1","doi-asserted-by":"crossref","unstructured":"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. 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.","DOI":"10.1587\/transfun.E93.A.1620"},{"key":"e_1_2_1_122_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043566"},{"key":"e_1_2_1_123_1","doi-asserted-by":"publisher","DOI":"10.1145\/1655008.1655025"},{"key":"e_1_2_1_124_1","doi-asserted-by":"publisher","DOI":"10.1145\/1533057.1533108"},{"key":"e_1_2_1_125_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2009.11.726"},{"key":"e_1_2_1_126_1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"e_1_2_1_127_1","doi-asserted-by":"publisher","DOI":"10.1109\/AINAW.2007.166"},{"key":"e_1_2_1_128_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_27"},{"key":"e_1_2_1_129_1","first-page":"164","article-title":"Authenticated ID-based Key Exchange and remote log-in with simple token and PIN number","volume":"2002","author":"Scott Mike","year":"2002","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_2_1_130_1","volume-title":"SCN (LNCS)","author":"Sedghi Saeed"},{"key":"e_1_2_1_131_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_2_1_132_1","volume-title":"CRYPTO (LNCS)","author":"Shamir Adi"},{"key":"e_1_2_1_133_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_27"},{"key":"e_1_2_1_134_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2007.29"},{"key":"e_1_2_1_135_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_46"},{"key":"e_1_2_1_136_1","unstructured":"V. Shoup. 2004. ISO 18033-2: An Emerging Standard for Public-Key Encryption (committee draft). Available at http:\/\/shoup.net\/iso\/. V. Shoup. 2004. ISO 18033-2: An Emerging Standard for Public-Key Encryption (committee draft). Available at http:\/\/shoup.net\/iso\/."},{"key":"e_1_2_1_137_1","volume-title":"IEEE Symposium on Security and Privacy. IEEE Computer Society","author":"Song Dawn Xiaodong","year":"2000"},{"key":"e_1_2_1_138_1","volume-title":"ACISP (LNCS)","author":"Tang Qiang"},{"key":"e_1_2_1_139_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJACT.2012.048079"},{"key":"e_1_2_1_140_1","doi-asserted-by":"publisher","DOI":"10.1002\/sec.418"},{"key":"e_1_2_1_141_1","volume-title":"EuroPKI (LNCS)","author":"Tang Qiang"},{"key":"e_1_2_1_142_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"e_1_2_1_143_1","volume-title":"SDM (LNCS)","author":"van Liesdonk Peter"},{"key":"e_1_2_1_144_1","volume-title":"ICICS (LNCS)","author":"Wang Peishun"},{"key":"e_1_2_1_145_1","volume-title":"SDM (LNCS)","author":"Wang Peishun"},{"key":"e_1_2_1_146_1","volume-title":"WISA (LNCS)","author":"Wang Peishun"},{"key":"e_1_2_1_147_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89641-8_13"},{"key":"e_1_2_1_148_1","volume-title":"SOFSEM (LNCS)","author":"Wang Peishun"},{"key":"e_1_2_1_149_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11925-5_9"},{"key":"e_1_2_1_150_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJACT.2009.028029"},{"key":"e_1_2_1_151_1","doi-asserted-by":"publisher","DOI":"10.1109\/CloudCom.2011.43"},{"key":"e_1_2_1_152_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"},{"key":"e_1_2_1_153_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69295-9_10"},{"key":"e_1_2_1_154_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27890-7_7"},{"key":"e_1_2_1_155_1","doi-asserted-by":"crossref","unstructured":"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. 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.","DOI":"10.1587\/transinf.E92.D.888"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2636328","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2636328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:34Z","timestamp":1750277674000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2636328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,25]]},"references-count":153,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,1,8]]}},"alternative-id":["10.1145\/2636328"],"URL":"https:\/\/doi.org\/10.1145\/2636328","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,25]]},"assertion":[{"value":"2012-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-08-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}