Amanote Research

Amanote Research

    RegisterSign In

Efficient Construction of Machine-Checked Symbolic Protocol Security Proofs

Journal of Computer Security - Netherlands
doi 10.3233/jcs-2012-0455
Full Text
Open PDF
Abstract

Available in full text

Categories
RiskComputer NetworksHardwareCommunicationsReliabilitySafetyArchitectureQualitySoftware
Date

February 12, 2013

Authors
Simon MeierCas CremersDavid Basin
Publisher

IOS Press


Related search

Machine-Checked Security Proofs of Cryptographic Signature Schemes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Security Protocol Verification: Symbolic and Computational Models

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Interpreting Hash Function Security Proofs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

How to Believe a Machine-Checked Proof

BRICS Report Series
1997English

A Methodological Construction of an Efficient Sequential Consistency Protocol

English

A Machine-Checked Model for a Java-Like Language, Virtual Machine, and Compiler

ACM Transactions on Programming Languages and Systems
Software
2006English

On Tight Security Proofs for Schnorr Signatures

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Modular Security Proofs for Key Agreement Protocols

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Efficient Extraction of Skolem Functions From QRAT Proofs

2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy