{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:44:39Z","timestamp":1762004679371},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,11,22]],"date-time":"2014-11-22T00:00:00Z","timestamp":1416614400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10207-014-0268-3","type":"journal-article","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T11:58:30Z","timestamp":1417435110000},"page":"397-416","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Toward practical encrypted email that supports private, regular-expression searches"],"prefix":"10.1007","volume":"14","author":[{"given":"Lei","family":"Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael K.","family":"Reiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,22]]},"reference":[{"key":"268_CR1","doi-asserted-by":"crossref","unstructured":"Harvey, M., Elsweiler, D.: Exploring query patterns in email search. In: 34th European Conference on Advances in Information Retrieval, 2012, pp. 25\u201336","DOI":"10.1007\/978-3-642-28997-2_3"},{"key":"268_CR2","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"268_CR3","volume-title":"Regular Expressions Cookbook","author":"J Goyvaerts","year":"2012","unstructured":"Goyvaerts, J., Levithan, S.: Regular Expressions Cookbook, 2nd edn. O\u2019Reilly Media Inc., Sebastopol (2012)","edition":"2"},{"key":"268_CR4","unstructured":"Rivest, R., Adleman, L., Dertouzos, M.: On Data banks and Privacy Homomorphisms. Foundations of Secure Computation, pp. 169\u2013177. Academic Press, Inc (1978)"},{"key":"268_CR5","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd IEEE Symposium on Foundations of Computer Science, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"268_CR6","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: 19th ACM Symposium on Theory of Computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"268_CR7","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: 41st ACM Symposium on Theory of Computing, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"268_CR8","first-page":"24","volume":"2010","author":"M Dijk van","year":"2010","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. Adv. Cryptol. EUROCRYPT 2010, 24\u201343 (2010)","journal-title":"Adv. Cryptol. EUROCRYPT"},{"key":"268_CR9","doi-asserted-by":"crossref","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Public Key Cryptography\u2014PKC 2010, May 2010, pp. 420\u2013443","DOI":"10.1007\/978-3-642-13013-7_25"},{"key":"268_CR10","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Faster fully homomorphic encryption. In: Advances in Cryptology\u2014ASIACRYPT. Dec 2010, pp. 377\u2013394 (2010)","DOI":"10.1007\/978-3-642-17373-8_22"},{"key":"268_CR11","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay\u2014a secure two-party computation system. In: 13th USENIX Security Symposium, Aug 2004, pp. 287\u2013302"},{"key":"268_CR12","doi-asserted-by":"crossref","unstructured":"Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP: a system for secure multi-party computation. In: 15th ACM Conference on Computer and Communications Security, pp. 257\u2013266 (2008)","DOI":"10.1145\/1455770.1455804"},{"key":"268_CR13","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Schneider, T., Smart, N., Williams, S.: Secure two-party computation is practical. In: Advances in Cryptology\u2014ASIACRYPT. Dec 2009, pp. 250\u2013267 (2009)","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"268_CR14","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: 20th USENIX Security Symposium, pp. 35\u201335 (2011)"},{"key":"268_CR15","doi-asserted-by":"crossref","unstructured":"Wei, L., Reiter, M.K.: Third-party private DFA evaluation on encrypted files in the cloud. In: Computer Security\u2014ESORICS 2012: 17th European Symposium on Research in Computer Security (2012)","DOI":"10.1007\/978-3-642-33167-1_30"},{"key":"268_CR16","doi-asserted-by":"crossref","unstructured":"Blanton, M., Aliasgari, M.: Secure outsourcing of DNA searching via finite automata. In: Data and Applications Security and Privacy XXIV, June 2010, pp. 49\u201364","DOI":"10.1007\/978-3-642-13739-6_4"},{"key":"268_CR17","unstructured":"Song, D., Wagner, D., Perrig, A.: Practical techniques for searching on encrypted data. In: 2000 IEEE Symposium on Security and Privacy, May 2000, pp. 44\u201355"},{"key":"268_CR18","unstructured":"Goh, E.-J.: Secure indexes. Cryptology ePrint Archive, Report 2003\/216 (2003). http:\/\/eprint.iacr.org\/"},{"key":"268_CR19","doi-asserted-by":"crossref","unstructured":"Boneh, D., Crescenzo, G.D., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Advances in Cryptology\u2014EUROCRYPT 2004, ser. Lecture Notes in Computer Science, vol. 3027, pp. 506\u2013522 (2004)","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"268_CR20","doi-asserted-by":"crossref","unstructured":"Chang, Y.-C., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. In: Applied Cryptography and Network Security, 3rd International Conference, pp. 442\u2013455 (2005)","DOI":"10.1007\/11496137_30"},{"key":"268_CR21","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: 13th ACM Conference on Computer and Communications Security, pp. 79\u201388 (2006)","DOI":"10.1145\/1180405.1180417"},{"key":"268_CR22","doi-asserted-by":"crossref","unstructured":"Boneh, D., Waters, B.: Conjunctive, subset, and range queries on encrypted data. In: 4th Theory of Cryptography Conference, Feb 2007, pp. 535\u2013554","DOI":"10.1007\/978-3-540-70936-7_29"},{"key":"268_CR23","doi-asserted-by":"crossref","unstructured":"Katz, J., Sahai, A., Waters, B.: Predicate encryption supporting disjunctions, polynomial equations, and inner products. In: Advances in Cryptology\u2014EUROCRYPT, Apr 2008, pp. 146\u2013162 (2008)","DOI":"10.1007\/978-3-540-78967-3_9"},{"key":"268_CR24","doi-asserted-by":"crossref","unstructured":"Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: 19th ACM Conference on Computer and Communications Security, Oct 2012, pp. 965\u2013976","DOI":"10.1145\/2382196.2382298"},{"issue":"3","key":"268_CR25","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/s00145-007-9006-6","volume":"21","author":"M Abdalla","year":"2008","unstructured":"Abdalla, M., Bellare, M., Catalano, D., Kiltz, E., Kohno, T., Lange, T., Malone-Lee, J., Neven, G., Paillier, P., Shi, H.: Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions. J. Cryptol. 21(3), 350\u2013391 (2008)","journal-title":"J. Cryptol."},{"key":"268_CR26","doi-asserted-by":"crossref","unstructured":"Baek, J., Safavi-Naini, R., Susilo, W.: Public key encryption with keyword search revisited. In: Computational Science and Its Applications\u2014ICCSA 2008, ser. Lecture Notes in Computer Science, vol. 5072, pp. 1249\u20131259 (2008)","DOI":"10.1007\/978-3-540-69839-5_96"},{"key":"268_CR27","doi-asserted-by":"crossref","unstructured":"Rhee, H.S., Park, J.H., Susilo, W., Lee, D.H.: Improved searchable public key encryption with designated tester. In: 4th ACM Conference on Information, Computer, and Communications Security, March 2009, pp. 376\u2013379","DOI":"10.1145\/1533057.1533108"},{"key":"268_CR28","doi-asserted-by":"crossref","unstructured":"Troncoso-Pastoriza, J.R., Katzenbeisser, S., Celik, M.: Privacy preserving error resilient DNA searching through oblivious automata. In: 14th ACM Conference on Computer and Communications Security, pp. 519\u2013528 (2007)","DOI":"10.1145\/1315245.1315309"},{"key":"268_CR29","doi-asserted-by":"crossref","unstructured":"Frikken, K.B.: Practical private DNA string searching and matching through efficient oblivious automata evaluation. In: Data and Applications Security XXIII, July 2009, pp. 81\u201394","DOI":"10.1007\/978-3-642-03007-9_6"},{"key":"268_CR30","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Hazay, C., Sorensen, J.S.: Text search protocols with simulation based security. In: Public Key Cryptography\u2014PKC 2010, pp. 332\u2013350 (2010)","DOI":"10.1007\/978-3-642-13013-7_20"},{"key":"268_CR31","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Niksefat, S., Sadeghian, S., Sadeghiyan, B.: An efficient protocol for oblivious DFA evaluation and applications. In: Topics in Cryptology\u2014CT-RSA 2012, pp. 398\u2013415 (2012)","DOI":"10.1007\/978-3-642-27954-6_25"},{"key":"268_CR32","doi-asserted-by":"crossref","unstructured":"Choi, S.G., Elbaz, A., Juels, A., Malkin, T., Yung, M.: Two-party computing with encrypted data. In: Advances in Crypotology\u2014ASIACRYPT 2007, pp. 298\u2013314 (2007)","DOI":"10.1007\/978-3-540-76900-2_18"},{"key":"268_CR33","doi-asserted-by":"crossref","unstructured":"Waters, B.: Functional encryption for regular languages. In: Advances in Cryptology\u2014CRYPTO 2012, pp. 218\u2013235 (2012)","DOI":"10.1007\/978-3-642-32009-5_14"},{"key":"268_CR34","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Advances in Cryptology\u2014EUROCRYPT \u201999, May 1999, pp. 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"268_CR35","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system. In: Public Key Cryptography, 4th International Workshop on Practice and Theory in Public Key Cryptosystems, Feb 2001, pp. 119\u2013136","DOI":"10.1007\/3-540-44586-2_9"},{"key":"268_CR36","doi-asserted-by":"crossref","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: 2nd Theory of Cryptography Conference, pp. 325\u2013342 (2005)","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"268_CR37","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Vaikuntanathan, V.: A simple BGN-type cryptosystem from LWE. In: Advances in Cryptology\u2014EUROCRYPT 2010, May 2010, pp. 506\u2013522","DOI":"10.1007\/978-3-642-13190-5_26"},{"key":"268_CR38","unstructured":"Boneh, D.: Personal communication, July 2011"},{"key":"268_CR39","unstructured":"Menezes, A.J., Oorschot, P.C.V., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)"},{"key":"268_CR40","doi-asserted-by":"crossref","unstructured":"Baign\u00e8res, T., Vaudenay, S.: The complexity of distinguishing distributions (invited talk). In: Information Theoretic Security, 3rd International Conference, pp. 210\u2013222 (2008)","DOI":"10.1007\/978-3-540-85093-9_20"},{"key":"268_CR41","unstructured":"Wei, L., Reiter, M.K.: Third-party DFA evaluation on encrypted files. Department of Computer Science, UNC Chapel Hill, Technical report TR11-005 (2011)"},{"key":"268_CR42","unstructured":"Lynn, B.: The pairing based cryptography library (2006). http:\/\/crypto.stanford.edu\/pbc\/"},{"key":"268_CR43","doi-asserted-by":"crossref","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Advances in Cryptology\u2014CRYPTO \u201998, Aug 1998, pp. 26\u201345","DOI":"10.1007\/BFb0055718"},{"key":"268_CR44","unstructured":"Caro, A.D.: Java pairing based cryptography library (2012). http:\/\/gas.dia.unisa.it\/projects\/jpbc\/"},{"key":"268_CR45","unstructured":"Moller, A.: dk.brics.automaton (2011). http:\/\/www.brics.dk\/automaton\/"},{"key":"268_CR46","unstructured":"Enron email dataset (2009). http:\/\/www.cs.cmu.edu\/~enron\/"},{"key":"268_CR47","unstructured":"Mozilla Thunderbird (2005). https:\/\/www.mozilla.org\/en-US\/thunderbird\/"},{"key":"268_CR48","unstructured":"The GNU privacy guard (1998). http:\/\/www.gnupg.org\/"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-014-0268-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-014-0268-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-014-0268-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T00:16:55Z","timestamp":1566087415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-014-0268-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,22]]},"references-count":48,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["268"],"URL":"https:\/\/doi.org\/10.1007\/s10207-014-0268-3","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,22]]}}}