A calculus for cryptographic protocols
Information and Computation
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Types and programming languages
Types and programming languages
Semantics and Program Analysis of Computationally Secure Information Flow
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Possible World Semantics for General Storage in Call-By-Value
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A composable cryptographic library with nested operations
Proceedings of the 10th ACM conference on Computer and communications security
Journal of Functional Programming
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Symmetric Encryption in a Simulatable Dolev-Yao Style Cryptographic Library
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
A Computationally Sound Mechanized Prover for Security Protocols
SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
A probabilistic hoare-style logic for game-based cryptographic proofs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Computationally sound, automated proofs for security protocols
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Automated security proofs with sequences of games
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
The security of triple encryption and a framework for code-based game-playing proofs
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Universally composable symbolic analysis of mutual authentication and key-exchange protocols
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Computational indistinguishability logic
Proceedings of the 17th ACM conference on Computer and communications security
Computational soundness of symbolic zero-knowledge proofs
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
The computational slr: A logic for reasoning about computational indistinguishability
Mathematical Structures in Computer Science
A calculus for game-based security proofs
ProvSec'10 Proceedings of the 4th international conference on Provable security
Beyond provable security verifiable IND-CCA security of OAEP
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Proving the security of ElGamal encryption via indistinguishability logic
Proceedings of the 2011 ACM Symposium on Applied Computing
A formalization of polytime functions
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
A user interface for a game-based protocol verification tool
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Certifying assembly with formal security proofs: The case of BBS
Science of Computer Programming
| Hi-index | 0.00 |
Game-based cryptographic proofs are typically expressed using pseudocode, which lacks a formal semantics. This can lead to ambiguous specifications, hidden mistakes, and even wrong proofs. We propose a language for expressing proofs that is expressive enough to specify all constructs occurring in cryptographic games, including probabilistic behaviors, the usage of oracles, and polynomial-time programs. The language is a probabilistic higher-order lambda calculus with recursive types, references, and support for events, and is simple enough that researchers without a strong background in the theory of programming languages can understand it. The language has been implemented in the proof assistant Isabelle/HOL.