Private Information Retrieval for Secure Distributed Storage Systems

In this paper, we investigate a private information retrieval (PIR) problem for secure distributed storage systems in the presence of an eavesdropper. We design the secure distributed database and the corresponding PIR scheme, which protect not only user privacy (concealing the index of the desired message) from the databases, but also data security (concealing the messages themselves) from an eavesdropper. In our proposed scheme, we use a secret sharing scheme in storing the messages for data security at each of the databases. We consider two different scenarios on whether the databases are aware of the index sets of the secret shares stored in other databases. The key idea in designing an efficient PIR procedure is to exploit the secret shares of undesired messages as a side information by means of storing the secret shares at multiple databases. In particular, it is shown that the rates of the proposed PIR schemes are within a constant multiplicative factor from the derived upper-bound on the capacity of PIR problem.

[1]  Yuval Ishai,et al.  Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[2]  Eyal Kushilevitz,et al.  Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[3]  Sriram Vishwanath,et al.  Secure Cooperative Regenerating Codes for Distributed Storage Systems , 2012, IEEE Transactions on Information Theory.

[4]  Hua Sun,et al.  The Capacity of Symmetric Private Information Retrieval , 2019, IEEE Transactions on Information Theory.

[5]  Mikael Skoglund,et al.  Secure Private Information Retrieval from Colluding Databases with Eavesdroppers , 2017, 2018 IEEE International Symposium on Information Theory (ISIT).

[6]  Ivan Damgård,et al.  Secure Multiparty Computation and Secret Sharing , 2015 .

[7]  Sennur Ulukus,et al.  The Capacity of Private Information Retrieval from Byzantine and Colluding Databases , 2017, IEEE Transactions on Information Theory.

[8]  Wentao Huang,et al.  Generic Secure Repair for Distributed Storage , 2017, ArXiv.

[9]  Yongdae Kim,et al.  Securing distributed storage: challenges, techniques, and systems , 2005, StorageSS '05.

[10]  Vinod M. Prabhakaran,et al.  Fundamental limits of secretive coded caching , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[11]  Hua Sun,et al.  The capacity of private information retrieval with colluding databases , 2016, 2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[12]  Kannan Ramchandran,et al.  One extra bit of download ensures perfectly private information retrieval , 2014, 2014 IEEE International Symposium on Information Theory.

[13]  Kannan Ramchandran,et al.  Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial Attacks , 2010, IEEE Transactions on Information Theory.

[14]  Mikael Skoglund,et al.  Secure symmetric private information retrieval from colluding databases with adversaries , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[15]  Sennur Ulukus,et al.  Private information retrieval from coded databases , 2017, 2017 IEEE International Conference on Communications (ICC).

[16]  Gene Tsudik,et al.  Authentication and integrity in outsourced databases , 2006, TOS.

[17]  Yuval Ishai,et al.  General constructions for information-theoretic private information retrieval , 2005, J. Comput. Syst. Sci..

[18]  Hirosuke Yamamoto,et al.  Secret sharing system using (k, L, n) threshold scheme , 1986 .

[19]  E. Kushilevitz,et al.  Barrier for Information-Theoretic Private Information Retrieval , 2002 .

[20]  Hua Sun,et al.  The Capacity of Private Information Retrieval , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).

[21]  Alexandros G. Dimakis,et al.  Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[22]  Gennian Ge,et al.  Private Information Retrieval from MDS Coded Databases with Colluding Servers under Several Variant Models , 2017, 1705.03186.

[23]  Subhash C. Kak,et al.  Space efficient secret sharing for implicit data security , 2011, Inf. Sci..

[24]  Nihar B. Shah,et al.  Information-Theoretically Secure Regenerating Codes for Distributed Storage , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[25]  Oliver W. Gnilke,et al.  Private Information Retrieval From MDS Coded Data in Distributed Storage Systems , 2018, IEEE Transactions on Information Theory.

[26]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[27]  Hua Sun,et al.  Optimal Download Cost of Private Information Retrieval for Arbitrary Message Length , 2016, IEEE Transactions on Information Forensics and Security.

[28]  Hua Sun,et al.  Multiround Private Information Retrieval: Capacity and Storage Overhead , 2016, IEEE Transactions on Information Theory.

[29]  Tal Rabin,et al.  Secure distributed storage and retrieval , 1997, Theor. Comput. Sci..

[30]  Eitan Yaakobi,et al.  Codes for distributed PIR with low storage overhead , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).