Lattice-based inner product argument

DOI10.1007/978-3-031-17433-9_11MaRDI QIDQ6160829zbMATH OpenFDO

Authors Veronika Kuchta, Rajeev Anand Sahu, Gaurav Sharma

Publication date 2 June 2023

Published in Progress in Cryptology - AFRICACRYPT 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-17433-9_11

zbMATH Keywords

lattice-based cryptographyoptimized inner product argument

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 7540001
• scientific article; zbMATH DE number 3944543
• Computing a lattice basis revisited
• Lattice properties of subspace families in an inner product space
• Root product of lattices
• Lattice vector spaces and linear transformations
• scientific article; zbMATH DE number 3103212
• On the representation of the vector lattice
• Orthogonal decompositions and integral lattices
• Lattices of matrices

Cites work

• A compressed \(\varSigma \)-protocol theory for lattices
• A new identification scheme based on syndrome decoding
• A non-PCP approach to succinct quantum-safe zero-knowledge
• Advances in Cryptology - CRYPTO 2003
• Better zero-knowledge proofs for lattice encryption and their application to group signatures
• Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
• Efficient identity-based encryption over NTRU lattices
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Efficient zero-knowledge arguments from two-tiered homomorphic commitments
• Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
• Fully homomorphic SIMD operations
• How to prove knowledge of small secrets
• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 1775382 (Why is no real title available?)
• Lattice signatures and bimodal Gaussians
• Lattice signatures without trapdoors
• Linear Algebra with Sub-linear Zero-Knowledge Arguments
• More efficient commitments from structured lattice assumptions
• On lattices, learning with errors, random linear codes, and cryptography
• On the concrete hardness of learning with errors
• On the size of pairing-based non-interactive arguments
• Scalable zero knowledge with no trusted setup
• Short lattice-based one-out-of-many proofs and applications to ring signatures
• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
• The knowledge complexity of interactive proof-systems
• Zero-knowledge argument for polynomial evaluation with application to blacklists
• Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
• Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption

Cited in

(1)

• An optimized inner product argument with more application scenarios

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160829)