On basing search SIVP on \(\mathbf{NP}\)-hardness

DOI10.1007/978-3-030-03807-6_4zbMath1443.94070OpenAlexW2572119822MaRDI QIDQ1629401

Tianren Liu

Publication date: 11 December 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-03807-6_4

zbMATH Keywords

approximate shortest independent vector problem (SIVP)complexity-theoretic cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• New bounds in some transference theorems in the geometry of numbers
• On the limits of nonapproximability of lattice problems
• On Basing Private Information Retrieval on NP-Hardness
• On the complexity of computing short linearly independent vectors and short bases in a lattice
• Limits of Provable Security for Homomorphic Encryption
• On basing one-way functions on NP-hardness
• Trapdoors for hard lattices and new cryptographic constructions
• Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
• Relativized cryptography
• On Basing Size-Verifiable One-Way Functions on NP-Hardness
• Advances in Cryptology - CRYPTO 2003
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Classical hardness of learning with errors
• On Worst‐Case to Average‐Case Reductions for NP Problems
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: On basing search SIVP on \(\mathbf{NP}\)-hardness