Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Journal of the ACM (JACM)
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Bounds on the Complexity of the Longest Common Subsequence Problem
Journal of the ACM (JACM)
Communication preserving protocols for secure function evaluation
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Introduction to Algorithms
Priced Oblivious Transfer: How to Sell Digital Goods
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Secure and private sequence comparisons
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Towards Practical Privacy for Genomic Computation
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
A length-flexible threshold cryptosystem with applications
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Secure linear algebra using linearly recurrent sequences
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Multi-party indirect indexing and applications
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Privacy-Preserving graph algorithms in the semi-honest model
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Single-database private information retrieval with constant communication rate
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
PSD'06 Proceedings of the 2006 CENEX-SDC project international conference on Privacy in Statistical Databases
Private multiparty sampling and approximation of vector combinations
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Secure outsourcing of DNA searching via finite automata
DBSec'10 Proceedings of the 24th annual IFIP WG 11.3 working conference on Data and applications security and privacy
| Hi-index | 0.00 |
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.