ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

~ similar to 2603.22808v4· 20 results

cs.CRcs.LGRecentMar 20, 2026

TAPAS: Efficient Two-Server Asymmetric Private Aggregation Beyond Prio(+)

Harish Karthikeyan, Antigoni Polychroniadou

TAPAS introduces an efficient, asymmetric two-server private aggregation scheme that significantly reduces computational and communication costs for large-scale federated learning compared to existing…

View →
eess.SYcs.CRRecentMar 24, 2026

Secure Two-Party Matrix Multiplication from Lattices and Its Application to Encrypted Control

Kaoru Teranishi

The paper proposes a provably secure, single-round two-party computation protocol for approximate matrix multiplication using lattice-based cryptography, demonstrated for secure control law implementa…

View →
cs.CRcs.DScs.LGRecentMay 27, 2026

Privately Estimating Monotone Statistics in Polynomial Time

Gavin Brown, Ephraim Linder, Mahbod Majid, Vikrant Singhal

The paper introduces novel, efficient differentially private algorithms for estimating monotone statistics, significantly improving sample complexity compared to existing methods.

View →
cs.ITcs.CRRecentMay 28, 2026

Secure Distributed Hypothesis Testing

Gowtham R. Kurri, Varun Narayanan, Vinod M. Prabhakaran, K. R. Sahasranand

The paper addresses secure distributed hypothesis testing, proving impossibility in the standard setting and achieving secure testing for simple and general classes by incorporating a shared secret ke…

View →
cs.CRRecentJun 3, 2026

Pepper: High-bandwidth and Scalable Anonymous Broadcast with Cryptographic Privacy

Chenghao Li, Haoyuan Wang, Xianghang Mi

Pepper is a novel, high-bandwidth anonymous broadcast protocol that achieves cryptographic sender anonymity and significantly improves messaging throughput compared to existing state-of-the-art system…

View →
cs.CRRecentMay 3, 2026

Plausible Deniability in Fully Homomorphic Computation

Shahzad Ahmad, Stefan Rass, Zahra Seyedi

The paper introduces a framework, PD-FHC, that allows users to outsource Boolean computations to an untrusted cloud while guaranteeing both computational privacy and plausible deniability against coer…

View →
cs.ITcs.CRcs.LGRecentMay 28, 2026

Local Differential Privacy with Correlated Noise Achieves Central-DP Optimal Cost

Madhura Pathegama, Srikanth Avasarala, Viveck R. Cadambe, Juba Ziani

The paper demonstrates that by introducing carefully designed correlations among locally added noise variables, local differential privacy mechanisms can achieve an estimation cost matching the optima…

View →
cs.CRcs.FLRecentMar 20, 2026

Sharing The Secret: Distributed Privacy-Preserving Monitoring

Mahyar Karimi, K. S. Thejaswini, Roderick Bloem, Thomas A. Henzinger

The paper proposes a distributed, privacy-preserving monitoring architecture that uses secret-sharing to efficiently monitor systems with continuous state, overcoming the scalability issues of traditi…

View →
cs.DBcs.CRRecentMar 20, 2026

Acyclic Graph Pattern Counting under Local Differential Privacy

Yihua Hu, Kuncan Wang, Wei Dong

The paper presents the first general mechanism for counting arbitrary acyclic graph patterns under Local Differential Privacy (LDP), addressing challenges in pattern construction and node duplication.

View →
cs.CRcs.ITRecentMay 4, 2026

Optimal Privacy-Utility Trade-Offs in LDP: Functional and Geometric Perspectives

Seung-Hyun Nam, Hyun-Young Park, Si-Hyeon Lee

The paper develops a unified theoretical framework to systematically characterize the optimal privacy-utility trade-off (PUT) and optimal Local Differential Privacy (LDP) channels for general statisti…

View →
cs.CRcs.ITRecentMay 20, 2026

Information Leakage Envelopes

Sara Saeidian, Carlos Pinzón, Catuscia Palamidessi

The paper introduces the PML envelope, a novel definition that provides a robust and operationally meaningful measure of information leakage about a secret, satisfying both post-processing robustness…

View →
cs.CRRecentMay 26, 2026

Beyond Epsilon: A Principled QIF Framework for Local Differential Privacy

Ramon G. Gonze, Natasha Fernandes, Heber H. Arcolezi, Catuscia Palamidessi +1 more

The paper proposes a Quantitative Information Flow (QIF) framework to systematically and rigorously compare Local Differential Privacy (LDP) frequency estimation protocols, moving beyond simple $\vare…

View →
cs.CRRecentMar 31, 2026

Beyond Latency: A System-Level Characterization of MPC and FHE for PPML

Pengzhi Huang, Kiwan Maeng, G. Edward Suh

This paper provides a comprehensive, system-level comparison of MPC and FHE for Privacy-Preserving Machine Learning (PPML) across various models and environments, moving beyond single-metric latency a…

View →
cs.LGcs.CRstat.MLRecentMay 8, 2026

Less Random, More Private: What is the Optimal Subsampling Scheme for DP-SGD?

Andy Dong, Ayfer Özgür

The paper introduces Balanced Iteration Subsampling (BIS), a structured sampling scheme that is proven to achieve stronger privacy amplification than the standard Poisson subsampling used in DP-SGD by…

View →
cs.LGcs.CRcs.DCRecentMay 8, 2026

Private Vertical Federated Inference for Time-Series

Lucas Fenaux, Larris Xie, Aditya Bang, Alex Zhang +2 more

The paper proposes a Public/Private Hybrid Head-VFL (PPHH-VFL) architecture that significantly accelerates secure time-series inference by splitting the model head into efficient public and secure pri…

View →
cs.CRcs.AIRecentApr 17, 2026

Privacy-Preserving LLMs Routing

Xidong Wu, Yukuan Zhang, Yuqiong Ji, Reza Shirkavand +2 more

The paper proposes PPRoute, a privacy-preserving LLM routing framework that significantly speeds up secure model selection while maintaining high performance comparable to non-private methods.

View →
cs.CRmath.NTRecentApr 6, 2026

Cryptanalysis of the Legendre Pseudorandom Function over Extension Fields

Daksh Pandey

This paper provides the first comprehensive cryptanalysis of the Legendre Pseudorandom Function over extension fields, demonstrating key recovery attacks under both passive and active threat models.

View →
cs.CRRecentMar 18, 2026

DDH-based schemes for multi-party Function Secret Sharing

Marc Damie, Florian Hahn, Andreas Peter, Jan Ramon

The paper proposes a new DDH-based technique that significantly reduces the key size of multi-party Distributed Point Function (DPF) secret sharing schemes, achieving an $O( oot{3}{N})$ key size for h…

View →
cs.CRcs.AIcs.LGRecentMay 27, 2026

Mind the Gap: Mixtures of Gaussians in Approximate Differential Privacy

Huikang Liu, Aras Selvi, Wolfram Wiesemann

The paper introduces 'mixture mechanisms,' a novel class of additive noise mechanisms that achieve approximate differential privacy by mixing multiple Gaussian distributions, resulting in lower noise…

View →
cs.CRcs.AIcs.LGRecentMay 27, 2026

Mind the Gap: Mixtures of Gaussians in Approximate Differential Privacy

Huikang Liu, Aras Selvi, Wolfram Wiesemann

The paper introduces 'mixture mechanisms,' a novel class of additive noise mechanisms that achieve differential privacy for real-valued queries, significantly reducing noise compared to the standard G…

View →