Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems

DOI10.1007/978-3-540-85174-5_30MaRDI QIDQ3600239zbMATH OpenOpenAlexFDO

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

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) 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
• scientific article; zbMATH DE number 1418312
• Noninteractive Zero-Knowledge

Cited in

(27)

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

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)