Privacy preserving string comparisons based on Levenshtein distance
暂无分享,去创建一个
Shantanu Rane | Wei Sun | Wei Sun | S. Rane
[1] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .
[2] Josh Benaloh,et al. Dense Probabilistic Encryption , 1999 .
[3] Maxime Crochemore,et al. Algorithms on strings , 2007 .
[4] Ivan Damgård,et al. A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System , 2001, Public Key Cryptography.
[5] Yücel Saygin,et al. Privacy Preserving Clustering on Horizontally Partitioned Data , 2006, 22nd International Conference on Data Engineering Workshops (ICDEW'06).
[6] Mikhail J. Atallah,et al. Secure outsourcing of sequence comparisons , 2004, International Journal of Information Security.
[7] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[8] Vladimir I. Levenshtein,et al. Binary codes capable of correcting deletions, insertions, and reversals , 1965 .
[9] Wenliang Du,et al. Secure and private sequence comparisons , 2003, WPES '03.
[10] Anthony Vetro,et al. Privacy-preserving approximation of L1 distance for multimedia applications , 2010, 2010 IEEE International Conference on Multimedia and Expo.