Imagen de Portada

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Aggarwal, Divesh, Chen, Yanlin, Kumar, Rajendra, Shen, Yixin
Formato:	Preprint
Publicado:	2020
Materias:	Data Structures and Algorithms Cryptography and Security
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the Maximum Distance Sublattice Problem and Closest Vector Problem
por: Kumar, Rajendra, et al.
Publicado: (2018)

Mind the Gap? Not for SVP Hardness under ETH!
por: Aggarwal, Divesh, et al.
Publicado: (2025)

Improved Lower Bound for Differentially Private Facility Location
por: Manurangsi, Pasin
Publicado: (2024)

Improving Algorithmic Efficiency using Cryptography
por: Vaikuntanathan, Vinod, et al.
Publicado: (2025)

Improved Differentially Private Algorithms for Rank Aggregation
por: Hillebrand, Quentin, et al.
Publicado: (2025)

Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum: Modular Arithmetic Approach
por: Joux, Antoine, et al.
Publicado: (2024)

The Planted Orthogonal Vectors Problem
por: Kühnemann, David, et al.
Publicado: (2025)

Packing Entries to Diagonals for Homomorphic Sparse-Matrix Vector Multiplication
por: Mutluergil, Kemal, et al.
Publicado: (2026)

Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
por: Dhulipala, Laxman, et al.
Publicado: (2025)

Private Synthetic Data Generation in Bounded Memory
por: Holland, Rayne, et al.
Publicado: (2024)

Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting Fingerprinting Codes
por: Peter, Naty, et al.
Publicado: (2023)

Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph
por: Henzinger, Monika, et al.
Publicado: (2024)

Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization
por: Ghazi, Badih, et al.
Publicado: (2024)

Fine-Grained Privacy Guarantees for Coverage Problems
por: Dhulipala, Laxman, et al.
Publicado: (2024)

On Wagner's k-Tree Algorithm Over Integers
por: Lin, Haoxing, et al.
Publicado: (2024)

Sublinear Space Graph Algorithms in the Continual Release Model
por: Epasto, Alessandro, et al.
Publicado: (2024)

An Affine Equivalence Algorithm for S-boxes based on Matrix Invariants
por: Hu, Xincheng, et al.
Publicado: (2024)

Differentially Private Algorithms for Graphs Under Continual Observation
por: Fichtenberger, Hendrik, et al.
Publicado: (2021)

Fully Dynamic Graph Algorithms with Edge Differential Privacy
por: Raskhodnikova, Sofya, et al.
Publicado: (2024)

Wagner's Algorithm Provably Runs in Subexponential Time for SIS$^\infty$
por: Ducas, Léo, et al.
Publicado: (2025)

Almost Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy
por: Dong, Wei, et al.
Publicado: (2024)

Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
por: Chandra, Rishi, et al.
Publicado: (2024)

Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
por: Cummings, Rachel, et al.
Publicado: (2025)

Scalable Private Partition Selection via Adaptive Weighting
por: Chen, Justin Y., et al.
Publicado: (2025)

PREAMBLE: Private and Efficient Aggregation via Block Sparse Vectors
por: Asi, Hilal, et al.
Publicado: (2025)

Keeping a Secret Requires a Good Memory: Space Lower-Bounds for Private Algorithms
por: Epasto, Alessandro, et al.
Publicado: (2026)

On Computing Pairwise Statistics with Local Differential Privacy
por: Ghazi, Badih, et al.
Publicado: (2024)

Nearly-Optimal Private Selection via Gaussian Mechanism
por: Leeman, Ethan, et al.
Publicado: (2025)

Private Hyperparameter Tuning with Ex-Post Guarantee
por: Ghazi, Badih, et al.
Publicado: (2025)

Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysis
por: Lyu, Xin, et al.
Publicado: (2024)

Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues
por: Thießen, Thore, et al.
Publicado: (2024)

Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
por: Pagh, Rasmus, et al.
Publicado: (2024)

Differentially Private Ad Conversion Measurement
por: Delaney, John, et al.
Publicado: (2024)

Skirting Additive Error Barriers for Private Turnstile Streams
por: Aamand, Anders, et al.
Publicado: (2026)

Practical and Accurate Local Edge Differentially Private Graph Algorithms
por: Mundra, Pranay, et al.
Publicado: (2025)

Differentially Private Learning Beyond the Classical Dimensionality Regime
por: Dwork, Cynthia, et al.
Publicado: (2024)

A Classical Quadratic Speedup for Planted $k$XOR
por: Gupta, Meghal, et al.
Publicado: (2025)

Differentially Private Gomory-Hu Trees
por: Aamand, Anders, et al.
Publicado: (2024)

Decentralized Privacy Preservation for Critical Connections in Graphs
por: Li, Conggai, et al.
Publicado: (2024)

Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case
por: Guruswami, Venkatesan, et al.
Publicado: (2025)