20 search results - page 2 / 4 » Breaking One-Round Key-Agreement Protocols in the Random Ora... |
87
Voted
ISW
2007
Springer
15 years 4 months ago
2007
Springer
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...
115
Voted
SCN
2010
Springer
14 years 8 months ago
2010
Springer
Serge Vaudenay [20] introduced a notion of Message Authentication (MA) protocols in the Short Authenticated String (SAS) model. A SAS-MA protocol authenticates arbitrarily long mes...
93
Voted
CCS
2008
ACM
15 years 8 days ago
2008
ACM
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...
82
Voted
SCN
2010
Springer
14 years 8 months ago
2010
Springer
The Canetti–Krawczyk (CK) and extended Canetti–Krawczyk (eCK) security models, are widely used to provide security arguments for key agreement protocols. We discuss security s...
73
Voted
IJNSEC
2006
14 years 10 months ago
2006
This paper presents an efficient password-based authenticated encrypted group key agreement protocol immune to dictionary attack under the computation Diffie-Hellman (CDH) assumpt...