State separation for code-based game-playing proofs
From MaRDI portal
Recommendations
- Simplifying game-based definitions -- indistinguishability up to correctness and its application to stateful AE
- Automated verification of state sequence invariants in general game playing
- Formal Proof of Provable Security by Game-Playing in a Proof Assistant
- Program verification using symbolic game semantics
- Verification of Higher-Order Computation: A Game-Semantic Approach
- A game semantics of concurrent separation logic
- A Calculus for Game-Based Security Proofs
- Static Analysis
Cites work
- (De-)constructing TLS 1.3
- A calculus of mobile processes. I
- A cryptographic analysis of the TLS 1.3 handshake protocol
- A formal security analysis of the Signal messaging protocol
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- An equational approach to secure multi-party computation
- Authenticated key exchange secure against dictionary attacks
- Beyond eCK: perfect forward secrecy under actor compromise and ephemeral-key reveal
- Careful with composition: limitations of the indifferentiability framework
- Computer-Aided Security Proofs for the Working Cryptographer
- Constructive cryptography -- a new paradigm for security definitions and proofs
- Constructive cryptography -- a primer. (Abstract)
- Dependent types and multi-monadic effects in \(\mathrm{F}^*\)
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Formalizing human ignorance
- GNUC: a new universal composability framework
- HMQV: A High-Performance Secure Diffie-Hellman Protocol
- scientific article; zbMATH DE number 5009203 (Why is no real title available?)
- scientific article; zbMATH DE number 1263181 (Why is no real title available?)
- scientific article; zbMATH DE number 1952947 (Why is no real title available?)
- scientific article; zbMATH DE number 2080910 (Why is no real title available?)
- scientific article; zbMATH DE number 2086702 (Why is no real title available?)
- Long-Term Security and Universal Composability
- Mind the gap: modular machine-checked proofs of one-round key exchange protocols
- Non-uniform cracks in the concrete: the power of free precomputation
- On the security of the TLS protocol: a systematic analysis
- On the security of TLS-DHE in the standard model
- Proving the TLS handshake secure (as it is)
- Simplified universal composability framework
- State separation for code-based game-playing proofs
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Theory of Cryptography
Cited in
(8)- Short variable length domain extenders with beyond birthday bound security
- State separation for code-based game-playing proofs
- Simplifying game-based definitions -- indistinguishability up to correctness and its application to stateful AE
- Key-schedule security for the TLS 1.3 standard
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
- How hard can it be to formalize a proof? Lessons from formalizing \texttt{CryptoBox} three times in EasyCrypt
- The brave new world of global generic groups and UC-secure zero-overhead SNARKs
- UC4Free! Existing threshold signatures are UC secure
This page was built for publication: State separation for code-based game-playing proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1710673)
