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
Recommendations
Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Authentication, digital signatures and secret sharing (94A62)
Cited In (25)
- Title not available (Why is that?)
- Generating shorter bases for hard random lattices
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- On relationships between statistical zero-knowledge proofs
- On the power of statistical zero knowledge
- Oblivious transfer from weakly random self-reducible public-key cryptosystem
- The geometry of lattice cryptography
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- On basing search SIVP on \(\mathbf{NP}\)-hardness
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
- New (and old) proof systems for lattice problems
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Verifiable Decryption for Fully Homomorphic Encryption
- Advances in Cryptology - CRYPTO 2003
- A lattice-based group signature scheme with message-dependent opening
- On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness
- Cryptographic functions from worst-case complexity assumptions
- Multi-theorem preprocessing NIZKs from lattices
- Advances in Cryptology - ASIACRYPT 2003
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Zero-knowledge interactive proof systems for new lattice problems
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Title not available (Why is that?)
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)
