This paper surveys recent work on the design and analysis of key agreement protocols that
are based on the intractability of the Diffe-Hellman problem. The focus is on protocols that …

Data sharing in cloud computing enables multiple participants to freely share the group data,
which improves the efficiency of work in cooperative environments and has widespread …

Despite two decades of intensive research, it remains a challenge to design a practical
anonymous two-factor authentication scheme, for the designers are confronted with an …

We present a formalism for the analysis of key-exchange protocols that combines previous
definitional approaches and results in a definition of security that enjoys some important …

Abstract Recently, Canetti and Krawczyk (Eurocrypt'2001) formulated a notion of security for
key-exchange (ke) protocols, called SK-security, and showed that this notion suffices for …

Our society has entered an era where commerce activities, business transactions and
government services have been, and more and more of them will be, conducted and offered …

The first edition of this book was published in 2003. Inevitably, certain parts of the book
became outdated quickly. At the same time new developments have continued apace …

Recent work by Krawczyk [12] and Menezes [16] has highlighted the importance of
understanding well the guarantees and limitations of formal security models when using …

The MQV protocol of Law, Menezes, Qu, Solinas and Vanstone is possibly the most efficient
of all known authenticated Diffie-Hellman protocols that use public-key authentication. In …

When designing password-authenticated key exchange protocols (as opposed to key
exchange protocols authenticated using crypto-graphically secure keys), one must not allow …