scientific article; zbMATH DE number 2242582
From MaRDI portal
Publication:5714435
Recommendations
Cited in
(20)- Weakening the perfect encryption assumption in Dolev-Yao adversaries
- Computationally sound implementations of equational theories against passive adversaries
- 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
- Limits of the cryptographic realization of Dolev-Yao-style XOR
- Unifying simulatability definitions in cryptographic systems under different timing assumptions
- Symmetric authentication within a simulatable cryptographic library
- OAEP Is Secure under Key-Dependent Messages
- Universally composable symbolic security analysis
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Limits of the BRSIM/UC soundness of Dolev-Yao models with hashes
- Explicit randomness is not necessary when modeling probabilistic encryption
- A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
- Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption
- scientific article; zbMATH DE number 1759457 (Why is no real title available?)
- Formal abstractions for attested execution secure processors
- Soundness of Formal Encryption in the Presence of Key-Cycles
- Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups
- Sound and complete computational interpretation of symbolic hashes in the standard model
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)