Sciweavers

27 search results - page 3 / 6
» Deciding Knowledge in Security Protocols Under Equational Th...
Sort
View
SP
2008
IEEE
132views Security Privacy» more  SP 2008»
13 years 4 months ago
Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...
Michael Backes, Matteo Maffei, Dominique Unruh
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 6 months ago
How to prevent type-flaw and multi-protocol attacks on security protocols under Exclusive-OR
Type-flaw attacks and multi-protocol attacks on security protocols have been frequently reported in the literature. Heather et al. and Guttman et al. proved that these could be pr...
Sreekanth Malladi
RTA
2009
Springer
14 years 27 days ago
YAPA: A Generic Tool for Computing Intruder Knowledge
Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages...
Mathieu Baudet, Véronique Cortier, St&eacut...
IANDC
2008
150views more  IANDC 2008»
13 years 6 months ago
Hierarchical combination of intruder theories
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
Yannick Chevalier, Michaël Rusinowitch
LICS
2007
IEEE
14 years 19 days ago
A Complete Axiomatization of Knowledge and Cryptography
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...
Mika Cohen, Mads Dam