Privacy–Preserving Text Similarity via Non-Prefix-Free Codes
- 23 September 2019
- book chapter
- Published by Springer Nature
- p. 94-102
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Huffman Codes versus Augmented Non-Prefix-Free Codes2015
- Secure Similar Document Detection with Simhash2014
- EsPRESSO: Efficient privacy-preserving evaluation of sample set similarityJournal of Computer Security, 2014
- Fully homomorphic encryption using ideal lattices2009
- The Google Similarity DistanceIEEE Transactions on Knowledge and Data Engineering, 2007
- Shared Information and Program Plagiarism DetectionIEEE Transactions on Information Theory, 2004
- METER2001
- Information distanceIEEE Transactions on Information Theory, 1998
- On breaking a Huffman codeIEEE Transactions on Information Theory, 1996
- Complexity aspects of guessing prefix codesAlgorithmica, 1994