Cover Image

Module Lattice Security (Part III): Structured CVP Distance on the Log-Unit Lattice

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Luo, Ming-Xing
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Cryptography and Security Number Theory Statistics Theory Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Low-degree Security of the Planted Random Subgraph Problem
by: Bogdanov, Andrej, et al.
Published: (2024)

An average case efficient algorithm for solving two-variable linear Diophantine equations
by: Deora, Mayank, et al.
Published: (2024)

Module Lattice Security (Part II): Module Lattice Reduction via Optimal Sign Selection
by: Luo, Ming-Xing
Published: (2026)

Instance-Optimal Private Density Estimation in the Wasserstein Distance
by: Feldman, Vitaly, et al.
Published: (2024)

Computation of Jacobi sums of order l^2 and 2l^2 with prime l
by: Ahmed, Md. Helal, et al.
Published: (2019)

A Bias-Accuracy-Privacy Trilemma for Statistical Estimation
by: Kamath, Gautam, et al.
Published: (2023)

Optimal Rates for Differentially Private Hypothesis Testing with E-values
by: Jacobsen, Ben, et al.
Published: (2026)

The Broader Landscape of Robustness in Algorithmic Statistics
by: Kamath, Gautam
Published: (2024)

Better and Simpler Lower Bounds for Differentially Private Statistical Estimation
by: Narayanan, Shyam
Published: (2023)

CoinPress: Practical Private Mean and Covariance Estimation
by: Biswas, Sourav, et al.
Published: (2020)

Differentially Private Low-dimensional Synthetic Data from High-dimensional Datasets
by: He, Yiyun, et al.
Published: (2023)

Variational and Majorization Principles in Lattice Reduction
by: Blanco-Romero, Javier, et al.
Published: (2026)

On Factoring and Power Divisor Problems via Rank-3 Lattices and the Second Vector
by: Gao, Yiming, et al.
Published: (2025)

Meeting Utility Constraints in Differential Privacy: A Privacy-Boosting Approach
by: Jiang, Bo, et al.
Published: (2024)

Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters
by: Haney, Samuel, et al.
Published: (2023)

Compression with Privacy-Preserving Random Access
by: Chandar, Venkat, et al.
Published: (2025)

Necessity of Block Designs for Optimal Locally Private Distribution Estimation
by: Gentle, Abigail
Published: (2025)

Shuffling Cards When You Are of Very Little Brain: Low Memory Generation of Permutations
by: Menuhin, Boaz, et al.
Published: (2025)

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

The state hidden subgroup problem and an efficient algorithm for locating unentanglement
by: Bouland, Adam, et al.
Published: (2024)

Composition of random functions and word reconstruction
by: Chapuy, Guillaume, et al.
Published: (2026)

Module Lattice Security (Part I): Unconditional Verification of Weber's Conjecture for $k \le 12$
by: Luo, Ming-Xing
Published: (2026)

Analysis of Shuffling Beyond Pure Local Differential Privacy
by: Takagi, Shun, et al.
Published: (2026)

Mean estimation in the add-remove model of differential privacy
by: Kulesza, Alex, et al.
Published: (2023)

Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages
by: Asi, Hilal, et al.
Published: (2024)

Mixtures of Gaussians are Privately Learnable with a Polynomial Number of Samples
by: Afzali, Mohammad, et al.
Published: (2023)

Robustness Implies Privacy in Statistical Estimation
by: Hopkins, Samuel B., et al.
Published: (2022)

Reveal-or-Obscure: A Differentially Private Sampling Algorithm for Discrete Distributions
by: Tasnim, Naima, et al.
Published: (2025)

Optimal Differentially Private Sampling of Unbounded Gaussians
by: Iverson, Valentio, et al.
Published: (2025)

Online Distribution Learning with Local Private Constraints
by: Sima, Jin, et al.
Published: (2024)

Private Mean Estimation with Person-Level Differential Privacy
by: Agarwal, Sushant, et al.
Published: (2024)

Agnostic Private Density Estimation for GMMs via List Global Stability
by: Afzali, Mohammad, et al.
Published: (2024)

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
by: Aggarwal, Divesh, et al.
Published: (2020)

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

Comprehensive characterization of three-qubit Grover search algorithm on IBM's 127-qubit superconducting quantum computers
by: AbuGhanem, M.
Published: (2024)

No exponential quantum speedup for $\mathrm{SIS}^\infty$ anymore
by: Kothari, Robin, et al.
Published: (2025)

Average-Case Complexity of Quantum Stabilizer Decoding
by: Khesin, Andrey Boris, et al.
Published: (2025)

Quantum Local Differential Privacy and Quantum Statistical Query Model
by: Angrisani, Armando, et al.
Published: (2022)

The NISQ Complexity of Collision Finding
by: Hamoudi, Yassine, et al.
Published: (2022)

A Survey of Quantum Alternatives to Randomized Algorithms: Monte Carlo Integration and Beyond
by: Intallura, Philip, et al.
Published: (2023)