Sciweavers

19 search results - page 2 / 4
» Examining Indistinguishability-Based Proof Models for Key Es...
Sort
View
ENTCS
2006
145views more  ENTCS 2006»
13 years 7 months ago
Real-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security Proof
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
CSFW
2006
IEEE
14 years 1 months ago
Computationally Sound Compositional Logic for Key Exchange Protocols
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
Anupam Datta, Ante Derek, John C. Mitchell, Bogdan...
CSFW
2008
IEEE
13 years 9 months ago
A Correctness Proof of a Mesh Security Architecture
The IEEE 802.11s working group is tasked to provide ways of establishing and securing a wireless mesh network. One proposal establishes a Mesh Security Architecture (MSA), with a ...
Doug Kuhlman, Ryan Moriarty, Tony Braskich, Steve ...
ASIACRYPT
2000
Springer
13 years 11 months ago
Round-Efficient Conference Key Agreement Protocols with Provable Security
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. ...
Wen-Guey Tzeng, Zhi-Jia Tzeng
ISW
2007
Springer
14 years 1 months ago
Strongly-Secure Identity-Based Key Agreement and Anonymous Extension
Abstract. We study the provable security of identity-based (ID-based) key agreement protocols. Although several published protocols have been proven secure in the random oracle mod...
Sherman S. M. Chow, Kim-Kwang Raymond Choo