Computer security encompasses concepts and methods for protecting sensitive resources in
computer systems. Computer security starts from the policies that regulate access to …

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 …

This is the second edition of Understanding Cryptography. Ever since we released the first
edition in 2009, we have been humbled by the many positive responses we received from …

In recent years, lattice-based cryptography has been recognized for its many attractive
properties, such as strong provable security guarantees and apparent resistance to quantum …

We describe Charm, an extensible framework for rapidly prototyping cryptographic systems.
Charm provides a number of features that explicitly support the development of new …

Background Elliptic curve cryptographic schemes were proposed independently in 1985 by
Neal Koblitz (Koblitz 1987) and Victor Miller (Miller 1986). They are the elliptic curve …

In spite of the central role of key derivation functions (KDF) in applied cryptography, there
has been little formal work addressing the design and analysis of general multi-purpose …

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 …

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 …