A functional commitment allows a user to commit to an input $\mathbf{x} \in \{0,1\}^\ell$ and later open up the commitment to a value $y = f(\mathbf{x})$ with respect to some function $f$. In this work, we focus on schemes that support fast verification. Specifically, after a preprocessing step that depends only on $f$, the verification time as well as the size of the commitment and opening should be sublinear in the input length $\ell$, We also consider the dual setting where the user commits to the function $f$ and later, opens up the commitment at an input $\mathbf{x}$. In this work, we develop two (non-interactive) functional commitments that support fast verification. The first construction supports openings to constant-degree polynom...
We construct the first tightly secure signature schemes in the multi-user setting with adaptive corr...
International audienceA recent work of Sipasseuth, Plantard and Susilo proposed to accelerate lattic...
We present a general framework that converts certain types of linear collision-resistant hash functi...
Vector commitment schemes allow a user to commit to a vector of values $\mathbf{x} \in \{0,1\}^\ell$...
A *functional commitment* scheme enables a user to concisely commit to a function from a specified f...
A functional commitment (FC) scheme allows one to commit to a vector $\vec{x}$ and later produce a s...
Recent works on lattice-based extractable polynomial commitments can be grouped into two classes: (i...
Succinct arguments allow a prover to convince a verifier of the validity of any statement in a langu...
International audienceWe formalize a cryptographic primitive called functional commitment (FC) which...
Lattice-based cryptography is evolving rapidly and is often employed to design cryptographic primiti...
There has been a lot of recent progress in constructing efficient zero-knowledge proofs for showing ...
Driven by the open problem raised by Hofheinz and Kiltz (Journal of Cryptology, 2012), we study the ...
Higher-level cryptographic privacy-enhancing protocols such as anonymous credentials, voting schemes...
Building cryptographic schemes upon as many fundamentally different hard problems as possible, seems...
We construct a practical lattice-based zero-knowledge argument for proving multiplicative relations ...
We construct the first tightly secure signature schemes in the multi-user setting with adaptive corr...
International audienceA recent work of Sipasseuth, Plantard and Susilo proposed to accelerate lattic...
We present a general framework that converts certain types of linear collision-resistant hash functi...
Vector commitment schemes allow a user to commit to a vector of values $\mathbf{x} \in \{0,1\}^\ell$...
A *functional commitment* scheme enables a user to concisely commit to a function from a specified f...
A functional commitment (FC) scheme allows one to commit to a vector $\vec{x}$ and later produce a s...
Recent works on lattice-based extractable polynomial commitments can be grouped into two classes: (i...
Succinct arguments allow a prover to convince a verifier of the validity of any statement in a langu...
International audienceWe formalize a cryptographic primitive called functional commitment (FC) which...
Lattice-based cryptography is evolving rapidly and is often employed to design cryptographic primiti...
There has been a lot of recent progress in constructing efficient zero-knowledge proofs for showing ...
Driven by the open problem raised by Hofheinz and Kiltz (Journal of Cryptology, 2012), we study the ...
Higher-level cryptographic privacy-enhancing protocols such as anonymous credentials, voting schemes...
Building cryptographic schemes upon as many fundamentally different hard problems as possible, seems...
We construct a practical lattice-based zero-knowledge argument for proving multiplicative relations ...
We construct the first tightly secure signature schemes in the multi-user setting with adaptive corr...
International audienceA recent work of Sipasseuth, Plantard and Susilo proposed to accelerate lattic...
We present a general framework that converts certain types of linear collision-resistant hash functi...