On basing search SIVP on \(\mathbf{NP}\)-hardness
type: Item
instance of: scholarly article
title: On basing search SIVP on \(\mathbf{NP}\)-hardness
zbMATH Open document ID: 1443.94070
DOI: 10.1007/978-3-030-03807-6_4
author: Tianren Liu
publication date: 2018-12-11T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6992088
zbMATH Keywords: complexity-theoretic cryptography
zbMATH Keywords: approximate shortest independent vector problem (SIVP)
MaRDI profile type: Publication
full work available at URL: 978-3-030-03807-6 4
OpenAlex ID: W2572119822
cites work: On basing one-way functions on NP-hardness
cites work: Q4228459
cites work: New bounds in some transference theorems in the geometry of numbers
cites work: On Basing Size-Verifiable One-Way Functions on NP-Hardness
cites work: Limits of Provable Security for Homomorphic Encryption
cites work: Classical hardness of learning with errors
cites work: Relativized cryptography
cites work: On the complexity of computing short linearly independent vectors and short bases in a lattice
cites work: On Worst‐Case to Average‐Case Reductions for NP Problems
cites work: On the limits of nonapproximability of lattice problems
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: On Basing Private Information Retrieval on NP-Hardness
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
cites work: On lattices, learning with errors, random linear codes, and cryptography
description: scientific article; zbMATH DE number 6992088