More efficient commitments from structured lattice assumptions
From MaRDI portal
Recommendations
- Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
- Succinct vector, polynomial, and functional commitments from lattices
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
- Highly-efficient universally-composable commitments based on the DDH assumption
- scientific article; zbMATH DE number 1030983
- Efficient commitment schemes with bounded sender and unbounded receiver
- Compact and efficient UC commitments under atomic-exchanges
- scientific article; zbMATH DE number 1759793
- Efficient non-malleable commitment schemes
- Efficient non-malleable commitment schemes
Cited in
(47)- Lattice-based proof of shuffle and applications to electronic voting
- BLOOM: bimodal lattice one-out-of-many proofs and applications
- Improved lattice-based mix-nets for electronic voting
- 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
- Lattice-Based Proof of a Shuffle
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- Lattice-based inner product argument
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- Practical product proofs for lattice commitments
- Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Lattice-based accumulator with constant time list update and constant time verification
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
- More efficient amortization of exact zero-knowledge proofs for LWE
- Practical sublinear proofs for R1CS from lattices
- Message-restriction-free commitment scheme based on lattice assumption
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- DualRing: generic construction of ring signatures with efficient instantiations
- Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
- Toward practical lattice-based proof of knowledge from Hint-MLWE
- Lattice-based e-cash, revisited
- Ring/module learning with errors under linear leakage -- hardness and applications
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
- MuSig-L: lattice-based multi-signature with single-round online phase
- Lattice-based threshold, accountable, and private signature
- Short zero-knowledge proof of knowledge for lattice-based commitment
- More efficient construction of anonymous signatures
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Forward-Secure Group Encryptions from Lattices
- Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme
- Reusable online-efficient commitments
- Lattice-based zero-knowledge proofs in action: applications to electronic voting
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Verifiable decryption in the head
- Vector commitments over rings and compressed \(\varSigma \)-protocols
- Grid-obstacle representations with connections to staircase guarding
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
- Covert authentication from lattices
- Commitments with efficient zero-knowledge arguments from subset sum problems
- Lattice-based key-value commitment scheme with key-binding and key-hiding properties
This page was built for publication: More efficient commitments from structured lattice assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1796807)
