Lattice-based zero-knowledge arguments for additive and multiplicative relations
From MaRDI portal
Publication:831178
DOI10.1007/s10623-021-00851-1zbMath1469.94106OpenAlexW3134648573MaRDI QIDQ831178
Ron Steinfeld, Amin Sakzad, Veronika Kuchta, Joseph K. Liu
Publication date: 10 May 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00851-1
Cites Work
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
- Lattice-based zero-knowledge arguments for integer relations
- More efficient commitments from structured lattice assumptions
- 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
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- Implementation of the DKSS Algorithm for Multiplication of Large Numbers
- How to Prove Knowledge of Small Secrets
- Lattice Signatures without Trapdoors
- Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- 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
- Faster integer multiplication using plain vanilla FFT primes
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Advances in Cryptology - CRYPTO 2003
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
This page was built for publication: Lattice-based zero-knowledge arguments for additive and multiplicative relations
