International audienceWe provide lattice-based protocols allowing to prove relations among committed integers. While the most general zero-knowledge proof techniques can handle arithmetic circuits in the lattice setting, adapting them to prove statements over the integers is non-trivial, at least if we want to handle exponentially large integers while working with a polynomial-size modulus q. For a polynomial L, we provide zero-knowledge arguments allowing a prover to convince a verifier that committed L-bit bitstrings x, y and z are the binary representations of integers X, Y and Z satisfying Z = X + Y over Z. The complexity of our arguments is only linear in L. Using them, we construct arguments allowing to prove inequalities X < Z among ...
We construct a perfectly binding string commitment scheme whose security is based on the learning pa...
We provide a zero-knowledge argument for arithmetic circuit satisfiability with a communication comp...
We construct a perfectly binding string commitment scheme whose security is based on the learning pa...
International audienceWe provide lattice-based protocols allowing to prove relations among committed...
We construct a practical lattice-based zero-knowledge argument for proving multiplicative relations ...
We propose the first zero-knowledge argument with sub-linear communication complexity for arithmetic...
Today\u27s most compact zero-knowledge arguments are based on the hardness of the discrete logarithm...
Committing integers and proving relations between them is an essential ingredient in many cryptograp...
We give computationally efficient zero-knowledge proofs of knowledge for arithmetic circuit satisfia...
This PhD thesis is about practical lattice-based zero-knowledge proof systems. We construct protocol...
Compressed Σ-Protocol Theory (CRYPTO 2020) presents an “alternative” to Bulletproofs that achieves t...
This paper presents the first efficient statistical zero-knowledge protocols to prove statements suc...
International audienceAn accumulator is a function that hashes a set of inputs into a short, constan...
International audienceZero-knowledge elementary databases (ZK-EDBs) are cryptographic schemes that a...
We present a cryptographic string commitment scheme that is computationally hiding and binding based...
We construct a perfectly binding string commitment scheme whose security is based on the learning pa...
We provide a zero-knowledge argument for arithmetic circuit satisfiability with a communication comp...
We construct a perfectly binding string commitment scheme whose security is based on the learning pa...
International audienceWe provide lattice-based protocols allowing to prove relations among committed...
We construct a practical lattice-based zero-knowledge argument for proving multiplicative relations ...
We propose the first zero-knowledge argument with sub-linear communication complexity for arithmetic...
Today\u27s most compact zero-knowledge arguments are based on the hardness of the discrete logarithm...
Committing integers and proving relations between them is an essential ingredient in many cryptograp...
We give computationally efficient zero-knowledge proofs of knowledge for arithmetic circuit satisfia...
This PhD thesis is about practical lattice-based zero-knowledge proof systems. We construct protocol...
Compressed Σ-Protocol Theory (CRYPTO 2020) presents an “alternative” to Bulletproofs that achieves t...
This paper presents the first efficient statistical zero-knowledge protocols to prove statements suc...
International audienceAn accumulator is a function that hashes a set of inputs into a short, constan...
International audienceZero-knowledge elementary databases (ZK-EDBs) are cryptographic schemes that a...
We present a cryptographic string commitment scheme that is computationally hiding and binding based...
We construct a perfectly binding string commitment scheme whose security is based on the learning pa...
We provide a zero-knowledge argument for arithmetic circuit satisfiability with a communication comp...
We construct a perfectly binding string commitment scheme whose security is based on the learning pa...