Lattice-based zero-knowledge arguments for additive and multiplicative relations
type: Item
instance of: scholarly article
title: Lattice-based zero-knowledge arguments for additive and multiplicative relations
zbMATH Open document ID: 1469.94106
author: Veronika Kuchta
author: Amin Sakzad
author: Ron Steinfeld
author: Joseph K. Liu
published in: Designs, Codes and Cryptography
publication date: 2021-05-10T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7346962
zbMATH Keywords: zero-knowledge argument
zbMATH Keywords: integer addition and multiplication protocols
zbMATH Keywords: SIS assumption
MaRDI profile type: Publication
full work available at URL: s10623-021-00851-1
OpenAlex ID: W3134648573
cites work: On the concrete hardness of learning with errors
cites work: How to Prove Knowledge of Small Secrets
cites work: More efficient commitments from structured lattice assumptions
cites work: Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists
cites work: Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
cites work: Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
cites work: Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
cites work: An Algorithm for the Machine Calculation of Complex Fourier Series
cites work: Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
cites work: Short lattice-based one-out-of-many proofs and applications to ring signatures
cites work: Q4542514
cites work: The knowledge complexity of interactive proof-systems
cites work: Faster integer multiplication using plain vanilla FFT primes
cites work: Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
cites work: Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
cites work: Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
cites work: Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
cites work: Lattice-based zero-knowledge arguments for integer relations
cites work: Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
cites work: Implementation of the DKSS algorithm for multiplication of large numbers
cites work: Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
cites work: Lattice Signatures without Trapdoors
cites work: Advances in Cryptology - CRYPTO 2003
cites work: A new identification scheme based on syndrome decoding
cites work: Q5601777
cites work: Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
DOI: 10.1007/S10623-021-00851-1
Recommended article: Lattice-based zero-knowledge arguments for integer relations
Recommended article: Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
Recommended article: RLWE-based zero-knowledge proofs for linear and multiplicative relations
Recommended article: Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
Recommended article: Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
Recommended article: Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
Recommended article: On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations
Recommended article: Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
Recommended article: Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
Recommended article: Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
description: scientific article; zbMATH DE number 7346962