The computational SLR: a logic for reasoning about computational indistinguishability
From MaRDI portal
Publication:3060197
DOI10.1017/S0960129510000265zbMath1200.94052MaRDI QIDQ3060197
Publication date: 1 December 2010
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Logic in computer science (03B70)
Related Items (5)
On Equivalences, Metrics, and Polynomial Time ⋮ A Formalization of Polytime Functions ⋮ Formal security proofs with minimal fuss: implicit computational complexity at work ⋮ A higher-order characterization of probabilistic polynomial time ⋮ Program equivalence in linear contexts
Cites Work
- 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
This page was built for publication: The computational SLR: a logic for reasoning about computational indistinguishability
