Symmetric Private Information Retrieval For MDS Coded Distributed Storage
A user wants to retrieve a file from a database without revealing the identity of the file retrieved at the database, which is known as the problem of private information retrieval (PIR). If it is further required that the user obtains no information about the database other than the desired file, the concept of symmetric private information retrieval (SPIR) is introduced to guarantee privacy for both parties. In this paper, the problem of SPIR is studied for a database stored among $N$ nodes in a distributed way, by using an $(N,M)$-MDS storage code. The information-theoretic capacity of SPIR, defined as the maximum number of symbols of the desired file retrieved per downloaded symbol, for the coded database is derived. It is shown that the SPIR capacity for coded database is $1-\frac{M}{N}$, when the amount of the shared common randomness of distributed nodes (unavailable at the user) is at least $\frac{M}{N-M}$ times the file size. Otherwise, the SPIR capacity for the coded database equals zero.
Code (0)
등록된 구현이 없습니다.
Tasks
Information RetrievalRetrievalSimilar Papers 제목 키워드 기반
Star Product PIR Schemes with Colluding Servers over Small Fields
Private Information Retrieval (PIR) was first proposed by B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan in their 1995 FOCS paper. For MDS coded distributed storage system private information retrieval was proposed a…
Information RetrievalRetrievalQuantum Private Information Retrieval from Coded and Colluding Servers
In the classical private information retrieval (PIR) setup, a user wants to retrieve a file from a database or a distributed storage system (DSS) without revealing the file identity to the servers holding the data. In th…
Information RetrievalRetrievalCodedPrivateML: A Fast and Privacy-Preserving Framework for Distributed Machine Learning
How to train a machine learning model while keeping the data private and secure? We present CodedPrivateML, a fast and scalable approach to this critical problem. CodedPrivateML keeps both the data and the model informat…
BIG-bench Machine LearningPrivacy PreservingregressionHigh-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes
In the classical private information retrieval (PIR) setup, a user wants to retrieve a file from a database or a distributed storage system (DSS) without revealing the file identity to the servers holding the data. In th…
Information RetrievalRetrievalA New Design of Cache-aided Multiuser Private Information Retrieval with Uncoded Prefetching
In the problem of cache-aided multiuser private information retrieval (MuPIR), a set of $K_{\rm u}$ cache-equipped users wish to privately download a set of messages from $N$ distributed databases each holding a library …
Information RetrievalRetrieval