Results 41 to 50 of about 251,490 (326)
Research on privacy information retrieval model based on hybrid homomorphic encryption
The computational complexity of privacy information retrieval protocols is often linearly related to database size. When the database size is large, the efficiency of privacy information retrieval protocols is relatively low.
Wei-tao Song +3 more
doaj +1 more source
The Capacity of Private Information Retrieval
In the private information retrieval (PIR) problem a user wishes to retrieve, as efficiently as possible, one out of $K$ messages from $N$ non-communicating databases (each holds all $K$ messages) while revealing nothing about the identity of the desired
Jafar, Syed A., Sun, Hua
core +1 more source
Improving the Robustness of Private Information Retrieval [PDF]
Since 1995, much work has been done creating protocols for private information retrieval (PIR). Many variants of the basic PIR model have been proposed, including such modifications as computational vs.
Ian Goldberg
core +2 more sources
Efficient Threshold Function Secret Sharing With Information-Theoretic Security
Function secret sharing (FSS) is a cryptographic primitive that is introduced by Boyle et al. (Eurocrypt 2015), motivated by application scenarios involving private access to large distributed data while minimising the overhead of communication, for ...
Jinglong Luo +3 more
doaj +1 more source
Faster Spiral: Low-Communication, High-Rate Private Information Retrieval
Private information retrieval (PIR) enables a client to retrieve a specific element from a server’s database without disclosing the index that was queried. This work introduces three improvements to the efficient single-server PIR protocol Spiral.
Ming Luo, Mingsheng Wang
doaj +1 more source
Development of Quantum Private Queries Protocol on Collective-Dephasing Noise Channel
Quantum private queries can commonly protect important information in a good many of domains, such as finance, business, military, which use quantum effects to achieve unprecedented classical private queries. However, quantum state can be easily affected
Jingbo Zhao +4 more
doaj +1 more source
Lower-Cost ∈-Private Information Retrieval [PDF]
Private Information Retrieval (PIR), despite being well studied, is computationally costly and arduous to scale. We explore lower-cost relaxations of information-theoretic PIR, based on dummy queries, sparse vectors, and compositions with an anonymity ...
Danezis, G, Goldberg, I, Toledo, RR
core +2 more sources
Private information retrieval for coded storage [PDF]
Private information retrieval scheme for coded data storage is considered in this paper. We focus on the case where the size of each data record is large and hence only the download cost (but not the upload cost for transmitting retrieval queries) is of interest. We prove that the tradeoff between storage cost and retrieval/download cost depends on the
Chan, Terence H. +2 more
openaire +3 more sources
A Shannon-Theoretic Approach to the Storage–Retrieval Trade-Off in PIR Systems
We consider the storage–retrieval rate trade-off in private information retrieval (PIR) systems using a Shannon-theoretic approach. Our focus is mostly on the canonical two-message two-database case, for which a coding scheme based on random codebook ...
Chao Tian, Hua Sun, Jun Chen
doaj +1 more source
Robust Private Information Retrieval on Coded Data
We consider the problem of designing PIR scheme on coded data when certain nodes are unresponsive. We provide the construction of $\nu$-robust PIR schemes that can tolerate up to $\nu$ unresponsive nodes.
Rouayheb, Salim El, Tajeddine, Razane
core +1 more source

