Jan 22, 2024 · In this work, we propose two novel succinct one-out-of-many proofs from coding theory, which can be seen as extensions of the Stern's framework ...
Apr 14, 2024 · We propose two novel succinct one-out-of-many proofs from coding theory, which can be seen as extensions of the Stern's framework and Veron's framework.
In this work, we propose two novel succinct one-out-of-many proofs from coding theory, which can be seen as extensions of the Stern's framework and Veron's ...
In this work, we construct a short one-out-of-many proof from (module) lattices, allowing one to prove knowledge of a secret associated with one of the ...
In this work, we construct a short one-out-of-many proof from (module) lattices, allowing one to prove knowledge of a secret associated with one of the ...
In this work, we construct a short one-out-of-many proof from (module) lattices, allowing one to prove knowledge of a secret associated with one of the ...
SDitH's hardness is based on conservative code-based assumptions, and it uses ... Short Code-Based One-out-of-Many Proofs and Applications. Chapter. Apr 2024.
54 References · Short Lattice-based One-out-of-Many Proofs and Applications to Ring Signatures · One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin.
Missing: Code- | Show results with:Code-
A zero-knowledge proof or zero-knowledge protocol is a method by which one party (the prover) can prove to another party (the verifier) that some given ...
Code-based signatures from new proofs of knowledge for the syndrome decoding problem · List of references · Publications that cite this publication.