{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:54:31Z","timestamp":1762505671081,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137389"},{"type":"electronic","value":"9783642137396"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13739-6_4","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T11:23:50Z","timestamp":1282649030000},"page":"49-64","source":"Crossref","is-referenced-by-count":35,"title":["Secure Outsourcing of DNA Searching via Finite Automata"],"prefix":"10.1007","author":[{"given":"Marina","family":"Blanton","sequence":"first","affiliation":[]},{"given":"Mehrdad","family":"Aliasgari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Atallah, M., Kerschbaum, F., Du, W.: Secure and private sequence comparisons. In: WPES, pp. 39\u201344 (2003)","DOI":"10.1145\/1005140.1005147"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Jha, S., Kruger, L., Shmatikov, V.: Towards practical privacy for genomic computation. In: IEEE Symposium on Security and Privacy, pp. 216\u2013230 (2008)","DOI":"10.1109\/SP.2008.34"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Troncoso-Pastoriza, J., Katzenbeisser, S., Celik, M.: Privacy preserving error resilient DNA searching through oblivious automata. In: ACM CCS, pp. 519\u2013528 (2007)","DOI":"10.1145\/1315245.1315309"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Frikken, K.: Practical private DNA string searching and matching through efficient oblivious automata evaluation. In: DBSec, pp. 81\u201394 (2009)","DOI":"10.1007\/978-3-642-03007-9_6"},{"key":"4_CR5","unstructured":"Bruekers, F., Katzenbeisser, S., Kursawe, K., Tuyls, P.: Privacy-preserving matching of DNA profiles. ePrint Cryptology Archive Report 2008\/203 (2008)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Wang, R., Wang, X., Li, Z., Tang, H., Reiter, M., Dong, Z.: Privacy-preserving genomic computation through program specialization. In: ACM CCS, pp. 338\u2013347 (2009)","DOI":"10.1145\/1653662.1653703"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Atallah, M., Li, J.: Secure outsourcing of sequence comparisons. In: PET, pp. 63\u201378 (2004)","DOI":"10.1007\/11423409_5"},{"issue":"4","key":"4_CR8","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10207-005-0070-3","volume":"4","author":"M. Atallah","year":"2005","unstructured":"Atallah, M., Li, J.: Secure outsourcing of sequence comparisons. International Journal of Information Security\u00a04(4), 277\u2013287 (2005)","journal-title":"International Journal of Information Security"},{"key":"4_CR9","unstructured":"Genetic Testing for Health, Disease & Ancestry; DNA Test \u2013 23andMe, http:\/\/www.23andme.com"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Blanton, M., Aliasgari, M.: Secure outsourcing of DNA searching via finite automata. Technical Report 2010\u201303, University of Notre Dame (2010)","DOI":"10.1007\/978-3-642-13739-6_4"},{"key":"4_CR11","unstructured":"Szajda, D., Pohl, M., Owen, J., Lawson, B.: Toward a practical data privacy scheme for a distributed implementation of the Smith-Waterman genome sequence comparison algorithm. In: NDSS (2006)"},{"issue":"5","key":"4_CR12","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1109\/TITB.2007.908465","volume":"12","author":"M. Kantarcioglu","year":"2008","unstructured":"Kantarcioglu, M., Jiang, W., Liu, Y., Malin, B.: A cryptographic approach to securely share and query genomic sequences. IEEE Transactions on Information Technology in Biomedicine\u00a012(5), 606\u2013617 (2008)","journal-title":"IEEE Transactions on Information Technology in Biomedicine"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Franklin, M., Gondree, M., Mohassel, P.: Communication-efficient private protocols for longest common subsequence. In: RSA, pp. 265\u2013278 (2009)","DOI":"10.1007\/978-3-642-00862-7_18"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Gondree, M., Mohassel, P.: Longest common subsequence as private search. In: WPES, pp. 81\u201390 (2009)","DOI":"10.1145\/1655188.1655200"},{"key":"4_CR15","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA, pp. 448\u2013457 (2001)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/11556992_23","volume-title":"Information Security","author":"H. Lipmaa","year":"2005","unstructured":"Lipmaa, H.: An oblivious transfer protocol with log-squared communication. In: Zhou, J., L\u00f3pez, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol.\u00a03650, pp. 314\u2013328. Springer, Heidelberg (2005)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate. In: ICALP, pp. 803\u2013815 (2005)","DOI":"10.1007\/11523468_65"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: STOC (1999)","DOI":"10.1145\/301250.301312"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-45539-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"G. Crescenzo","year":"2000","unstructured":"Crescenzo, G., Malkin, T., Ostrovsky, R.: Single database private information retrieval implies oblivious transfer. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 122\u2013138. Springer, Heidelberg (2000)"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"C. Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 402\u2013414. Springer, Heidelberg (1999)"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: Single database, computationally-private information retrieval. In: IEEE FOCS, pp. 364\u2013373 (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Melchor, C.A., Deswarte, Y.: Single-database private information retrieval schemes: Overview, performance study, and usage with statistical databases. In: Privacy in Statistical Databases, pp. 257\u2013265 (2006)","DOI":"10.1007\/11930242_22"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Aguilar-Melchor, C., Gaborit, P.: A lattice-based computationally-efficient private information retrieval protocol. In: WEWORC (2007)","DOI":"10.1109\/ISIT.2008.4595308"},{"key":"4_CR24","unstructured":"Damgard, I., Jurik, M.: A length-flexible threshold cryptosystem with applications. In: Australasian Conference on Information Security and Privacy (2007)"},{"key":"4_CR25","unstructured":"Bae, H.: Design and analysis for log-squared and log private information retrieval (2008)"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Melchor, C., Crespin, B., Gaborit, P., Jolivet, V.: High-speed private information retrieval computation on GPU. In: IEEE SECURWARE (2008)","DOI":"10.1109\/SECURWARE.2008.55"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"4_CR28","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security and Privacy XXIV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13739-6_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T23:58:57Z","timestamp":1740441537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13739-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137389","9783642137396"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13739-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}