Practical product proofs for lattice commitments
type: Item
instance of: scholarly article
title: Practical product proofs for lattice commitments
zbMATH Open document ID: 1504.94096
DOI: 10.1007/978-3-030-56880-1_17
author: Thomas Attema
author: Vadim Lyubashevsky
author: Gregor Seiler
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 7614577
zbMATH Keywords: lattice-based zero-knowledge
MaRDI profile type: Publication
full work available at URL: 978-3-030-56880-1 17
OpenAlex ID: W3031397331
cites work: New bounds in some transference theorems in the geometry of numbers
cites work: More efficient commitments from structured lattice assumptions
cites work: Fast Reed-Solomon Interactive Oracle Proofs of Proximity
cites work: Aurora: transparent succinct arguments for R1CS
cites work: Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
cites work: Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
cites work: Cut-off phenomenon for the \(ax+b\) Markov chain over a finite field
cites work: Security considerations for Galois non-dual RLWE families
cites work: Random walks arising in random number generation
cites work: Q3995195
cites work: Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
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: On the Chung-Diaconis-Graham random process
cites work: Worst-case to average-case reductions for module lattices
cites work: Lattice-based zero-knowledge arguments for integer relations
cites work: Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
cites work: Lattice Signatures without Trapdoors
cites work: Generalized Compact Knapsacks Are Collision Resistant
cites work: On Ideal Lattices and Learning with Errors over Rings
cites work: Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
cites work: Computationally Sound Proofs
cites work: Theory of Cryptography
cites work: Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
description: scientific article; zbMATH DE number 7614577