The computational SLR: a logic for reasoning about computational indistinguishability

DOI10.1017/S0960129510000265MaRDI QIDQ3060197zbMATH OpenFDO

Authors Yu Zhang

Publication date 1 December 2010

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Logic in computer science (03B70)

Recommendations

• The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
• A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs
• Formal security proofs with minimal fuss: implicit computational complexity at work
• A note on computational indistinguishability
• A Formal Language for Cryptographic Pseudocode

Cites work

• A new recursion-theoretic characterization of the polytime functions
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• Foundations of Cryptography
• Logics for reasoning about cryptographic constructions
• Notions of computation and monads
• Safe recursion with higher types and BCK-algebra

Cited in

(6)

• Program equivalence in linear contexts
• On equivalences, metrics, and polynomial time
• A formalization of polytime functions
• A higher-order characterization of probabilistic polynomial time
• Formal security proofs with minimal fuss: implicit computational complexity at work
• The Computational SLR: A Logic for Reasoning about Computational Indistinguishability

This page was built for publication: The computational SLR: a logic for reasoning about computational indistinguishability

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