scientific article; zbMATH DE number 2242582
From MaRDI portal
Publication:5714435
zbMATH Open1087.68563MaRDI QIDQ5714435FDOQ5714435
Authors: 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 of this publication is not available (Why is that?)
Recommendations
Cited In (20)
- OAEP Is Secure under Key-Dependent Messages
- A cryptographically sound Dolev-Yao style security proof of the Otway-Rees protocol
- Cryptographically sound security proofs for basic and public-key Kerberos
- A computational interpretation of Dolev-Yao adversaries
- Weakening the perfect encryption assumption in Dolev-Yao adversaries
- Limits of the BRSIM/UC soundness of Dolev-Yao models with hashes
- Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups
- Soundness of Formal Encryption in the Presence of Key-Cycles
- A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
- Computationally sound implementations of equational theories against passive adversaries
- Symmetric authentication within a simulatable cryptographic library
- Sound and complete computational interpretation of symbolic hashes in the standard model
- Universally composable symbolic security analysis
- Formal abstractions for attested execution secure processors
- Explicit randomness is not necessary when modeling probabilistic encryption
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Title not available (Why is that?)
- Limits of the cryptographic realization of Dolev-Yao-style XOR
- Unifying simulatability definitions in cryptographic systems under different timing assumptions
- Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714435)
