Inductive Proofs of Computational Secrecy

DOI10.1007/978-3-540-74835-9_15MaRDI QIDQ3521245zbMATH OpenOpenAlexFDO

Authors Arnab Roy, Anupam Datta, Ante Derek, John Mitchell

Publication date 21 August 2008

Published in Computer Security – ESORICS 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74835-9_15

Mathematics Subject Classification ID

Network protocols (68M12) Computer security (68M25) Applications of game theory (91A80) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Cryptographically sound security proofs for basic and public-key Kerberos
• Formal correctness of security protocols.
• Secrecy by typing in security protocols
• Automated Security Proofs with Sequences of Games
• Programming Languages and Systems

Cited in

(9)

• Real-or-random key secrecy of the Otway-Rees protocol via a symbolic security proof
• Ideal key derivation and encryption in simulation-based security
• From Indifferentiability to Constructive Cryptography (and Back)
• scientific article; zbMATH DE number 1849111 (Why is no real title available?)
• On Input Indistinguishable Proof Systems
• Cryptographically sound security proofs for basic and public-key Kerberos
• Formal analysis of Kerberos 5
• Formal correctness of security protocols.
• A note on computational indistinguishability

This page was built for publication: Inductive Proofs of Computational Secrecy

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