Sciweavers

    67
    Voted
    CCS
    2001
    ACM
    132views Security Privacy» more  CCS 2001»
    Constraint solving for bounded-process cryptographic protocol analysis
    15 years 1 months ago
    Constraint solving for bounded-process cryptographic protocol analysis
    Download  www.csl.sri.com
    The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.
    Jonathan K. Millen, Vitaly Shmatikov
    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-2025, USA.