A Calculus for Game-Based Security Proofs

DOI10.1007/978-3-642-16280-0_3MaRDI QIDQ4933210zbMATH OpenOpenAlexFDO

Authors Yu Zhang, David Nowak

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

zbMATH Keywords

computational indistinguishabilitygame-based proofsimplicit complexity

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Games involving topology, set theory, or logic (91A44) Cryptography (94A60)

Recommendations

• Formal Proof of Provable Security by Game-Playing in a Proof Assistant
• A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs
• A game-theoretic framework for specification and verification of cryptographic protocols
• Toward a game theoretic view of secure computation
• Towards a game theoretic view of secure computation
• Automated Security Proofs with Sequences of Games
• The Layered Games Framework for Specifications and Analysis of Security Protocols
• The layered games framework for specifications and analysis of security protocols
• CryptHOL: game-based proofs in higher-order logic

Cites work

• A Formal Language for Cryptographic Pseudocode
• A new recursion-theoretic characterization of the polytime functions
• A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A Simple Unpredictable Pseudo-Random Number Generator
• Authenticated encryption: relations among notions and analysis of the generic composition paradigm
• Automated proofs for asymmetric encryption
• Automated Security Proofs with Sequences of Games
• Certifying assembly with formal security proofs: the case of BBS
• Formal certification of code-based cryptographic proofs
• Foundations of Cryptography
• scientific article; zbMATH DE number 1186931 (Why is no real title available?)
• scientific article; zbMATH DE number 1223626 (Why is no real title available?)
• scientific article; zbMATH DE number 1927425 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• Logics for reasoning about cryptographic constructions
• New directions in cryptography
• Notions of computation and monads
• Probabilistic encryption
• Safe recursion with higher types and BCK-algebra
• Stochastic lambda calculus and monads of probability distributions
• The Computational SLR: A Logic for Reasoning about Computational Indistinguishability

Cited in

(11)

• State separation for code-based game-playing proofs
• CryptHOL: game-based proofs in higher-order logic
• Formal security proofs with minimal fuss: implicit computational complexity at work
• Program equivalence in linear contexts
• On equivalences, metrics, and polynomial time
• A formalization of polytime functions
• Formal Proof of Provable Security by Game-Playing in a Proof Assistant
• A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs
• Formal certification of code-based cryptographic proofs
• A Formal Language for Cryptographic Pseudocode
• Bit security as computational cost for winning games with high probability

This page was built for publication: A Calculus for Game-Based Security Proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933210)