We give new methods for generating and using “strong trapdoors” in cryptographic lattices,
which are simultaneously simple, efficient, easy to implement (even in parallel), and …

Most lattice-based cryptographic schemes are built upon the assumed hardness of the Short
Integer Solution (SIS) and Learning With Errors (LWE) problems. Their efficiencies can be …

This survey reviews the two most prominent group-oriented anonymous signature schemes
and analyzes the existing approaches for their problem: balancing anonymity against …

The interest in post-quantum cryptography—classical systems that remain secure in the
presence of a quantum adversary—has generated elegant proposals for new cryptosystems …

An accumulator is a function that hashes a set of inputs into a short, constant-size string
while preserving the ability to efficiently prove the inclusion of a specific input element in the …

Lattice-based digital signature has become one of the widely recognized post-quantum
algorithms because of its simple algebraic operation, rich mathematical foundation and …

We present the first leveled fully homomorphic encryption scheme for quantum circuits with
classical keys. The scheme allows a classical client to blindly delegate a quantum …

Message authentication has been a research hotspot in current vehicular ad hoc networks
(VANETs). Many researchers adopt group signatures based on number-theoretic …

We give the first proof of security for an identity-based encryption (IBE) scheme in the
quantum random oracle model. This is the first proof of security for any scheme in this model …

As we move into a new decade, the global world of Intelligent Infrastructure (II) services
integrated into the Internet of Things (IoT) are at the forefront of technological advancements …