For a public value $y$ and a linear function $f$, giving a zero-knowledge proof of knowledge of a secret value $x$ that satisfies $f(x)=y$ is a key ingredient in many cryptographic protocols. Lattice-based constructions, in addition, require proofs of ``shortness\u27\u27 of $x$. Of particular interest are constructions where $f$ is a function over polynomial rings, since these are the ones that result in efficient schemes with short keys and outputs. All known approaches for such lattice-based zero-knowledge proofs are not very practical because they involve a basic protocol that needs to be repeated many times in order to achieve negligible soundness error. In the amortized setting, where one needs to give zero-knowledge proofs for man...
In applications of fully-homomorphic encryption (FHE) that involve computation on encryptions produc...
This work is focused on the description of one verifiable encryption scheme, specifically a zero-kno...
Lattice-based cryptography is one of the most active research topics in cryptography in recent years...
We propose a new zero-knowledge protocol for proving knowledge of short preimages under additively h...
We propose a practical zero-knowledge proof system for proving knowledge of short solutions s, e to ...
Zero-Knowledge proof is a very basic and important primitive, which allows a prover to prove some st...
A key component of many lattice-based protocols is a zeroknowledge proof of knowledge of a vector ~s...
There has been a lot of recent progress in constructing efficient zero-knowledge proofs for showing ...
We construct a practical lattice-based zero-knowledge argument for proving multiplicative relations ...
This PhD thesis is about practical lattice-based zero-knowledge proof systems. We construct protocol...
We propose a general technique that allows improving the complexity of zero-knowledge protocols for ...
We present efficient Zero-Knowledge Proofs of Knowledge (ZKPoK) for linear and multiplicative relati...
We propose the first zero-knowledge argument with sub-linear communication complexity for arithmetic...
Abstract. We propose a general technique that allows improving the complexity of zero-knowledge prot...
In~\cite{SSH} a Zero-Knowledge scheme $ZK(2)$ was designed from a solution of a set of multivariate ...
In applications of fully-homomorphic encryption (FHE) that involve computation on encryptions produc...
This work is focused on the description of one verifiable encryption scheme, specifically a zero-kno...
Lattice-based cryptography is one of the most active research topics in cryptography in recent years...
We propose a new zero-knowledge protocol for proving knowledge of short preimages under additively h...
We propose a practical zero-knowledge proof system for proving knowledge of short solutions s, e to ...
Zero-Knowledge proof is a very basic and important primitive, which allows a prover to prove some st...
A key component of many lattice-based protocols is a zeroknowledge proof of knowledge of a vector ~s...
There has been a lot of recent progress in constructing efficient zero-knowledge proofs for showing ...
We construct a practical lattice-based zero-knowledge argument for proving multiplicative relations ...
This PhD thesis is about practical lattice-based zero-knowledge proof systems. We construct protocol...
We propose a general technique that allows improving the complexity of zero-knowledge protocols for ...
We present efficient Zero-Knowledge Proofs of Knowledge (ZKPoK) for linear and multiplicative relati...
We propose the first zero-knowledge argument with sub-linear communication complexity for arithmetic...
Abstract. We propose a general technique that allows improving the complexity of zero-knowledge prot...
In~\cite{SSH} a Zero-Knowledge scheme $ZK(2)$ was designed from a solution of a set of multivariate ...
In applications of fully-homomorphic encryption (FHE) that involve computation on encryptions produc...
This work is focused on the description of one verifiable encryption scheme, specifically a zero-kno...
Lattice-based cryptography is one of the most active research topics in cryptography in recent years...