Private authentication

DOI10.1016/J.TCS.2003.12.023MaRDI QIDQ1881255zbMATH OpenOpenAlexFDO

Authors Martín Abadi, Cédric Fournet

Publication date 4 October 2004

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2003.12.023

zbMATH Keywords

security protocols

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)

Recommendations

• scientific article; zbMATH DE number 2090928
• scientific article; zbMATH DE number 1962756
• A logic of authentication
• Primitives for authentication in process algebras.
• scientific article; zbMATH DE number 1149899

Cites work

• scientific article; zbMATH DE number 1617926 (Why is no real title available?)
• scientific article; zbMATH DE number 1722673 (Why is no real title available?)
• scientific article; zbMATH DE number 1149899 (Why is no real title available?)
• scientific article; zbMATH DE number 1947510 (Why is no real title available?)
• scientific article; zbMATH DE number 1962756 (Why is no real title available?)
• scientific article; zbMATH DE number 2081086 (Why is no real title available?)
• scientific article; zbMATH DE number 2081087 (Why is no real title available?)
• scientific article; zbMATH DE number 1759457 (Why is no real title available?)
• scientific article; zbMATH DE number 1759768 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 2090928 (Why is no real title available?)
• A calculus for cryptographic protocols: The spi calculus
• Authentication primitives and their compilation
• Cryptographic defense against traffic analysis
• Designated verifier proofs and their applications
• Identity-based cryptosystems and signature schemes
• Mobile values, new names, and secure communication
• Probabilistic encryption
• Secure implementation of channel abstractions
• Using encryption for authentication in large networks of computers

Cited in

(24)

• On Communication Models When Verifying Equivalence Properties
• A complete symbolic bisimulation for full applied pi calculus
• Deciding equivalence-based properties using constraint solving
• When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus
• Bayesian authentication: quantifying security of the Hancke-Kuhn protocol
• Theorem-proving anonymity of infinite-state systems
• Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity
• scientific article; zbMATH DE number 1962756 (Why is no real title available?)
• Automated verification of equivalence properties of cryptographic protocols
• Rewriting Privacy
• Designing and Verifying Core Protocols for Location Privacy
• scientific article; zbMATH DE number 2090928 (Why is no real title available?)
• Security abstractions and intruder models (extended abstract)
• scientific article; zbMATH DE number 1844568 (Why is no real title available?)
• Stateful applied pi calculus: observational equivalence and labelled bisimilarity
• Cryptanalysis of a privacy-preserving authentication scheme based on private set intersection
• A procedure for deciding symbolic equivalence between sets of constraint systems
• scientific article; zbMATH DE number 1746628 (Why is no real title available?)
• Probabilistic and nondeterministic aspects of anonymity
• scientific article; zbMATH DE number 1947538 (Why is no real title available?)
• DeepSec: deciding equivalence properties for security protocols -- improved theory and practice
• Channel abstractions for network security
• POR for security protocol equivalences. Beyond action-determinism
• A semantics for web services authentication

This page was built for publication: Private authentication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1881255)