Efficient lattice-based polynomial evaluation and batch ZK arguments
From MaRDI portal
Recommendations
- Efficient batch zero-knowledge arguments for low degree polynomials
- Lattice-based zero-knowledge arguments for integer relations
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
Cites work
- A new identification scheme based on syndrome decoding
- A verifiable secret shuffle of homomorphic encryptions
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Efficient batch zero-knowledge arguments for low degree polynomials
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- How to prove knowledge of small secrets
- Lattice RingCT v2.0 with multiple input and multiple output wallets
- Lattice signatures without trapdoors
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- More efficient commitments from structured lattice assumptions
- On the concrete hardness of learning with errors
- Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (lattice ringct v1.0)
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- The knowledge complexity of interactive proof-systems
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Worst-case to average-case reductions for module lattices
- Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions
- Zero-knowledge argument for polynomial evaluation with application to blacklists
Cited in
(5)- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
- Zero-knowledge argument for polynomial evaluation with application to blacklists
- Fast LCF-Style Proof Reconstruction for Z3
- Efficient batch zero-knowledge arguments for low degree polynomials
- Concretely efficient lattice-based polynomial commitment from standard assumptions
This page was built for publication: Efficient lattice-based polynomial evaluation and batch ZK arguments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832321)
