Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
From MaRDI portal
Recommendations
- Commitments and efficient zero-knowledge proofs from learning parity with noise
- Efficient generic zero-knowledge proofs from commitments (extended abstract)
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
- Round-optimal perfect zero-knowledge proofs
- Efficient zero-knowledge proofs. (Abstract)
- Zero knowledge with efficient provers
- Round-optimal zero-knowledge proofs of knowledge for NP
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Post-quantum zero-knowledge proofs for accumulators with applications to ring signatures from symmetric-key primitives
Cited in
(33)- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Practical product proofs for lattice commitments
- Covert authentication from lattices
- Improved lattice-based mix-nets for electronic voting
- Compact ring signatures from learning with errors
- A compressed \(\varSigma \)-protocol theory for lattices
- Asymptotically quasi-optimal cryptography
- RLWE-based zero-knowledge proofs for linear and multiplicative relations
- Short discrete log proofs for FHE and ring-LWE ciphertexts
- Commitments and efficient zero-knowledge proofs from learning parity with noise
- Short zero-knowledge proof of knowledge for lattice-based commitment
- Zero-knowledge proofs from spLWE-based commitments
- Message-restriction-free commitment scheme based on lattice assumption
- On the security of the multivariate ring learning with errors problem
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- 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
- Lattice-Based Proof of a Shuffle
- Vector commitments over rings and compressed -protocols
- Doubly efficient interactive proofs over infinite and non-commutative rings
- Toward practical lattice-based proof of knowledge from Hint-MLWE
- Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
- Commitments with efficient zero-knowledge arguments from subset sum problems
- Malleable commitments from group actions and zero-knowledge proofs for circuits based on isogenies
- Reusable online-efficient commitments
- Lattice-based zero-knowledge proofs in action: applications to electronic voting
- MDKG: module-lattice-based distributed key generation
- Generic construction of threshold ring signatures and lattice-based instantiations
- Adaptor signatures: new security definition and a generic construction for NP relations
- A note on short invertible ring elements and applications to cyclotomic and trinomials number fields
- Lattice-based zero-knowledge arguments for additive and multiplicative relations
- Efficient lattice-based polynomial evaluation and batch ZK arguments
This page was built for publication: Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097051)
