Communication-Efficient Private Protocols for Longest Common Subsequence (Q3623051): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-00862-7_18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153474708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Complexity of the Longest Common Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy-Preserving Graph Algorithms in the Semi-honest Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security and composition of multiparty cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4450762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-party Indirect Indexing and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication-Efficient Private Protocols for Longest Common Subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private Multiparty Sampling and Approximation of Vector Combinations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Linear Algebra Using Linearly Recurrent Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm computing string edit distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication preserving protocols for secure function evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious transfer and polynomial evaluation / rank
 
Normal rank

Latest revision as of 13:02, 1 July 2024

scientific article
Language Label Description Also known as
English
Communication-Efficient Private Protocols for Longest Common Subsequence
scientific article

    Statements

    Communication-Efficient Private Protocols for Longest Common Subsequence (English)
    0 references
    0 references
    0 references
    0 references
    29 April 2009
    0 references
    0 references
    0 references