scientific article; zbMATH DE number 2242582

zbMath1087.68563MaRDI QIDQ5714435

Martín Abadi, Jan Jürjens

Publication date: 2 January 2006

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (17)

Universally composable symbolic security analysis ⋮ A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols ⋮ Sound and complete computational interpretation of symbolic hashes in the standard model ⋮ Unifying simulatability definitions in cryptographic systems under different timing assumptions ⋮ Formal Abstractions for Attested Execution Secure Processors ⋮ A computational interpretation of Dolev-Yao adversaries ⋮ Weakening the perfect encryption assumption in Dolev-Yao adversaries ⋮ OAEP Is Secure under Key-Dependent Messages ⋮ Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption ⋮ Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups ⋮ 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 ⋮ Explicit Randomness is not Necessary when Modeling Probabilistic Encryption ⋮ Symmetric Authentication within a Simulatable Cryptographic Library

This page was built for publication: