Sciweavers

    LATINCRYPT
    2010
    116views Cryptology» more  LATINCRYPT 2010»
    On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
    13 years 10 months ago
    On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
    Download  www.cs.princeton.edu
    We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
    S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...
    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.