{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:52:29Z","timestamp":1743025949572,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642331664"},{"type":"electronic","value":"9783642331671"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33167-1_30","type":"book-chapter","created":{"date-parts":[[2012,8,18]],"date-time":"2012-08-18T06:07:05Z","timestamp":1345270025000},"page":"523-540","source":"Crossref","is-referenced-by-count":9,"title":["Third-Party Private DFA Evaluation on Encrypted Files in the Cloud"],"prefix":"10.1007","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","reference":[{"key":"30_CR1","unstructured":"GenBank, \n                    \n                      http:\/\/www.ncbi.nlm.nih.gov\/genbank\/"},{"key":"30_CR2","unstructured":"United Kingdom National DNA Database, \n                    \n                      http:\/\/www.npia.police.uk\/en\/8934.htm"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: How to garble arithmetic circuits. In: 52nd IEEE Symposium on Foundations of Computer Science (2011)","DOI":"10.1109\/FOCS.2011.40"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among Notions of Security for Public-Key Encryption Schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, p. 26. Springer, Heidelberg (1998)"},{"key":"30_CR5","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 (2008)","DOI":"10.1145\/1455770.1455804"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Betel, D., Hogue, C.: Kangaroo \u2013 a pattern-matching program for biological sequences. BMC Bioinformatics 3 (2002)","DOI":"10.1186\/1471-2105-3-20"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-13739-6_4","volume-title":"Data and Applications Security and Privacy XXIV","author":"M. Blanton","year":"2010","unstructured":"Blanton, M., Aliasgari, M.: Secure Outsourcing of DNA Searching via Finite Automata. In: Foresti, S., Jajodia, S. (eds.) Data and Applications Security and Privacy XXIV. LNCS, vol.\u00a06166, pp. 49\u201364. Springer, Heidelberg (2010)"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Goh, E.J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 325\u2013341. Springer, Heidelberg (2005)"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-76900-2_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"S.G. Choi","year":"2007","unstructured":"Choi, S.G., Elbaz, A., Juels, A., Malkin, T., Yung, M.: Two-Party Computing with Encrypted Data. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 298\u2013314. Springer, Heidelberg (2007)"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A Generalisation, a Simplification and Some Applications of Paillier\u2019s Probabilistic Public-Key System. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992. Springer, Heidelberg (2001)"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M. Dijk van","year":"2010","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully Homomorphic Encryption over the Integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 24\u201343. Springer, Heidelberg (2010)"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-03007-9_6","volume-title":"Data and Applications Security XXIII","author":"K.B. Frikken","year":"2009","unstructured":"Frikken, K.B.: Practical Private DNA String Searching and Matching through Efficient Oblivious Automata Evaluation. In: Gudes, E., Vaidya, J. (eds.) Data and Applications Security XXIII. LNCS, vol.\u00a05645, pp. 81\u201394. Springer, Heidelberg (2009)"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-642-13013-7_20","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"R. Gennaro","year":"2010","unstructured":"Gennaro, R., Hazay, C., Sorensen, J.S.: Text Search Protocols with Simulation Based Security. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 332\u2013350. Springer, Heidelberg (2010)"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: 41st ACM Symposium on Theory of Computing (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-20465-4_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"C. Gentry","year":"2011","unstructured":"Gentry, C., Halevi, S.: Implementing Gentry\u2019s Fully-Homomorphic Encryption Scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 129\u2013148. Springer, Heidelberg (2011)"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-642-13190-5_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"C. Gentry","year":"2010","unstructured":"Gentry, C., Halevi, S., Vaikuntanathan, V.: A Simple BGN-Type Cryptosystem from LWE. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 506\u2013522. Springer, Heidelberg (2010)"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11523468_65","volume-title":"Automata, Languages and Programming","author":"C. Gentry","year":"2005","unstructured":"Gentry, C., Ramzan, Z.: Single-Database Private Information Retrieval with Constant Communication Rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 803\u2013815. Springer, Heidelberg (2005)"},{"key":"30_CR18","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 (1987)","DOI":"10.1145\/28395.28420"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. Journal of Cryptology\u00a023(3) (2010)","DOI":"10.1007\/s00145-008-9034-x"},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-17373-8_12","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"C. Hazay","year":"2010","unstructured":"Hazay, C., Toft, T.: Computationally Secure Pattern Matching in the Presence of Malicious Adversaries. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 195\u2013212. Springer, Heidelberg (2010)"},{"key":"30_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-540-70936-7_31","volume-title":"Theory of Cryptography","author":"Y. Ishai","year":"2007","unstructured":"Ishai, Y., Paskin, A.: Evaluating Branching Programs on Encrypted Data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 575\u2013594. Springer, Heidelberg (2007)"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"Jha, S., Kruger, L., Shmatikov, V.: Towards practical privacy for genomic computation. In: 29th IEEE Symposium on Security and Privacy (2008)","DOI":"10.1109\/SP.2008.34"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Katz, J., Malka, L.: Secure text processing with applications to private DNA matching. In: 17th ACM Conference on Computer and Communications Security (2010)","DOI":"10.1145\/1866307.1866361"},{"key":"30_CR24","unstructured":"Kojm, T.: ClamAV, \n                    \n                      http:\/\/www.clamav.net"},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"Lauter, K., Naehrig, M., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: 3rd ACM Workshop on Cloud Computing Security (October 2011)","DOI":"10.1145\/2046660.2046682"},{"key":"30_CR26","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay \u2013 a secure two-party computation system. In: 13th USENIX Security Symposium (August 2004)"},{"key":"30_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-642-27954-6_25","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"P. Mohassel","year":"2012","unstructured":"Mohassel, P., Niksefat, S., Sadeghian, S., Sadeghiyan, B.: An Efficient Protocol for Oblivious DFA Evaluation and Applications. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol.\u00a07178, pp. 398\u2013415. Springer, Heidelberg (2012)"},{"key":"30_CR28","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 223. Springer, Heidelberg (1999)"},{"key":"30_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-10366-7_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"B. Pinkas","year":"2009","unstructured":"Pinkas, B., Schneider, T., Smart, N., Williams, S.: Secure Two-Party Computation Is Practical. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 250\u2013267. Springer, Heidelberg (2009)"},{"key":"30_CR30","unstructured":"Rivest, R., Adleman, L., Dertouzos, M.: On data banks and privacy homomorphisms. Foundations of Secure Computation (1978)"},{"key":"30_CR31","unstructured":"Roesch, M.: Snort \u2013 lightweight intrusion detection for networks. In: 13th USENIX Conference on System Administration (1999)"},{"key":"30_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-13013-7_25","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"N.P. Smart","year":"2010","unstructured":"Smart, N.P., Vercauteren, F.: Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 420\u2013443. Springer, Heidelberg (2010)"},{"key":"30_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-17373-8_22","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"D. Stehl\u00e9","year":"2010","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Faster Fully Homomorphic Encryption. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 377\u2013394. Springer, Heidelberg (2010)"},{"key":"30_CR34","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 (2007)","DOI":"10.1145\/1315245.1315309"},{"key":"30_CR35","unstructured":"Wei, L., Reiter, M.K.: Third-party DFA evaluation on encrypted files. Tech. Rep. TR11-005, Department of Computer Science, University of North Carolina at Chapel Hill (2011)"},{"key":"30_CR36","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd IEEE Symposium on Foundations of Computer Science (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"30_CR37","doi-asserted-by":"crossref","unstructured":"Zhuge, J., Holz, T., Song, C., Guo, J., Han, X., Zou, W.: Studying malicious websites and the underground economy on the Chinese web. In: Workshop on the Economics of Information Security (June 2008)","DOI":"10.1007\/978-0-387-09762-6_11"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33167-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T20:43:38Z","timestamp":1559508218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33167-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331664","9783642331671"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33167-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}