Sciweavers

252 search results - page 15 / 51
» Computationally secure two-round authenticated message excha...
Sort
View
FMCO
2003
Springer
121views Formal Methods» more  FMCO 2003»
15 years 2 months ago
TulaFale: A Security Tool for Web Services
Web services security specifications are typically expressed as a mixture of XML schemas, example messages, and narrative explanations. We propose a new specification language fo...
Karthikeyan Bhargavan, Cédric Fournet, Andr...
104
Voted
PKC
2004
Springer
160views Cryptology» more  PKC 2004»
15 years 3 months ago
Constant Round Authenticated Group Key Agreement via Distributed Computation
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
Emmanuel Bresson, Dario Catalano
97
Voted
ICDCSW
2005
IEEE
15 years 3 months ago
Increasing Attack Resiliency of Wireless Ad Hoc and Sensor Networks
An ad hoc or sensor network that is employed for security sensitive applications is expected to tolerate a certain quantity of maliciously behaving nodes. Algorithms must be desig...
Harald Vogt
CCS
2007
ACM
15 years 3 months ago
A calculus of challenges and responses
er presents a novel approach for concisely abstracting authentication s and for subsequently analyzing those abstractions in a sound manner, i.e., deriving authentication guarante...
Michael Backes, Agostino Cortesi, Riccardo Focardi...
SCN
2010
Springer
138views Communications» more  SCN 2010»
14 years 8 months ago
A Security Enhancement and Proof for Authentication and Key Agreement (AKA)
In this work, we consider Authentication and Key Agreement (AKA), a popular client-server Key Exchange (KE) protocol, commonly used in wireless standards (e.g., UMTS), and widely c...
Vladimir Kolesnikov