Zero-knowledge proofs from spLWE-based commitments
From MaRDI portal
Recommendations
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Efficient generic zero-knowledge proofs from commitments (extended abstract)
- Short zero-knowledge proof of knowledge for lattice-based commitment
- RLWE-based zero-knowledge proofs for linear and multiplicative relations
- Commitments and efficient zero-knowledge proofs from learning parity with noise
Cites work
- An improved compression technique for signatures based on learning with errors
- Better key sizes (and attacks) for LWE-based encryption
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Coin flipping by telephone a protocol for solving impossible problems
- Commitments and efficient zero-knowledge proofs from learning parity with noise
- Efficient signature generation by smart cards
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\)
- Lattice signatures without trapdoors
- Multiparty computation with low communication, computation and interaction via threshold FHE
- On lattices, learning with errors, random linear codes, and cryptography
Cited in
(2)
This page was built for publication: Zero-knowledge proofs from spLWE-based commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5083085)
