Sciweavers

286 search results - page 16 / 58
» Pitfalls in Formal Reasoning about Security Protocols
Sort
View
ICDCS
2005
IEEE
15 years 3 months ago
Equational Approach to Formal Analysis of TLS
TLS has been formally analyzed with the OTS/CafeOBJ method. In the method, distributed systems are modeled as transition systems, which are written in terms of equations, and it i...
Kazuhiro Ogata, Kokichi Futatsugi
CCS
2010
ACM
14 years 9 months ago
Computational indistinguishability logic
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...
Gilles Barthe, Marion Daubignard, Bruce M. Kapron,...
ESORICS
2004
Springer
15 years 2 months ago
A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
Michael Backes
ICALP
2003
Springer
15 years 2 months ago
Secrecy in Untrusted Networks
We investigate the protection of migrating agents against the untrusted sites they traverse. The resulting calculus provides a formal framework to reason about protection policies ...
Michele Bugliesi, Silvia Crafa, Amela Prelic, Vlad...
CIKM
2009
Springer
15 years 4 months ago
A framework for safely publishing communication traces
A communication trace is a detailed record of the communication between two entities. Communication traces are vital for research in computer networks and protocols in many domain...
Abhinav Parate, Gerome Miklau