Sciweavers

135 search results - page 13 / 27
» Authentication and Key Agreement Protocols Preserving Anonym...
Sort
View
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
14 years 8 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
ESORICS
2004
Springer
14 years 1 months ago
A Formalization of Anonymity and Onion Routing
The use of formal methods to verify security protocols with respect to secrecy and authentication has become standard practice. In contrast, the formalization of other security goa...
Sjouke Mauw, Jan Verschuren, Erik P. de Vink
ISW
2005
Springer
14 years 1 months ago
Constant Round Dynamic Group Key Agreement
We present a fully symmetric constant round authenticated group key agreement protocol in dynamic scenario. Our proposed scheme achieves forward secrecy and is provably secure und...
Ratna Dutta, Rana Barua
CCS
2008
ACM
13 years 9 months ago
Security arguments for the UM key agreement protocol in the NIST SP 800-56A standard
The Unified Model (UM) key agreement protocol is an efficient Diffie-Hellman scheme that has been included in many cryptographic standards, most recently in the NIST SP 80056A sta...
Alfred Menezes, Berkant Ustaoglu
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