We extend a commitment scheme based on the learning with errors over rings (RLWE) problem, and present efficient companion zeroknowledge proofs of knowledge. Our scheme maps elements from the ring (or equivalently, n elements fro
We propose a new zero-knowledge protocol for proving knowledge of short preimages under additively h...
Today\u27s most compact zero-knowledge arguments are based on the hardness of the discrete logarithm...
Abstract. Even though Zero-knowledge has existed for more than 30 years, few generic constructions f...
We extend a commitment scheme based on the learning with errors over rings (RLWE) problem, and prese...
Abstract. We design an efficient commitment scheme, and companion zero-knowledge proofs of knowledge...
Zero-Knowledge proof is a very basic and important primitive, which allows a prover to prove some st...
We present efficient Zero-Knowledge Proofs of Knowledge (ZKPoK) for linear and multiplicative relati...
We construct a perfectly binding string commitment scheme whose security is based on the learning pa...
We construct a perfectly binding string commitment scheme whose security is based on the learning pa...
We give computationally efficient zero-knowledge proofs of knowledge for arithmetic circuit satisfia...
We construct a practical lattice-based zero-knowledge argument for proving multiplicative relations ...
We present a zero-knowledge proof system [19] for any NP language L, whichallows showing that x in L...
Abstract. We study the question whether the number of rounds in public-coin perfect zero-knowledge (...
With the recent emergence of efficient zero-knowledge (ZK) proofs for general circuits, while effici...
There has been a lot of recent progress in constructing efficient zero-knowledge proofs for showing ...
We propose a new zero-knowledge protocol for proving knowledge of short preimages under additively h...
Today\u27s most compact zero-knowledge arguments are based on the hardness of the discrete logarithm...
Abstract. Even though Zero-knowledge has existed for more than 30 years, few generic constructions f...
We extend a commitment scheme based on the learning with errors over rings (RLWE) problem, and prese...
Abstract. We design an efficient commitment scheme, and companion zero-knowledge proofs of knowledge...
Zero-Knowledge proof is a very basic and important primitive, which allows a prover to prove some st...
We present efficient Zero-Knowledge Proofs of Knowledge (ZKPoK) for linear and multiplicative relati...
We construct a perfectly binding string commitment scheme whose security is based on the learning pa...
We construct a perfectly binding string commitment scheme whose security is based on the learning pa...
We give computationally efficient zero-knowledge proofs of knowledge for arithmetic circuit satisfia...
We construct a practical lattice-based zero-knowledge argument for proving multiplicative relations ...
We present a zero-knowledge proof system [19] for any NP language L, whichallows showing that x in L...
Abstract. We study the question whether the number of rounds in public-coin perfect zero-knowledge (...
With the recent emergence of efficient zero-knowledge (ZK) proofs for general circuits, while effici...
There has been a lot of recent progress in constructing efficient zero-knowledge proofs for showing ...
We propose a new zero-knowledge protocol for proving knowledge of short preimages under additively h...
Today\u27s most compact zero-knowledge arguments are based on the hardness of the discrete logarithm...
Abstract. Even though Zero-knowledge has existed for more than 30 years, few generic constructions f...
DOI
Add to ORKG