Efficient lattice-based polynomial evaluation and batch ZK arguments
From MaRDI portal
Publication:832321
DOI10.1007/978-3-030-81652-0_1zbMath1485.94101OpenAlexW3185217488MaRDI QIDQ832321
Ron Steinfeld, Joseph K. Liu, Veronika Kuchta, Amin Sakzad
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81652-0_1
Cites Work
- A verifiable secret shuffle of homomorphic encryptions
- On the concrete hardness of learning with errors
- Efficient batch zero-knowledge arguments for low degree polynomials
- Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (lattice ringct v1.0)
- More efficient commitments from structured lattice assumptions
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Lattice RingCT v2.0 with multiple input and multiple output wallets
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- Worst-case to average-case reductions for module lattices
- How to Prove Knowledge of Small Secrets
- Lattice Signatures without Trapdoors
- Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions
- Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- A new identification scheme based on syndrome decoding
- The knowledge complexity of interactive proof-systems
- Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
This page was built for publication: Efficient lattice-based polynomial evaluation and batch ZK arguments
