A few ANU colleagues and I have just completed a paper on a suffix-tree-based algorithm for computing the longest common substring of two strings in a privacy-preserving manner. Here’s the abstract: The task of calculating similarities between strings held by different organizations without revealing these strings is an increasingly important problem in areas such as … More Accurate and Efficient Privacy-Preserving String Matching