More efficient commitments from structured lattice assumptions
From MaRDI portal
Publication:1796807
DOI10.1007/978-3-319-98113-0_20OpenAlexW2886714247MaRDI QIDQ1796807
Vadim Lyubashevsky, Chris Peikert, Carsten Baum, Sabine Oechsner, Ivan B. Damgård
Publication date: 17 October 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-98113-0_20
Related Items
DualRing: generic construction of ring signatures with efficient instantiations ⋮ Lattice-based proof of shuffle and applications to electronic voting ⋮ Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment ⋮ A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs ⋮ SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions ⋮ Lattice-based zero-knowledge arguments for additive and multiplicative relations ⋮ A sub-linear lattice-based submatrix commitment scheme ⋮ Efficient lattice-based polynomial evaluation and batch ZK arguments ⋮ More efficient amortization of exact zero-knowledge proofs for LWE ⋮ Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications ⋮ Message-Restriction-Free Commitment Scheme Based on Lattice Assumption ⋮ More efficient construction of anonymous signatures ⋮ Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy ⋮ Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations ⋮ Lattice-based accumulator with constant time list update and constant time verification ⋮ Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ Practical sublinear proofs for R1CS from lattices ⋮ MuSig-L: lattice-based multi-signature with single-round online phase ⋮ A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling ⋮ Verifiable decryption in the head ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ Lattice-based inner product argument ⋮ Lattice-Based Proof of a Shuffle ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ Toward practical lattice-based proof of knowledge from Hint-MLWE ⋮ Practical exact proofs from lattices: new techniques to exploit fully-splitting rings ⋮ Lattice-based e-cash, revisited ⋮ Grid-Obstacle Representations with Connections to Staircase Guarding ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Shorter lattice-based zero-knowledge proofs via one-time commitments ⋮ Practical product proofs for lattice commitments ⋮ Covert authentication from lattices ⋮ Improved lattice-based mix-nets for electronic voting
