Recent progress in quantum computers severely endangers the security of widely used
public-key cryptosystems and of all communication that relies on it. Thus, the US NIST is …

Abstract Zero-Knowledge (ZK) Proofs for disjunctive statements have been a focus of a long
line of research. Classical results such as Cramer et al.[CRYPTO'94] and Abe et al.[AC'02] …

Building on recent compilers for efficient disjunctive composition (eg an OR of multiple
clauses) of zero-knowledge proofs (eg Goel et al.[EUROCRYPT'22]) we propose a new …

Classical cryptographic schemes in use today are based on the difficulty of certain number
theoretic problems. Security is guaranteed by the fact that the computational work required …

Existing protocols for proving the correct execution of a RAM program in zero-knowledge are
plagued by a processor expressiveness tradeoff: supporting fewer instructions results in …

Set membership proofs are an invaluable part of privacy preserving systems. These proofs
allow a prover to demonstrate knowledge of a witness $ w $ corresponding to a secret …

We consider the problem of proving in zero-knowledge the existence of vulnerabilities in
executables compiled to run on real-world processors. We demonstrate that it is practical to …

Efficiency is paramount when designing cryptographic protocols, heavy mathematical
operations often increase computation time, even for modern computers. Moreover, they …

We propose a new concept of (post-quantum) digital signature algorithm derived from a
symmetric cipher. Key derivation is based on a system of Multiple-Right-Hand-Sides …

Abstract Zero-Knowledge (ZK) Proofs for disjunctive statements have been a focus of a long
line of research. Classical results such as Cramer et al.[CRYPTO'94] and Abe et al.[AC'02] …