Return to Question

But the only method I am familiar with that does this is ROT13 (more generally, any shift cipher), which hardly even counts as encryption; it's like writing the names upside down and saying, "Promise you won't flip the paper over?"

• Privacy Preserving String Comparisons Based on Levenshtein Distance
• An Empirical Comparison of Approaches to Approximate String Matching in Private Record Linkage

But the only method I am familiar with that does this is ROT13 (more generally, any shift cipher), which hardly even counts as encryption; it's like writing the names upside down and saying, "Promise you won't flip the paper over?"

• Privacy Preserving String Comparisons Based on Levenshtein Distance
• An Empirical Comparison of Approaches to Approximate String Matching in Private Record Linkage

But the only method I am familiar with that does this is ROT13, which hardly even counts as encryption; it's like writing the names upside down and saying, "promise you won't flip the paper over?"

But the only method I am familiar with that does this is ROT13 (more generally, any shift cipher), which hardly even counts as encryption; it's like writing the names upside down and saying, "Promise you won't flip the paper over?"

I have found at least one paper that looks relevant but it's a bit over my head.

I've found a couple papers that might be relevant, but they're a bit over my head:

• Privacy Preserving String Comparisons Based on Levenshtein Distance
• An Empirical Comparison of Approaches to Approximate String Matching in Private Record Linkage