Communication-Efficient Private Protocols for Longest Common Subsequence

DOI10.1007/978-3-642-00862-7_18MaRDI QIDQ3623051zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• The communication and streaming complexity of computing the longest common and increasing subsequences
• Compressed communication complexity of longest common prefixes
• scientific article; zbMATH DE number 4051007
• 5PM: secure pattern matching
• Computationally secure pattern matching in the presence of malicious adversaries

Cites work

• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 1722674 (Why is no real title available?)
• scientific article; zbMATH DE number 2043334 (Why is no real title available?)
• A faster algorithm computing string edit distances
• Advances in Cryptology - EUROCRYPT 2004
• Algorithms on Strings, Trees and Sequences
• Automata, Languages and Programming
• Bounds on the Complexity of the Longest Common Subsequence Problem
• Communication preserving protocols for secure function evaluation
• Communication-Efficient Private Protocols for Longest Common Subsequence
• Foundations of Cryptography
• Introduction to algorithms.
• Multi-party Indirect Indexing and Applications
• Oblivious transfer and polynomial evaluation
• Privacy-Preserving Graph Algorithms in the Semi-honest Model
• Private Multiparty Sampling and Approximation of Vector Combinations
• Private information retrieval
• Secure Linear Algebra Using Linearly Recurrent Sequences
• Security and composition of multiparty cryptographic protocols

Cited in

(3)

• Efficient privacy-preserving variable-length substring match for genome sequence
• Communication-Efficient Private Protocols for Longest Common Subsequence
• Compressed communication complexity of longest common prefixes

This page was built for publication: Communication-Efficient Private Protocols for Longest Common Subsequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623051)