International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Communication-Efficient Private Protocols for Longest Common Subsequence

Authors:
Matthew Franklin
Mark Gondree
Payman Mohassel
Download:
URL: http://eprint.iacr.org/2009/019
Search ePrint
Search Google
Abstract: We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to passive adversaries, under reasonable cryptographic assumptions. We benefit from the somewhat surprising interplay of an efficient block-retrieval PIR (Gentry-Ramzan, ICALP 2005) with the classic “four Russians” algorithmic design. This result is the first improvement to the communication complexity for this application over generic results (such as Yao’s garbled circuit protocol) and, as such, is interesting as a contribution to the theory of communication efficiency for secure two-party and multiparty applications.
BibTeX
@misc{eprint-2009-18202,
  title={Communication-Efficient Private Protocols for Longest Common Subsequence},
  booktitle={IACR Eprint archive},
  keywords={applications / longest common subsequence, secure multiparty computation},
  url={http://eprint.iacr.org/2009/019},
  note={This is the full version of an article to appear in CT-RSA 2009. pmohassel@ucdavis.edu 14257 received 8 Jan 2009, last revised 13 Jan 2009},
  author={Matthew Franklin and Mark Gondree and Payman Mohassel},
  year=2009
}