Analysing privacy-type properties in cryptographic protocols (invited talk)
From MaRDI portal
Recommendations
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
- Typing messages for free in security protocols
- Analyzing security protocols with secrecy types and logic programs
- Analyzing security protocols with secrecy types and logic programs
- scientific article; zbMATH DE number 1832233
Cites work
- A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
- An attack on the Needham-Schroeder public-key authentication protocol
- Analysing password protocol security against off-line dictionary attacks
- Automated verification of equivalence properties of cryptographic protocols
- Automated verification of selected equivalences for security protocols
- Communicating sequential processes
- Computing knowledge in security protocols under convergent equational theories
- Decidability and combination results for two notions of knowledge in security protocols
- Decidability of equivalence of symbolic derivations
- Deciding framed bisimilarity
- Deciding knowledge in security protocols under equational theories
- Easy intruder deduction problems with homomorphisms
- Equivalence properties by typing in cryptographic branching protocols
- FAST: an efficient decision procedure for deduction and static equivalence
- From security protocols to pushdown automata
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- Mobile values, new names, and secure communication
- Partial order reduction for security protocols
- Proving more observational equivalences with ProVerif
- Term Rewriting and Applications
- Term Rewriting and Applications
- Typing messages for free in security protocols: the case of equivalence properties
- Using encryption for authentication in large networks of computers
Cited in
(5)- Cryptanalysis of a privacy preserving auditing for data integrity protocol from TrustCom 2013
- Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity
- Discovering ePassport vulnerabilities using bisimilarity
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus
- Rewriting Privacy
This page was built for publication: Analysing privacy-type properties in cryptographic protocols (invited talk)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993330)
