Lattice-based zero-knowledge arguments for integer relations
From MaRDI portal
Recommendations
- Lattice-based zero-knowledge arguments for additive and multiplicative relations
- Practical product proofs for lattice commitments
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Zero-knowledge range arguments for signed fractional numbers from lattices
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
Cited in
(13)- Lattice-based zero-knowledge arguments for additive and multiplicative relations
- Efficient lattice-based polynomial evaluation and batch ZK arguments
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
- Practical product proofs for lattice commitments
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Zero-knowledge range arguments for signed fractional numbers from lattices
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
- Multimodal private signatures
- Removing the strong RSA assumption from arguments over the integers
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
This page was built for publication: Lattice-based zero-knowledge arguments for integer relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784112)