Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions
From MaRDI portal
Recommendations
- On the Amortized Complexity of Zero-Knowledge Protocols
- On the amortized complexity of zero-knowledge protocols
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- scientific article; zbMATH DE number 708807
- On the communication complexity of zero-knowledge proofs
- More efficient amortization of exact zero-knowledge proofs for LWE
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Short zero-knowledge proof of knowledge for lattice-based commitment
- On the amortized complexity of zero knowledge protocols for multiplicative relations
Cited in
(10)- Amortization with fewer equations for proving knowledge of small secrets
- A compressed \(\varSigma \)-protocol theory for lattices
- More efficient amortization of exact zero-knowledge proofs for LWE
- RLWE-based zero-knowledge proofs for linear and multiplicative relations
- Short discrete log proofs for FHE and ring-LWE ciphertexts
- Zero-knowledge protocols for the McEliece encryption
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Mixed-technique multi-party computations composed of two-party computations
- Toward practical lattice-based proof of knowledge from Hint-MLWE
- Efficient lattice-based polynomial evaluation and batch ZK arguments
This page was built for publication: Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912785)
