The latest quantum computers have the ability to solve incredibly complex classical
cryptography equations particularly to decode the secret encrypted keys and making the …

We put forward a new algebraic framework to generalize and analyze Diffie–Hellman like
decisional assumptions which allows us to argue about security and applications by …

We present the first fully secure Identity-Based Encryption scheme (IBE) from the standard
assumptions where the security loss depends only on the security parameter and is …

The Internet of Things (IoT) is an emerging networking paradigm connecting billions of
devices securely to the Internet. Another emerging paradigm is quantum computing which …

We present the first CCA-secure public-key encryption scheme based on DDH where the
security loss is independent of the number of challenge ciphertexts and the number of …

Abstract Structure-preserving signatures (SPS) are signature schemes where messages,
signatures and public keys all consist of elements of a group over which a bilinear map is …

We construct the first Authenticated Key Exchange (AKE) protocol whose security does not
degrade with an increasing number of users or sessions. We describe a three-message …

This paper presents efficient structure-preserving signature schemes based on simple
assumptions such as decisional linear. We first give two general frameworks for constructing …

The existence of tight reductions in cryptographic security proofs is an important question,
motivated by the theoretical search for cryptosystems whose security guarantees are truly …

Tight security is increasingly gaining importance in real-world cryptography, as it allows to
choose cryptographic parameters in a way that is supported by a security proof, without the …