The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
From MaRDI portal
Publication:3637209
DOI10.1007/978-3-642-02273-9_29zbMath1246.94042OpenAlexW1733287636MaRDI QIDQ3637209
Publication date: 7 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02273-9_29
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Logic in computer science (03B70)
Related Items
Paths-based criteria and application to linear logic subsystems characterizing polynomial time ⋮ A Calculus for Game-Based Security Proofs ⋮ Implicit computation complexity in higher-order programming languages
Cites Work
- Unnamed Item
- Notions of computation and monads
- 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
- Foundations of Cryptography
- Stochastic lambda calculus and monads of probability distributions
- Formal certification of code-based cryptographic proofs
- A Formal Language for Cryptographic Pseudocode
This page was built for publication: The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
