scientific article; zbMATH DE number 1759457
From MaRDI portal
Publication:4536407
Recommendations
Cited in
(35)- Computationally sound implementations of equational theories against passive adversaries
- Safely composing security protocols
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- On the symbolic reduction of processes with cryptographic functions.
- Private authentication
- Abstractions of non-interference security: probabilistic versus possibilistic
- Moving the bar on computationally sound exclusive-or
- Formalizing provable anonymity in Isabelle/HOL
- Automated analysis of cryptographic assumptions in generic group models
- The reactive simulatability (RSIM) framework for asynchronous systems
- Unifying simulatability definitions in cryptographic systems under different timing assumptions
- Computational soundness of symbolic analysis for protocols using hash functions
- A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds
- A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
- Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies
- Symmetric authentication within a simulatable cryptographic library
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
- Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali
- Multi-attacker protocol validation
- A survey of symbolic methods in computational analysis of cryptographic systems
- Advances in Cryptology - CRYPTO 2003
- A “proof-reading” of Some Issues in Cryptography
- On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
- A computational interpretation of Dolev-Yao adversaries
- Weakening the perfect encryption assumption in Dolev-Yao adversaries
- Information Security and Cryptology - ICISC 2003
- scientific article; zbMATH DE number 2242582 (Why is no real title available?)
- A cryptographically sound Dolev-Yao style security proof of the Otway-Rees protocol
- Limits of the BRSIM/UC soundness of Dolev-Yao models with hashes
- Machine-checked security proofs of cryptographic signature schemes
- Limits of the cryptographic realization of Dolev-Yao-style XOR
- Soundness of Formal Encryption in the Presence of Key-Cycles
- Practical Formal Methods for Real World Cryptography (Invited Talk)
- Key-dependent message security: generic amplification and completeness
- Intruder deduction for the equational theory of abelian groups with distributive 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 Q4536407)
