Sciweavers

719 search results - page 25 / 144
» Proving Security Protocols Correct
Sort
View
ENTCS
2007
129views more  ENTCS 2007»
14 years 9 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...
71
Voted
ISICT
2004
14 years 11 months ago
Preventing type flaw attacks on security protocols with a simplified tagging scheme
A type flaw attack on a security protocol is an attack where a field in a message that was originally intended to have one type is subsequently interpreted as having another type. ...
Yafen Li, Wuu Yang, Ching-Wei Huang
ENTCS
2000
112views more  ENTCS 2000»
14 years 9 months ago
Typed Multiset Rewriting Specifications of Security Protocols
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...
Iliano Cervesato
CCS
2008
ACM
14 years 11 months ago
Mutual authentication in RFID: security and privacy
In RFID protocols, tags identify and authenticate themselves to readers. At Asiacrypt 2007, Vaudenay studied security and privacy models for these protocols. We extend this model ...
Radu-Ioan Paise, Serge Vaudenay
INFOCOM
2007
IEEE
15 years 4 months ago
Toward Optimal Network Fault Correction via End-to-End Inference
— We consider an end-to-end approach of inferring network faults that manifest in multiple protocol layers, with an optimization goal of minimizing the expected cost of correctin...
Patrick P. C. Lee, Vishal Misra, Dan Rubenstein