Shorter lattice-based zero-knowledge proofs via one-time commitments
type: Item
instance of: scholarly article
title: Shorter lattice-based zero-knowledge proofs via one-time commitments
zbMATH Open document ID: 1479.94232
DOI: 10.1007/978-3-030-75245-3_9
author: Vadim Lyubashevsky
author: Ngoc Khanh Nguyen
author: Gregor Seiler
publication date: 2021-12-21T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7450181
zbMATH Keywords: commit-and-prove protocols
zbMATH Keywords: quantum-safe privacy-based protocols
MaRDI profile type: Publication
full work available at URL: 978-3-030-75245-3 9
OpenAlex ID: W3164004061
cites work: Revisiting the expected cost of solving uSVP and applications to LWE
cites work: On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
cites work: Practical product proofs for lattice commitments
cites work: Circular and KDM Security for Identity-Based Encryption
cites work: On the concrete hardness of learning with errors
cites work: New bounds in some transference theorems in the geometry of numbers
cites work: Hardness of LWE on general entropic distributions
cites work: More efficient commitments from structured lattice assumptions
cites work: Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
cites work: Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
cites work: Universally composable two-party and multi-party secure computation
cites work: LWE with side information: attacks and concrete security estimation
cites work: Lattice Signatures and Bimodal Gaussians
cites work: Public-Key Encryption Schemes with Auxiliary Inputs
cites work: Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
cites work: Fine-Tuning Groth-Sahai Proofs
cites work: Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
cites work: Q3840170
cites work: A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
cites work: Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
cites work: Worst-case to average-case reductions for module lattices
cites work: Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
cites work: Lattice Signatures without Trapdoors
cites work: Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
cites work: Bi-Deniable Public-Key Encryption
cites work: A new identification scheme based on syndrome decoding
cites work: Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment
cites work: Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
description: scientific article; zbMATH DE number 7450181