Communication-Efficient Private Protocols for Longest Common Subsequence.

Matthew K. Franklin Mark A. Gondree Payman Mohassel

Published in: IACR Cryptol. ePrint Arch. (2009)

Keyphrases

longest common subsequence
lower bound
privacy preserving
support vector
upper bound
dimensionality reduction