{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:40:59Z","timestamp":1771026059189,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T00:00:00Z","timestamp":1585526400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T00:00:00Z","timestamp":1585526400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10207-020-00492-w","type":"journal-article","created":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T20:03:51Z","timestamp":1585598631000},"page":"199-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Secure and efficient wildcard search over encrypted data"],"prefix":"10.1007","volume":"20","author":[{"given":"Sanjit","family":"Chatterjee","sequence":"first","affiliation":[]},{"given":"Manish","family":"Kesarwani","sequence":"additional","affiliation":[]},{"given":"Jayam","family":"Modi","sequence":"additional","affiliation":[]},{"given":"Sayantan","family":"Mukherjee","sequence":"additional","affiliation":[]},{"given":"Shravan Kumar","family":"Parshuram\u00a0Puria","sequence":"additional","affiliation":[]},{"given":"Akash","family":"Shah","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,30]]},"reference":[{"issue":"1","key":"492_CR1","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1146\/annurev.genom.2.1.401","volume":"2","author":"MR Anderlik","year":"2001","unstructured":"Anderlik, M.R., Rothstein, M.A.: Privacy and confidentiality of genetic information: what rules for the new science? Ann. Rev. Genom. Hum. Genet. 2(1), 401\u2013433 (2001)","journal-title":"Ann. Rev. Genom. Hum. Genet."},{"key":"492_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T., Keelveedhi, S., Rogaway, P.: Efficient garbling from a fixed-key blockcipher. In: IEEE Symposium on Security and Privacy, pp. 478\u2013492. IEEE Computer Society Press (2013)","DOI":"10.1109\/SP.2013.39"},{"issue":"7","key":"492_CR3","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"492_CR4","doi-asserted-by":"crossref","unstructured":"Boneh, D., Goh, E.J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: TCC. LNCS, vol. 3378, pp. 325\u2013341. Springer (2005)","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"492_CR5","doi-asserted-by":"crossref","unstructured":"B\u00f6sch, C., Brinkman, R., Hartel, P., Jonker, W.: Conjunctive wildcard search over encrypted data. In: SDM. LNCS, vol. 6933, pp. 114\u2013127. Springer (2011)","DOI":"10.1007\/978-3-642-23556-6_8"},{"key":"492_CR6","doi-asserted-by":"crossref","unstructured":"Cash, D., Jaeger, J., Jarecki, S., Jutla, C.S., Krawczyk, H., Rosu, M., Steiner, M.: Dynamic Searchable encryption in very-large databases: data structures and implementation. In: NDSS. The Internet Society (2014)","DOI":"10.14722\/ndss.2014.23264"},{"key":"492_CR7","doi-asserted-by":"crossref","unstructured":"Cash, D., Jarecki, S., Jutla, C., Krawczyk, H., Ro\u015fu, M.C., Steiner, M.: Highly-scalable searchable symmetric encryption with support for boolean queries. In: CRYPTO-I. LNCS, vol. 8042, pp. 353\u2013373. Springer (2013)","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"492_CR8","doi-asserted-by":"crossref","unstructured":"Chase, M., Kamara, S.: Structured encryption and controlled disclosure. In: ASIACRYPT. LNCS, vol. 6477, pp. 577\u2013594. Springer (2010)","DOI":"10.1007\/978-3-642-17373-8_33"},{"issue":"5","key":"492_CR9","doi-asserted-by":"publisher","first-page":"895","DOI":"10.3233\/JCS-2011-0426","volume":"19","author":"R Curtmola","year":"2011","unstructured":"Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. J. Comput. Secur. 19(5), 895\u2013934 (2011)","journal-title":"J. Comput. Secur."},{"key":"492_CR10","doi-asserted-by":"crossref","unstructured":"Demertzis, I., Papadopoulos, S., Papapetrou, O., Deligiannakis, A., Garofalakis, M.N.: Practical private range search revisited. In: SIGMOD, pp. 185\u2013198. ACM (2016)","DOI":"10.1145\/2882903.2882911"},{"key":"492_CR11","doi-asserted-by":"crossref","unstructured":"Faber, S., Jarecki, S., Krawczyk, H., Nguyen, Q., Rosu, M., Steiner, M.: Rich queries on encrypted data: beyond exact matches. In: ESORICS. LNCS, vol. 9327, pp. 123\u2013145. Springer (2015)","DOI":"10.1007\/978-3-319-24177-7_7"},{"key":"492_CR12","unstructured":"Fips, P.: 186-2. Digital signature standard (DSS). National Institute of Standards and Technology (NIST), vol. 20, p. 13 (2000)"},{"key":"492_CR13","doi-asserted-by":"crossref","unstructured":"Fisch, B.A., Vo, B., Krell, F., Kumarasubramanian, A., Kolesnikov, V., Malkin, T., Bellovin, S.M.: Malicious-client security in blind seer: a scalable private DBMS. In: IEEE Symposium on Security and Privacy, pp. 395\u2013410. IEEE Computer Society Press (2015)","DOI":"10.1109\/SP.2015.31"},{"key":"492_CR14","doi-asserted-by":"crossref","unstructured":"Gerbet, T., Kumar, A., Lauradoux, C.: The power of evil choices in bloom filters. In: IEEE\/IFIP International Conference on Dependable Systems and Networks. pp. 101\u2013112. IEEE Computer Society (2015)","DOI":"10.1109\/DSN.2015.21"},{"issue":"3","key":"492_CR15","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1006\/jcss.1999.1689","volume":"60","author":"Y Gertner","year":"2000","unstructured":"Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. J. Comput. Syst. Sci. 60(3), 592\u2013629 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"492_CR16","unstructured":"Goh, E.: Secure Indexes. IACR Cryptology ePrint Archive, vol. 2003, p. 216 (2003)"},{"key":"492_CR17","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"2000","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation, 2nd edn. Addison-Wesley, Boston (2000)","edition":"2"},{"issue":"5","key":"492_CR18","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10207-015-0302-0","volume":"15","author":"C Hu","year":"2016","unstructured":"Hu, C., Han, L.: Efficient wildcard search over encrypted data. IJIS 15(5), 539\u2013547 (2016)","journal-title":"IJIS"},{"key":"492_CR19","doi-asserted-by":"crossref","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: USENIX Security Symposium. USENIX Association (2011)","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"492_CR20","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: CRYPTO. LNCS, vol. 2729, pp. 145\u2013161. Springer (2003)","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"492_CR21","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Jutla, C.S., Krawczyk, H., Rosu, M., Steiner, M.: Outsourced symmetric private information retrieval. In: ACM CCS, pp. 875\u2013888. ACM Press (2013)","DOI":"10.1145\/2508859.2516730"},{"key":"492_CR22","doi-asserted-by":"crossref","unstructured":"Kamara, S., Moataz, T.: Boolean searchable symmetric encryption with worst-case sub-linear complexity. In: EUROCRYPT. LNCS, vol. 10212, pp. 94\u2013124. Springer (2017)","DOI":"10.1007\/978-3-319-56617-7_4"},{"key":"492_CR23","doi-asserted-by":"crossref","unstructured":"Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: ACM CCS, pp. 965\u2013976. ACM Press (2012)","DOI":"10.1145\/2382196.2382298"},{"key":"492_CR24","volume-title":"Introduction to Modern Cryptography (Chapman & Hall\/Crc Cryptography and Network Security Series)","author":"J Katz","year":"2007","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography (Chapman & Hall\/Crc Cryptography and Network Security Series). Chapman & Hall\/CRC, New York (2007)"},{"key":"492_CR25","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R.: Improved OT extension for transferring short secrets. In: CRYPTO. LNCS, vol. 8043, pp. 54\u201370. Springer (2013)","DOI":"10.1007\/978-3-642-40084-1_4"},{"key":"492_CR26","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: ACM CCS, pp. 818\u2013829. ACM Press (2016)","DOI":"10.1145\/2976749.2978381"},{"key":"492_CR27","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Rosulek, M., Trieu, N.: SWiM: Secure Wildcard Pattern Matching From OT Extension. IACR Cryptology ePrint Archive, vol. 2017, p. 1150 (2017)","DOI":"10.1007\/978-3-662-58387-6_12"},{"key":"492_CR28","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: SINGLE database, computationally-private information retrieval. In: FOCS, pp. 364\u2013373. IEEE Computer Society (1997)"},{"key":"492_CR29","doi-asserted-by":"crossref","unstructured":"Lai, S., Patranabis, S., Sakzad, A., Liu, J.K., Mukhopadhyay, D., Steinfeld, R., Sun, S., Liu, D., Zuo, C.: Result pattern hiding searchable encryption for conjunctive queries. In: CCS, pp. 745\u2013762. ACM (2018)","DOI":"10.1145\/3243734.3243753"},{"issue":"2","key":"492_CR30","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: A proof of security of Yao\u2019s protocol for two-party computation. J. Cryptol. 22(2), 161\u2013188 (2009)","journal-title":"J. Cryptol."},{"key":"492_CR31","doi-asserted-by":"crossref","unstructured":"Naor, D., Naor, M., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. In: CRYPTO, LNCS, vol. 2139, pp. 41\u201362. Springer (2001)","DOI":"10.1007\/3-540-44647-8_3"},{"key":"492_CR32","doi-asserted-by":"crossref","unstructured":"Pappas, V., Krell, F., Vo, B., Kolesnikov, V., Malkin, T., Choi, S.G., George, W., Keromytis, A.D., Bellovin, S.M.: Blind Seer: a scalable private DBMS. In: IEEE Symposium on Security and Privacy. pp. 359\u2013374. IEEE Computer Society Press (2014)","DOI":"10.1109\/SP.2014.30"},{"key":"492_CR33","unstructured":"Rabin, M.O.: How to Exchange Secrets with Oblivious Transfer. IACR Cryptology ePrint Archive, vol. 2005, p. 187 (2005)"},{"key":"492_CR34","unstructured":"Rindal, P.: libOTe: an efficient, portable, and easy to use Oblivious Transfer Library. https:\/\/github.com\/osu-crypto\/libOTe. Accessed 11 Dec 2019"},{"issue":"11","key":"492_CR35","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"492_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21936-3","volume-title":"Cryptography Made Simple. Information Security and Cryptography","author":"NP Smart","year":"2016","unstructured":"Smart, N.P.: Cryptography Made Simple. Information Security and Cryptography. Springer, New York (2016)"},{"key":"492_CR37","unstructured":"Song, D.X., Wagner, D.A., Perrig, A.: Practical techniques for searches on encrypted data. In: IEEE Symposium on Security and Privacy. pp. 44\u201355. IEEE Computer Society Press (2000)"},{"key":"492_CR38","doi-asserted-by":"crossref","unstructured":"Sun, S., Liu, J.K., Sakzad, A., Steinfeld, R., Yuen, T.H.: An efficient non-interactive multi-client searchable encryption with support for boolean queries. In: ESORICS. LNCS, vol. 9878, pp. 154\u2013172. Springer (2016)","DOI":"10.1007\/978-3-319-45744-4_8"},{"key":"492_CR39","unstructured":"The OpenSSL Project: OpenSSL Cryptography and SSL\/TLS Toolkit. https:\/\/www.openssl.org\/, Accessed 14 May 2018"},{"key":"492_CR40","doi-asserted-by":"crossref","unstructured":"Wei, L., Reiter, M.K.: Third-party private DFA evaluation on encrypted files in the cloud. In: ESORICS. LNCS, vol. 7459, pp. 523\u2013540. Springer (2012)","DOI":"10.1007\/978-3-642-33167-1_30"},{"issue":"5","key":"492_CR41","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10207-014-0268-3","volume":"14","author":"L Wei","year":"2015","unstructured":"Wei, L., Reiter, M.K.: Toward practical encrypted email that supports private, regular-expression searches. IJIS 14(5), 397\u2013416 (2015)","journal-title":"IJIS"},{"key":"492_CR42","unstructured":"WSJ: U.S. Terrorism Agency to Tap a Vast Database of Citizens. Wall Street Journal 12\/13\/12. http:\/\/alturl.com\/ot72x. Accessed 14 May 2018"},{"key":"492_CR43","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations (extended abstract). In: FOCS, pp. 160\u2013164. IEEE Computer Society (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"492_CR44","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167. IEEE Computer Society (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"492_CR45","unstructured":"Zahur, S., Evans, D.: Obliv-C: A language for extensible data-oblivious computation. IACR Cryptology ePrint Archive, vol. 2015, p. 1153 (2015)"},{"key":"492_CR46","doi-asserted-by":"crossref","unstructured":"Zahur, S., Rosulek, M., Evans, D.: Two halves make a whole\u2014reducing data transfer in garbled circuits using half gates. In: EUROCRYPT. LNCS, vol. 9057, pp. 220\u2013250. Springer (2015)","DOI":"10.1007\/978-3-662-46803-6_8"},{"key":"492_CR47","doi-asserted-by":"crossref","unstructured":"Zhao, F., Nishide, T.: Searchable symmetric encryption supporting queries with multiple-character wildcards. In: NSS. LNCS, vol. 9955, pp. 266\u2013282. Springer (2016)","DOI":"10.1007\/978-3-319-46298-1_18"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-020-00492-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-020-00492-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-020-00492-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T00:12:48Z","timestamp":1666224768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-020-00492-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,30]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["492"],"URL":"https:\/\/doi.org\/10.1007\/s10207-020-00492-w","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,30]]},"assertion":[{"value":"30 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}