{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:10:50Z","timestamp":1725531050418},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642008610"},{"type":"electronic","value":"9783642008627"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00862-7_18","type":"book-chapter","created":{"date-parts":[[2009,4,28]],"date-time":"2009-04-28T13:31:05Z","timestamp":1240925465000},"page":"265-278","source":"Crossref","is-referenced-by-count":6,"title":["Communication-Efficient Private Protocols for Longest Common Subsequence"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Franklin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Gondree","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Payman","family":"Mohassel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Are guarantees of genome anonymity realistic (2008), http:\/\/arep.med.harvard.edu\/PGP\/Anon.htm"},{"key":"18_CR2","unstructured":"CODIS: Combined DNA index system (2008), http:\/\/www.fbi.gov\/hq\/lab\/html\/codis1.htm"},{"key":"18_CR3","unstructured":"deCODE genetics (2008), http:\/\/www.decodegenetics.com\/"},{"key":"18_CR4","unstructured":"The genomic privacy project (2008), http:\/\/privacy.cs.cmu.edu\/dataprivacy\/projects\/genetic\/"},{"key":"18_CR5","unstructured":"HapMap: International HapMap project (2008), http:\/\/www.hapmap.org\/ ."},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321921.321922","volume":"23","author":"A. Aho","year":"1976","unstructured":"Aho, A., Hirschberg, D., Ullman, J.: Bounds on the complexity of the longest common subsequence problem. J. of the ACM\u00a023(1), 1\u201312 (1976)","journal-title":"J. of the ACM"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44987-6_8","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"B. Aiello","year":"2001","unstructured":"Aiello, B., Ishai, Y., Reingold, O.: Priced oblivious transfer: How to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 119\u2013135. Springer, Heidelberg (2001)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1146\/annurev.pharmtox.42.082401.140850","volume":"42","author":"R. Altman","year":"2002","unstructured":"Altman, R., Klein, T.: Challenges for biomedical informatics and pharmacogenenomics. Annu. Rev. of Pharmacology and Toxicology\u00a042, 113\u2013133 (2002)","journal-title":"Annu. Rev. of Pharmacology and Toxicology"},{"key":"18_CR9","first-page":"487","volume":"194","author":"V.L. Arlazarov","year":"1970","unstructured":"Arlazarov, V.L., Dinic, E.A., Kronod, M.A., Faradzev, I.A.: On economic consruction of the transitive closure of a directed graph. Doklady Akademii Nauk SSSR\u00a0194, 487\u2013488 (1970)","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Atallah, M.J., Kerschbaum, F., Du. Secure, W.: private sequence comparisons. In: Proc. of WPES, pp. 39\u201344 (2003)","DOI":"10.1145\/1005140.1005147"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/11593447_13","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"J. Brickell","year":"2005","unstructured":"Brickell, J., Shmatikov, V.: Privacy-preserving graph algorithms in the semi-honest model. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 236\u2013252. Springer, Heidelberg (2005)"},{"key":"18_CR12","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. J. of Cryptology\u00a013, 143\u2013202 (2000)","journal-title":"J. of Cryptology"},{"issue":"6","key":"18_CR13","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B. Chor","year":"1998","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. of the ACM\u00a045(6), 965\u2013981 (1998)","journal-title":"J. of the ACM"},{"key":"18_CR14","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2000","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (2000)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","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, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Jurik, M.: A length-flexible threshold cryptosystem with applications. In: Information Security and Privacy, pp. 350\u2013364 (2003)","DOI":"10.1007\/3-540-45067-X_30"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-540-76900-2_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"M.K. Franklin","year":"2007","unstructured":"Franklin, M.K., Gondree, M., Mohassel, P.: Multi-party indirect indexing and applications. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 283\u2013297. Springer, Heidelberg (2007)"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Franklin, M., Gondree, M., Mohassel, P.: Communication-efficient private protocols for longest common subsequence. Cryptology ePrint Archive, Report 2009\/019 (2009), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-00862-7_18"},{"key":"18_CR19","unstructured":"Fraser, C.: Subsequences and supersequences of strings. PhD thesis, University of Glasgow (1995)"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M.J. Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"18_CR21","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":"18_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography. Cambridge University Press, Cambridge (2001)"},{"key":"18_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-540-73420-8_23","volume-title":"Automata, Languages and Programming","author":"Y. Ishai","year":"2007","unstructured":"Ishai, Y., Malkin, T.G., Strauss, M.J., Wright, R.N.: Private multiparty sampling and approximation of vector combinations. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 243\u2013254. Springer, Heidelberg (2007)"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Jha, S., Kruger, L., Shmatikov, V.: Towards practical privacy for genomic computation. In: IEEE Symposium on Security and Privacy (2008)","DOI":"10.1109\/SP.2008.34"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-70936-7_16","volume-title":"Theory of Cryptography","author":"E. Kiltz","year":"2007","unstructured":"Kiltz, E., Mohassel, P., Weinreb, E., Franklin, M.K.: Secure linear algebra using linearly recurrent sequences. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 291\u2013310. Springer, Heidelberg (2007)"},{"key":"18_CR27","unstructured":"Malin, B., Sweeney, L.: Re-identification of dna through an automated linkage process. In: AMIA Annual Symposium, pp. 423\u2013427 (2001)"},{"key":"18_CR28","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"W.J. Masek","year":"1980","unstructured":"Masek, W.J., Paterson, M.S.: A faster algorithm for computing string edit distances. J. of Computer and System Sciences\u00a020, 18\u201331 (1980)","journal-title":"J. of Computer and System Sciences"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/11930242_22","volume-title":"Privacy in Statistical Databases","author":"C.A. Melchor","year":"2006","unstructured":"Melchor, C.A., Deswarte, Y.: Single-database private information retrieval schemes\u00a0: Overview, performance study, and usage with statistical databases. In: Domingo-Ferrer, J., Franconi, L. (eds.) PSD 2006. LNCS, vol.\u00a04302, pp. 257\u2013265. Springer, Heidelberg (2006)"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Naor, M., Nissim, K.: Communication preserving protocols for secure function evaluation. In: Proc. of STOC, pp. 590\u2013599 (2001)","DOI":"10.1145\/380752.380855"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Proc. of STOC, pp. 245\u2013254 (1999)","DOI":"10.1145\/301250.301312"},{"key":"18_CR32","unstructured":"Department of\u00a0Health and Human Services. 45 CFR (Code of Federal Regulations), parts 160\u2013164. Standards for privacy of individually identifiable health information, final rule. Federal Register 67(157), 53182\u201353273 (August 12, 2002)"},{"key":"18_CR33","unstructured":"The GPL\u00a0Violations project (2008), http:\/\/gpl-violations.org\/"},{"key":"18_CR34","unstructured":"Szajda, D., Pohl, M., Owen, J., Lawson, B.G.: Toward a practical data privacy scheme for a distributed implementation of the Smith-Waterman genome sequence comparison algorithm. In: Proc. of NDSS, pp. 253\u2013265 (2006)"},{"issue":"2","key":"18_CR35","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1517\/phgs.4.2.107.22625","volume":"4","author":"L.T. Vaszar","year":"2003","unstructured":"Vaszar, L.T., Cho, M.K., Raffin, T.A.: Privacy issues in personalized medicine. Pharmacogenomics\u00a04(2), 107\u2013112 (2003)","journal-title":"Pharmacogenomics"},{"key":"18_CR36","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proc. of FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00862-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:48:46Z","timestamp":1558291726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00862-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642008610","9783642008627"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00862-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}