Sciweavers

    CTRSA
    2009
    Springer
    106views Cryptology» more  CTRSA 2009»
    Communication-Efficient Private Protocols for Longest Common Subsequence
    15 years 7 months ago
    Communication-Efficient Private Protocols for Longest Common Subsequence
    Download  eprint.iacr.org
    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 p...
    Matthew K. Franklin, Mark Gondree, Payman Mohassel
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.