arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2610.10211cs.ITmath.IT

基于DNA数据存储的多合谋服务器顺序随机采样PIR

Sequential Random Sampling PIR with Multiple Colluding Servers in DNA-Based Data Storage

  • Technion—Israel Institute of Technology(以色列理工学院)

机构由 AI 辅助整理,请以论文原文为准。

Chen Wang, Natalia Silberstein, Eitan Yaakobi

AI总结:

针对DNA数据存储中的隐私检索问题,研究了多合谋服务器下顺序随机采样PIR的下载成本与隐私泄露权衡,推导了下界并构造了达到最优的方案。

AI中文摘要:

随着基于DNA的数据存储的发展,在数据检索过程中保护用户隐私变得越来越重要。我们研究了具有多个合谋随机采样服务器的顺序随机采样DNA私有信息检索(SRS DNA PIR),其中数据库被划分为大小相等的服务器。我们研究了下载成本(定义为期望查询次数)与隐私泄露(以互信息衡量)之间的权衡。我们推导了该权衡的下界,包括一个由优化问题给出的界。当每个服务器存储两个文件时,该界是紧的,并且我们构造了达到该界的方案。对于任意大小的服务器,我们构造了将单服务器方案应用于随机选择的服务器子集的方案。

英文摘要:

As DNA-based data storage evolves, protecting user privacy during data retrieval has become increasingly important. We study sequential random sampling DNA private information retrieval (SRS DNA PIR) with multiple colluding random sampling servers, where the database is partitioned into servers of equal size. We investigate the tradeoff between the download cost, defined as the expected number of queries, and the privacy leakage, measured by mutual information. We derive lower bounds on this tradeoff, including a bound given by an optimization problem. This bound is tight when each server stores two files, and we construct schemes that attain it. For servers of any size, we construct schemes that apply a single-server scheme to a randomly selected subset of servers.

↑