English

Piquant$\varepsilon$: Private Quantile Estimation in the Two-Server Model

Cryptography and Security 2025-09-18 v1

Abstract

Quantiles are key in distributed analytics, but computing them over sensitive data risks privacy. Local differential privacy (LDP) offers strong protection but lower accuracy than central DP, which assumes a trusted aggregator. Secure multi-party computation (MPC) can bridge this gap, but generic MPC solutions face scalability challenges due to large domains, complex secure operations, and multi-round interactions. We present Piquantε\varepsilon, a system for privacy-preserving estimation of multiple quantiles in a distributed setting without relying on a trusted server. Piquantε\varepsilon operates under the malicious threat model and achieves accuracy of the central DP model. Built on the two-server model, Piquantε\varepsilon uses a novel strategy of releasing carefully chosen intermediate statistics, reducing MPC complexity while preserving end-to-end DP. Empirically, Piquantε\varepsilon estimates 5 quantiles on 1 million records in under a minute with domain size 10910^9, achieving up to 10410^4-fold higher accuracy than LDP, and up to 10×\sim 10\times faster runtime compared to baselines.

Keywords

Cite

@article{arxiv.2509.14035,
  title  = {Piquant$\varepsilon$: Private Quantile Estimation in the Two-Server Model},
  author = {Hannah Keller and Jacob Imola and Fabrizio Boninsegna and Rasmus Pagh and Amrita Roy Chowdhury},
  journal= {arXiv preprint arXiv:2509.14035},
  year   = {2025}
}

Comments

30 Pages, 19 Figures, 1 Table

R2 v1 2026-07-01T05:42:02.751Z