{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:43:02Z","timestamp":1743007382563,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030398804"},{"type":"electronic","value":"9783030398811"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39881-1_26","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T03:02:33Z","timestamp":1580094153000},"page":"308-320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Faster Privacy-Preserving Computation of Edit Distance with Moves"],"prefix":"10.1007","author":[{"given":"Yohei","family":"Yoshimoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaharu","family":"Kataoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshimasa","family":"Takabatake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomohiro","family":"I","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kilho","family":"Shin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Sakamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.jbi.2015.05.022","volume":"56","author":"M Akg\u00fcn","year":"2015","unstructured":"Akg\u00fcn, M., Bayrak, A.O., Ozer, B., Sa\u011firo\u011flu, M.S.: Privacy preserving processing of genomic data: a survey. J. Biomed. Inform. 56, 103\u2013111 (2015)","journal-title":"J. Biomed. Inform."},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Attrapadung, N., Hanaoka, G., Mitsunari, S., Sakai, Y., Shimizu, K., Teruya, T.: Efficient two-level homomorphic encryption in prime-order bilinear groups and a fast implementation in webassembly. In: ASIACCS, pp. 685\u2013697 (2018)","DOI":"10.1145\/3196494.3196552"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Blanton, M., Aguiar, E.: Private and oblivious set and multiset operations. In: ASIACCS, pp. 40\u201341 (2012)","DOI":"10.1145\/2414456.2414479"},{"issue":"7","key":"26_CR4","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":"26_CR5","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. 3378, pp. 325\u2013341. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30576-7_18"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: ITCS, pp. 309\u2013325 (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Catalano, D., Fiore, D.: Using linearly-homomorphic encryption to evaluate degree-2 functions on encrypted data. In: CCS, pp. 1518\u20131529 (2015)","DOI":"10.1145\/2810103.2813624"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1186810.1186812","volume":"3","author":"Graham Cormode","year":"2007","unstructured":"Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. ACM Trans. Algor. 3(1), 1\u201319 (2007). Article 2","journal-title":"ACM Transactions on Algorithms"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-59870-3_15","volume-title":"Information Security and Privacy","author":"A Davidson","year":"2017","unstructured":"Davidson, A., Cid, C.: An efficient toolkit for computing private set\u00a0operations. In: Pieprzyk, J., Suriadi, S. (eds.) ACISP 2017. LNCS, Part II, vol. 10343, pp. 261\u2013278. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-59870-3_15"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-662-49529-2_36","volume-title":"LATIN 2016: Theoretical Informatics","author":"J Fischer","year":"2016","unstructured":"Fischer, J., I, T., K\u00f6ppl, D.: Deterministic sparse suffix sorting on rewritable texts. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 483\u2013496. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49529-2_36"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-13190-5_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"DM Freeman","year":"2010","unstructured":"Freeman, D.M.: Converting pairing-based cryptosystems from composite-order groups to prime-order groups. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 44\u201361. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13190-5_3"},{"key":"26_CR12","unstructured":"Ganczorz, M., Gawrychowski, P., Jez, A., Kociumaka, T.: Edit distance with block operations. In: ESA, pp. 33:1\u201333:14 (2018)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"26_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography, vol. II. Cambridge University Press, New York (2004)"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-662-44371-2_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"G Herold","year":"2014","unstructured":"Herold, G., Hesse, J., Hofheinz, D., R\u00e0fols, C., Rupp, A.: Polynomial spaces: a new framework for composite-to-prime-order transformations. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 261\u2013279. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-44371-2_15"},{"issue":"3","key":"26_CR16","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1016\/j.datak.2007.03.015","volume":"63","author":"A Inan","year":"2007","unstructured":"Inan, A., Kaya, S., Saygin, Y., Savas, E., Hintoglu, A., Levi, A.: Privacy preserving clustering on horizontally partitioned data. Data Knowl. Eng. 63(3), 646\u2013666 (2007)","journal-title":"Data Knowl. Eng."},{"issue":"2","key":"26_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"RM Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249\u2013260 (1987)","journal-title":"IBM J. Res. Dev."},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11535218_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"L Kissner","year":"2005","unstructured":"Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241\u2013257. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11535218_15"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-030-02224-2_18","volume-title":"Similarity Search and Applications","author":"S Nakagawa","year":"2018","unstructured":"Nakagawa, S., Sakamoto, T., Takabatake, Y., I, T., Shin, K., Sakamoto, H.: Privacy-preserving string edit distance with moves. In: Marchand-Maillet, S., Silva, Y.N., Ch\u00e1vez, E. (eds.) SISAP 2018. LNCS, vol. 11223, pp. 226\u2013240. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-02224-2_18"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 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. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Rane, S., Sun, W.: Privacy preserving string comparisons based on Levenshtein distance. In: WIFS, pp. 1\u20136 (2010)","DOI":"10.1109\/WIFS.2010.5711449"},{"issue":"2","key":"26_CR22","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.jda.2005.01.010","volume":"5","author":"D Shapira","year":"2007","unstructured":"Shapira, D., Storer, J.A.: Edit distance with move operations. J. Discrete Algorithms 5(2), 380\u2013392 (2007)","journal-title":"J. Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39881-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:06:20Z","timestamp":1582139180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.comp.nus.edu.sg\/~walcom20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}