The computational SLR: a logic for reasoning about computational indistinguishability

DOI10.1017/S0960129510000265zbMATH Open1200.94052MaRDI QIDQ3060197FDOQ3060197

Authors: Yu Zhang 

Publication date: 1 December 2010

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

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

Mathematics Subject Classification ID

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

Cites Work

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

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)