Oct 20, 2016 · We present a practical construction of an additively homomorphic commitment scheme based on structured lattice assumptions, together with a zero ...
Aug 3, 2018 · We propose a commitment scheme that allows to commit to vectors over polynomial rings, as well as associated zero-knowledge proofs of knowledge ...
We present a practical construction of an additively homomorphic commitment scheme based on structured lattice assumptions, together with a zero-knowledge ...
We present a practical construction of an additively homomorphic commitment scheme based on structured lattice assumptions, together with a zero-knowledge ...
Oct 14, 2021 · Bibliographic details on More Efficient Commitments from Structured Lattice Assumptions.
Fingerprint. Dive into the research topics of 'More efficient commitments from structured lattice assumptions'. Together they form a unique fingerprint.
Feb 20, 2019 · I'm wondering that is there any equivocal commitment scheme (ie, trapdoor commitment) can be constructed from lattice-based assumptions?
Note: having short commitments + openings does not imply fast verification (e.g., verification procedure in [WW23] basically evaluates f on the commitment).
Aug 18, 2024 · More Efficient Commitments from Structured Lattice Assumptions: 11th International Conference, SCN 2018, Amalfi, Italy, September 5–7, 2018 ...
Duration: 31:21
Posted: May 23, 2024
Posted: May 23, 2024
Missing: Efficient Structured