arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.15645cs.ITmath.IT
收藏

非均匀信息上多项式的个体机密计算

Individual Confidential Computing of Polynomials over Non-Uniform Information

Saar Tarnopolsky, Zirui, Deng, Vinayak Ramkumar, Netanel Raviv, Alejandro Cohen

AI总结:

针对非均匀分布数据的安全分布式计算问题,提出基于完美子集隐私与线性哈希的隐私保护方案,实现多项式计算的信息论安全,并证明对不可信服务提供商的信息泄漏可忽略。

摘要:

在本文中,我们解决了用户数据非均匀分布场景下的安全分布式计算问题,扩展了现有假设数据均匀分布的框架,而这一假设在计算数据中难以满足。鉴于数据存储和计算对单一服务提供商的普遍依赖,我们提出了一种隐私保护方案,该方案在非均匀数据分布上计算多项式时实现了信息论安全保证。我们的框架基于完美子集隐私的概念,并采用线性哈希技术将非均匀数据转换为近似均匀分布,从而实现稳健且安全计算。我们推导了泄漏界限,并证明在所提出的方案下,用户数据的任何子集对不可信服务提供商(不仅包括合谋的工作者,更重要的是包括管理员)的信息泄漏仍然可忽略不计。

英文摘要:

In this paper, we address the problem of secure distributed computation in scenarios where user data is not uniformly distributed, extending existing frameworks that assume uniformity, an assumption that is challenging to enforce in data for computation. Motivated by the pervasive reliance on single service providers for data storage and computation, we propose a privacy-preserving scheme that achieves information-theoretic security guarantees for computing polynomials over non-uniform data distributions. Our framework builds upon the concept of perfect subset privacy and employs linear hashing techniques to transform non-uniform data into approximately uniform distributions, enabling robust and secure computation. We derive leakage bounds and demonstrate that information leakage of any subset of user data to untrusted service providers, i.e., not only to colluding workers but also (and more importantly) to the admin, remains negligible under the proposed scheme.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑