A Calculus for Game-Based Security Proofs
From MaRDI portal
Publication:4933210
DOI10.1007/978-3-642-16280-0_3zbMath1287.68023OpenAlexW1501056402MaRDI QIDQ4933210
Publication date: 12 October 2010
Published in: Provable Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-16280-0_3
Games involving topology, set theory, or logic (91A44) Cryptography (94A60) Functional programming and lambda calculus (68N18)
Related Items
On Equivalences, Metrics, and Polynomial Time ⋮ A Formalization of Polytime Functions ⋮ Formal security proofs with minimal fuss: implicit computational complexity at work ⋮ Program equivalence in linear contexts
Cites Work
- Certifying assembly with formal security proofs: the case of BBS
- Automated proofs for asymmetric encryption
- Notions of computation and monads
- Authenticated encryption: relations among notions and analysis of the generic composition paradigm
- Probabilistic encryption
- A new recursion-theoretic characterization of the polytime functions
- Safe recursion with higher types and BCK-algebra
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- Logics for reasoning about cryptographic constructions
- A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs
- The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A Simple Unpredictable Pseudo-Random Number Generator
- New directions in cryptography
- Foundations of Cryptography
- Stochastic lambda calculus and monads of probability distributions
- Formal certification of code-based cryptographic proofs
- A Formal Language for Cryptographic Pseudocode
- Automated Security Proofs with Sequences of Games
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A Calculus for Game-Based Security Proofs
