论文标题
量化在分布式存储系统中私人存储数据的成本
Quantifying the Cost of Privately Storing Data in Distributed Storage Systems
论文作者
论文摘要
考虑希望将文件存储在多个服务器中的用户，以便至少需要T服务器重建文件，而Z核算服务器无法学习有关文件的任何信息。与传统的秘密共享模型不同，假定用户和每个服务器之间无需使用完美安全的频道，我们假设用户只能通过公共渠道将数据发送给服务器，并且用户和每个服务器共享带有长度n的单个秘密密钥。对于给定的n，我们根据用户需要与服务器共享的秘密密钥的长度来确定用户可以存储的文件的最大长度，从而量化了存储一定长度的所需成本。此外，对于此最大文件长度，我们确定（i）用户所需的局部随机性的最佳量，（ii）用户到服务器的最佳公共通信量，以及（iii）服务器上最佳的存储需求量。
Consider a user who wishes to store a file in multiple servers such that at least t servers are needed to reconstruct the file, and z colluding servers cannot learn any information about the file. Unlike traditional secret-sharing models, where perfectly secure channels are assumed to be available at no cost between the user and each server, we assume that the user can only send data to the servers via a public channel, and that the user and each server share an individual secret key with length n. For a given n, we determine the maximal length of the file that the user can store, and thus quantify the necessary cost to store a file of a certain length, in terms of the length of the secret keys that the user needs to share with the servers. Additionally, for this maximal file length, we determine (i) the optimal amount of local randomness needed at the user, (ii) the optimal amount of public communication from the user to the servers, and (iii) the optimal amount of storage requirement at the servers.
