Sciweavers

88 search results - page 2 / 18
» Implementation of a Provably Secure, Smartcard-Based Key Dis...
Sort
View
ENTCS
2006
145views more  ENTCS 2006»
13 years 5 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
ICDCS
1998
IEEE
13 years 9 months ago
CLIQUES: A New Approach to Group Key Agreement
This paper considers the problem of key agreement in a group setting with highly-dynamic group member population. A protocol suite, called CLIQUES, is developed by extending the w...
Michael Steiner, Gene Tsudik, Michael Waidner
PERCOM
2007
ACM
14 years 5 months ago
A three round authenticated group key agreement protocol for ad hoc networks
Group Key Agreement (GKA) protocols enable the participants to derive a key based on each one's contribution over a public network without any central authority. They also pr...
Daniel Augot, Raghav Bhaskar, Valérie Issarny, Da...
CCS
2008
ACM
13 years 7 months ago
Provably secure browser-based user-aware mutual authentication over TLS
The standard solution for user authentication on the Web is to establish a TLS-based secure channel in server authenticated mode and run a protocol on top of TLS where the user en...
Sebastian Gajek, Mark Manulis, Ahmad-Reza Sadeghi,...
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 2 months ago
NLHB : A Non-Linear Hopper Blum Protocol
The Hopper-Blum (HB) protocol, which uses noised linear parities of a shared key for authentication, has been proposed for light-weight applications such as RFID. Recently, algorit...
Mukundan Madhavan, Andrew Thangaraj, Yogesh Sankar...