Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems

DOI10.1007/978-3-540-85174-5_30zbMath1183.94045MaRDI QIDQ3600239

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

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

94A60: Cryptography

94A62: Authentication, digital signatures and secret sharing

Related Items

Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications, Unnamed Item, On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness, On the Power of Statistical Zero Knowledge, Cryptographic Functions from Worst-Case Complexity Assumptions, Multi-theorem preprocessing NIZKs from lattices, Verifiable Decryption for Fully Homomorphic Encryption, Generating shorter bases for hard random lattices, On basing search SIVP on \(\mathbf{NP}\)-hardness, Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption, (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, 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