Logics for reasoning about cryptographic constructions

DOI10.1016/J.JCSS.2005.06.008MaRDI QIDQ2490263zbMATH OpenOpenAlexFDO

Authors Russell Impagliazzo, Bruce M. Kapron

Publication date 28 April 2006

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2005.06.008

zbMATH Keywords

Security protocolsCryptographically sound proofsNonstandard arithmetics

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• Publication:4938617
• Probabilistic relational Hoare logics for computer-aided security proofs
• A logic of authentication
• Publication:4934730
• Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols

Cites work

• scientific article; zbMATH DE number 4066875 (Why is no real title available?)
• scientific article; zbMATH DE number 4069225 (Why is no real title available?)
• scientific article; zbMATH DE number 3467028 (Why is no real title available?)
• scientific article; zbMATH DE number 3557241 (Why is no real title available?)
• scientific article; zbMATH DE number 1304296 (Why is no real title available?)
• scientific article; zbMATH DE number 3305097 (Why is no real title available?)
• A calculus for cryptographic protocols: The spi calculus
• A logic for reasoning about probabilities
• A logic of authentication
• A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
• Bit commitment using pseudorandomness
• Existence and feasibility in arithmetic
• Foundations of Security Analysis and Design III
• Functional interpretations of feasibly constructive arithmetic
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Indexings of subrecursive classes
• On the security of public key protocols
• Reconciling two views of cryptography (The computational soundness of formal encryption)
• Theory of Cryptography
• Theory of Cryptography
• Theory of Formal Systems. (AM-47)

Cited in

(18)

• Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography
• Axiomatizing resource bounds for measure
• A cryptographically sound Dolev-Yao style security proof of the Otway-Rees protocol
• Cryptographically sound security proofs for basic and public-key Kerberos
• Secrecy Logic: Protoalgebraic S-Secrecy Logics
• Limits of the BRSIM/UC soundness of Dolev-Yao models with hashes
• The RSA group is pseudo-free
• The computational SLR: a logic for reasoning about computational indistinguishability
• Soundness of Formal Encryption in the Presence of Key-Cycles
• Modal logics for cryptographic processes
• scientific article; zbMATH DE number 2043527 (Why is no real title available?)
• A Calculus for Game-Based Security Proofs
• Formal security proofs with minimal fuss: implicit computational complexity at work
• The reactive simulatability (RSIM) framework for asynchronous systems
• Machine-checked security proofs of cryptographic signature schemes
• Certified security proofs of cryptographic protocols in the computational model: an application to intrusion resilience
• The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
• Unifying simulatability definitions in cryptographic systems under different timing assumptions

This page was built for publication: Logics for reasoning about cryptographic constructions

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