Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428126
DOI10.1007/b11817zbMath1122.68448OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428126
Daniele Micciancio, Salil P. Vadhan
Publication date: 28 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11817
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (31)
Lattice-based key exchange on small integer solution problem ⋮ The inapproximability of lattice and coding problems with preprocessing ⋮ Lattice-based zero-knowledge arguments for additive and multiplicative relations ⋮ On basing search SIVP on \(\mathbf{NP}\)-hardness ⋮ A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties ⋮ Tightly secure signatures from lossy identification schemes ⋮ Zero-Knowledge Interactive Proof Systems for New Lattice Problems ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ A Novel Certificateless Multi-signature Scheme over NTRU Lattices ⋮ A novel identity-based multi-signature scheme over NTRU lattices ⋮ Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption ⋮ Lattice-based inner product argument ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ Adaptive zero-knowledge proofs and adaptively secure oblivious transfer ⋮ SZK proofs for black-box group problems ⋮ Zero-Knowledge Proofs of Proximity ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ A framework for non-interactive instance-dependent commitment schemes (NIC) ⋮ A lattice-based group signature scheme with verifier-local revocation ⋮ Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications ⋮ Generating shorter bases for hard random lattices ⋮ Cryptographic Functions from Worst-Case Complexity Assumptions ⋮ Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems ⋮ Unnamed Item ⋮ Lattice-Based Identification Schemes Secure Under Active Attacks ⋮ An Equivalence Between Zero Knowledge and Commitments ⋮ The Complexity of Zero Knowledge ⋮ Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures ⋮ (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
Uses Software
This page was built for publication: Advances in Cryptology - CRYPTO 2003
