Lattice-based inner product argument

Cites Work

Unnamed Item
Unnamed Item
On the concrete hardness of learning with errors
Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
More efficient commitments from structured lattice assumptions
A non-PCP approach to succinct quantum-safe zero-knowledge
A compressed \(\varSigma \)-protocol theory for lattices
Short lattice-based one-out-of-many proofs and applications to ring signatures
Scalable zero knowledge with no trusted setup
Fully homomorphic SIMD operations
How to Prove Knowledge of Small Secrets
Lattice Signatures and Bimodal Gaussians
Lattice Signatures without Trapdoors
Efficient Identity-Based Encryption over NTRU Lattices
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
Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
Linear Algebra with Sub-linear Zero-Knowledge Arguments
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
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
Advances in Cryptology - CRYPTO 2003
On the Size of Pairing-Based Non-interactive Arguments
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Lattice-based inner product argument