Formal eavesdropping and its computational interpretation

DOI10.1007/3-540-45500-0_4MaRDI QIDQ5714435zbMATH OpenFDO

Authors Martín Abadi, Jan Jürjens

Publication date 2 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2215/22150082.htm

Mathematics Subject Classification ID

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

Recommendations

• Reconciling two views of cryptography (the computational soundness of formal encryption)
• Reconciling two views of cryptography (The computational soundness of formal encryption)
• Sound computational interpretation of formal encryption with composed keys
• Towards a formal treatment of secrecy against computational adversaries
• Computationally sound implementations of equational theories against passive adversaries

Cited in

(20)

• Computationally sound implementations of equational theories against passive adversaries
• Reconciling two views of cryptography (The computational soundness of formal encryption)
• Universally composable symbolic security analysis
• Sound and complete computational interpretation of symbolic hashes in the standard model
• Unifying simulatability definitions in cryptographic systems under different timing assumptions
• Explicit randomness is not necessary when modeling probabilistic encryption
• OAEP Is Secure under Key-Dependent Messages
• Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption
• Reconciling two views of cryptography (the computational soundness of formal encryption)
• A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
• Symmetric authentication within a simulatable cryptographic library
• Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups
• A computational interpretation of Dolev-Yao adversaries
• Weakening the perfect encryption assumption in Dolev-Yao adversaries
• Formal abstractions for attested execution secure processors
• A cryptographically sound Dolev-Yao style security proof of the Otway-Rees protocol
• Cryptographically sound security proofs for basic and public-key Kerberos
• Limits of the BRSIM/UC soundness of Dolev-Yao models with hashes
• Limits of the cryptographic realization of Dolev-Yao-style XOR
• Soundness of Formal Encryption in the Presence of Key-Cycles

This page was built for publication: Formal eavesdropping and its computational interpretation

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