Quantum cryptography is arguably the fastest growing area in quantum information science.
Novel theoretical protocols are designed on a regular basis, security proofs are constantly …

Quantum cryptography is the art and science of exploiting quantum mechanical effects in
order to perform cryptographic tasks. While the most well-known example of this discipline is …

A succinct non-interactive argument of knowledge (SNARK) allows a prover to produce a
short proof that certifies the veracity of a certain NP-statement. In the last decade, a large …

Abstract The famous Fiat-Shamir transformation turns any public-coin three-round interactive
proof, ie, any so-called Σ-protocol, into a non-interactive proof in the random-oracle model …

We show the following hold, unconditionally unless otherwise stated, relative to a random
oracle:—There are NP search problems solvable by quantum polynomial-time (QPT) …

Abstract The Fiat-Shamir transform is a technique for combining a hash function and an
identification scheme to produce a digital signature scheme. The resulting scheme is known …

The demand for the digital monitoring of environmental ecosystems is high and growing
rapidly as a means of protecting the public and managing the environment. However, before …

In this paper, we present the lattice-based signature scheme Dilithium, which is a
component of the CRYSTALS (Cryptographic Suite for Algebraic Lattices) suite that was …

Pseudorandom functions (PRFs) are one of the foundational concepts in theoretical
computer science, with numerous applications in complexity theory and cryptography. In this …

Abstract The Fiat-Shamir transformation is a useful approach to building non-interactive
arguments (of knowledge) in the random oracle model. Unfortunately, existing proof …