O. Abul, F. Bonchi, and F. Giannotti, Hiding sequential and spatiotemporal patterns, IEEE Transactions on Knowledge and Data Engineering, vol.22, issue.12, pp.1709-1723, 2010.

A. Backurs and P. Indyk, Edit distance cannot be computed in strongly subquadratic time (unless SETH is false), 47th ACM Annual Symposium on Theory of Computing (STOC), pp.51-58, 2015.

G. Bernardini, H. Chen, A. Conte, R. Grossi, G. Loukides et al., String sanitization: A combinatorial approach, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), vol.7, p.14, 2019.

, String Sanitization Under Edit Distance

G. Bernardini, H. Chen, A. Conte, R. Grossi, G. Loukides et al., Combinatorial algorithms for string sanitization. arXiv, 2019.

G. Bernardini, H. Chen, G. Fici, G. Loukides, and S. P. Pissis, Reverse-safe data structures for text indexing, Symposium on Algorithm Engineering and Experiments (ALENEX), pp.199-213, 2020.

L. Bonomi, L. Fan, and H. Jin, An information-theoretic approach to individual sequential data sanitization, 9th ACM International Conference on Web Search and Data Mining (WSDM), pp.337-346, 2016.

K. Bringmann and M. Künnemann, Quadratic conditional lower bounds for string problems and dynamic time warping, 56th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp.79-97, 2015.

U. , Department of Health & Human Services, Health Insurance Portablility and Accountability Act, 1996.

R. Gwadera, A. Gkoulalas-divanis, and G. Loukides, Permutation-based sequential pattern hiding, 13th IEEE International Conference on Data Mining (ICDM), pp.241-250, 2013.

R. Impagliazzo and R. Paturi, On the complexity of k-SAT, Journal of Computer and Systems Sciences, vol.62, issue.2, pp.367-375, 2001.

R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity?, Journal of Computer and Systems Sciences, vol.63, issue.4, pp.512-530, 2001.

L. Jin, C. Li, and R. Vernica, SEPIA: estimating selectivities of approximate string predicates in large databases, The VLDB Journal, vol.17, issue.5, pp.1213-1229, 2008.

V. I. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Soviet Physics Doklady, vol.10, p.707, 1966.

A. Liu, K. Zhengy, L. Liz, G. Liu, L. Zhao et al., Efficient secure similarity computation on encrypted trajectory data, 31st IEEE International Conference on Data Engineering (ICDE), pp.66-77, 2015.

G. Loukides and R. Gwadera, Optimal event sequence sanitization, SIAM International Conference on Data Mining (SDM), pp.775-783, 2015.

W. Lu, X. Du, M. Hadjieleftheriou, and B. C. Ooi, Efficiently supporting edit distance based string similarity search using B + -trees, IEEE Transactions on Knowledge and Data Engineering, vol.26, issue.12, pp.2983-2996, 2014.

B. Malin and L. Sweeney, Determining the identifiability of DNA database entries, American Medical Informatics Association Annual Symposium (AMIA), pp.537-541, 2000.

E. W. Myers and W. Miller, Approximate matching of regular expressions, Bulletin of Mathematical Biology, vol.51, issue.1, pp.5-37, 1989.

E. Parliament, General Data Protection Regulation

G. Poulis, S. Skiadopoulos, G. Loukides, and A. Gkoulalas-divanis, Apriori-based algorithms for km-anonymizing trajectory data, Transactions on Data Privacy, vol.7, pp.165-194, 2014.

J. Shang, J. Peng, and J. Han, MACFP: Maximal Approximate Consecutive Frequent Pattern Mining under edit distance, SIAM International Conference on Data Mining (SDM), pp.558-566, 2016.

H. J. Smith, T. Dinev, and H. Xu, Information privacy research: An interdisciplinary review, MIS Quarterly, vol.35, issue.4, pp.989-1015, 2011.

M. Terrovitis, G. Poulis, N. Mamoulis, and S. Skiadopoulos, Local suppression and splitting techniques for privacy preserving publication of trajectories, IEEE Transactions on Knowledge and Data Engineering, vol.29, issue.7, pp.1466-1479, 2017.

Z. Wen, D. Deng, R. Zhang, and R. Kotagiri, 2ED: An Efficient Entity Extraction Algorithm using two-level Edit-Distance, 35th IEEE International Conference on Data Engineering (ICDE), pp.998-1009, 2019.