Communication-Efficient Private Protocols for Longest Common Subsequence
From MaRDI portal
Publication:3623051
DOI10.1007/978-3-642-00862-7_18zbMath1237.94064MaRDI QIDQ3623051
Matthew Franklin, Mark Gondree, Payman Mohassel
Publication date: 29 April 2009
Published in: Topics in Cryptology – CT-RSA 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00862-7_18
94A60: Cryptography
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A faster algorithm computing string edit distances
- Security and composition of multiparty cryptographic protocols
- Oblivious transfer and polynomial evaluation
- Private information retrieval
- Secure Linear Algebra Using Linearly Recurrent Sequences
- Communication-Efficient Private Protocols for Longest Common Subsequence
- Bounds on the Complexity of the Longest Common Subsequence Problem
- Algorithms on Strings, Trees and Sequences
- Foundations of Cryptography
- Communication preserving protocols for secure function evaluation
- Advances in Cryptology - EUROCRYPT 2004
- Multi-party Indirect Indexing and Applications
- Private Multiparty Sampling and Approximation of Vector Combinations
- Privacy-Preserving Graph Algorithms in the Semi-honest Model
- Automata, Languages and Programming
