Sciweavers

    ASIACRYPT
    2010
    Springer
    158views Cryptology» more  ASIACRYPT 2010»
    The Round Complexity of Verifiable Secret Sharing: The Statistical Case
    13 years 10 months ago
    The Round Complexity of Verifiable Secret Sharing: The Statistical Case
    Download  cgis.cs.umd.edu
    We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
    Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.