Faster Privacy-Preserving Computation of Edit Distance with Moves

We consider an efficient two-party protocol for securely computing the similarity of strings w.r.t. an extended edit distance measure. Here, two parties possessing strings $x$ and $y$, respectively, want to jointly compute an approximate value for $\mathrm{EDM}(x,y)$, the minimum number of edit operations including substring moves needed to transform $x$ into $y$, without revealing any private information. Recently, the first secure two-party protocol for this was proposed, based on homomorphic encryption, but this approach is not suitable for long strings due to its high communication and round complexities. In this paper, we propose an improved algorithm that significantly reduces the round complexity without sacrificing its cryptographic strength. We examine the performance of our algorithm for DNA sequences compared to previous one.

[1]  Dana Shapira,et al.  Edit distance with move operations , 2002, J. Discrete Algorithms.

[2]  Oded Goldreich Foundations of Cryptography: Index , 2001 .

[3]  D. Eppstein Foreword to special issue on SODA 2002 , 2007, TALG.

[4]  Hiroshi Sakamoto,et al.  Privacy-Preserving String Edit Distance with Moves , 2018, SISAP.

[5]  Artur Jez,et al.  Edit Distance with Block Operations , 2018, ESA.

[6]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[7]  Shantanu Rane,et al.  Privacy preserving string comparisons based on Levenshtein distance , 2010, 2010 IEEE International Workshop on Information Forensics and Security.

[8]  Craig Gentry,et al.  (Leveled) fully homomorphic encryption without bootstrapping , 2012, ITCS '12.

[9]  Mete Akgün,et al.  Privacy preserving processing of genomic data: A survey , 2015, J. Biomed. Informatics.

[10]  E. Kushilevitz Foundations of Cryptography Foundations of Cryptography , 2014 .

[11]  Johannes Fischer,et al.  Deterministic Sparse Suffix Sorting on Rewritable Texts , 2016, LATIN.

[12]  Marina Blanton,et al.  Private and oblivious set and multiset operations , 2012, AsiaCCS.

[13]  Richard M. Karp,et al.  Efficient Randomized Pattern-Matching Algorithms , 1987, IBM J. Res. Dev..

[14]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[15]  Yücel Saygin,et al.  Privacy Preserving Clustering on Horizontally Partitioned Data , 2006, 22nd International Conference on Data Engineering Workshops (ICDEW'06).

[16]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[17]  Carlos Cid,et al.  An Efficient Toolkit for Computing Private Set Operations , 2017, ACISP.

[18]  Dennis Hofheinz,et al.  Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations , 2014, IACR Cryptol. ePrint Arch..

[19]  Dawn Xiaodong Song,et al.  Privacy-Preserving Set Operations , 2005, CRYPTO.

[20]  Graham Cormode,et al.  The string edit distance matching problem with moves , 2007, TALG.

[21]  Yusuke Sakai,et al.  Efficient Two-level Homomorphic Encryption in Prime-order Bilinear Groups and A Fast Implementation in WebAssembly , 2018, AsiaCCS.

[22]  Dan Boneh,et al.  Evaluating 2-DNF Formulas on Ciphertexts , 2005, TCC.

[23]  Dario Fiore,et al.  Using Linearly-Homomorphic Encryption to Evaluate Degree-2 Functions on Encrypted Data , 2015, CCS.

[24]  David Mandell Freeman,et al.  Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups , 2010, EUROCRYPT.