Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems

DOI10.1007/978-3-540-85174-5_30zbMATH Open1183.94045OpenAlexW20286062MaRDI QIDQ3600239FDOQ3600239

Authors Chris Peikert, Vinod Vaikuntanathan

Publication date 10 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85174-5_30

Mathematics Subject Classification ID

Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Advances in Cryptology - CRYPTO 2003
• New (and old) proof systems for lattice problems
• Zero-knowledge interactive proof systems for new lattice problems
• Publication:4941874
• Noninteractive Zero-Knowledge

Cited in

(25)

• Advances in Cryptology - ASIACRYPT 2003
• Quantum lower bounds for approximate counting via Laurent polynomials
• Toward non-interactive zero-knowledge proofs for NP from LWE
• Oblivious transfer from weakly random self-reducible public-key cryptosystem
• A new Gaussian sampling for trapdoor lattices with arbitrary modulus
• A lattice-based group signature scheme with message-dependent opening
• On basing search SIVP on \(\mathbf{NP}\)-hardness
• The geometry of lattice cryptography
• Public-coin statistical zero-knowledge batch verification against malicious verifiers
• scientific article; zbMATH DE number 1418312 (Why is no real title available?)
• Cryptographic functions from worst-case complexity assumptions
• On relationships between statistical zero-knowledge proofs
• (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Advances in Cryptology - CRYPTO 2003
• Zero-knowledge interactive proof systems for new lattice problems
• Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
• Verifiable Decryption for Fully Homomorphic Encryption
• Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
• Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
• Multi-theorem preprocessing NIZKs from lattices
• Generating shorter bases for hard random lattices
• New (and old) proof systems for lattice problems
• On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
• On the power of statistical zero knowledge

This page was built for publication: Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems

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