Efficient lattice-based polynomial evaluation and batch ZK arguments
type: Item
instance of: scholarly article
title: Efficient lattice-based polynomial evaluation and batch ZK arguments
zbMATH Open document ID: 1485.94101
DOI: 10.1007/978-3-030-81652-0_1
author: Veronika Kuchta
author: Amin Sakzad
author: Ron Steinfeld
author: Joseph K. Liu
publication date: 2022-03-25T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7498214
zbMATH Keywords: sigma-protocol
zbMATH Keywords: zero-knowledge argument
zbMATH Keywords: arithmetic circuit
zbMATH Keywords: discrete logarithm assumption
MaRDI profile type: Publication
full work available at URL: 978-3-030-81652-0 1
OpenAlex ID: W3185217488
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: Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
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: Efficient batch zero-knowledge arguments for low degree polynomials
cites work: Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions
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: The knowledge complexity of interactive proof-systems
cites work: Linear Algebra with Sub-linear Zero-Knowledge Arguments
cites work: A verifiable secret shuffle of homomorphic encryptions
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: A new identification scheme based on syndrome decoding
cites work: Lattice RingCT v2.0 with multiple input and multiple output wallets
cites work: Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (lattice ringct v1.0)
description: scientific article; zbMATH DE number 7498214