A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Optimal Download Cost of Private Information Retrieval for Arbitrary Message Length
[article]
2016
arXiv
pre-print
Preserved Fulltext
In this work, for arbitrary K, N, we explore the minimum download cost D_L across all PIR schemes (not restricted to linear schemes) for arbitrary message lengths L under arbitrary choices of alphabet ...
A private information retrieval scheme is a mechanism that allows a user to retrieve any one out of K messages from N non-communicating replicated databases, each of which stores all K messages, without ...
However, since in practice the message length parameter L can be arbitrary, an important question that remains open is to determine optimal download cost and rate values for arbitrary fixed values of L ...
arXiv:1610.03048v1
fatcat:dhg7mhi4wbd63bcoeury5pnpn4
Optimal Download Cost of Private Information Retrieval for Arbitrary Message Length
2017
IEEE Transactions on Information Forensics and Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this work, for arbitrary K, N , we explore the minimum download cost D L across all PIR schemes (not restricted to linear schemes) for arbitrary message lengths L under arbitrary choices of alphabet ...
A private information retrieval scheme is a mechanism that allows a user to retrieve any one out of K messages from N non-communicating replicated databases, each of which stores all K messages, without ...
However, since in practice the message length parameter L can be arbitrary, an important question that remains open is to determine optimal download cost and rate values for arbitrary fixed values of L ...
doi:10.1109/tifs.2017.2725225
fatcat:z563gbihpfgi7px22qajd4d65i
Capacity-achieving private information retrieval scheme with a smaller sub-packetization
2019
Advances in Mathematics of Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Private information retrieval (PIR) allows a user to retrieve one out of M messages from N servers without revealing the identity of the desired message. ...
The capacity of storage constrained PIR (equivalently, the reciprocal of minimum download cost) is the maximum number of bits of desired symbols that can be privately retrieved per bit of downloaded symbols ...
Sun and Jafar characterized the minimum download cost for arbitrary message length and designed capacity-achieving PIR schemes with message length L = N M −1 [18] . ...
doi:10.3934/amc.2020070
fatcat:t55asmhcwbebvdvefuttfvbxmu
The Capacity of Private Information Retrieval with Partially Known Private Side Information
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We consider the problem of private information retrieval (PIR) of a single message out of K messages from N replicated and non-colluding databases where a cache-enabled user (retriever) of cache-size M ...
In the retrieval phase, the user wishes to retrieve a message such that no individual database learns anything about the identity of the desired message. ...
The efficiency of a PIR scheme is measured by the normalized download cost, which is the cost of privately downloading one bit of the desired message. ...
arXiv:1710.00809v2
fatcat:hq674evpdfd33csa3c7sperd3a
The Capacity of Private Information Retrieval
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The information theoretic capacity of PIR is the maximum number of bits of desired information that can be privately retrieved per bit of downloaded information. ...
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 ...
The reciprocal of download cost is the rate, i.e., the number of bits of desired information that is privately retrieved per downloaded information bit. ...
arXiv:1602.09134v2
fatcat:kiv26xadk5d6tpnlhlzi2umdxm
Private Set Intersection: A Multi-Message Symmetric Private Information Retrieval Perspective
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We first show that the PSI problem can be recast as a multi-message symmetric private information retrieval (MM-SPIR) problem. ...
Based on this capacity result for MM-SPIR, and after addressing the added requirements in its conversion to the PSI problem, we show that the optimal download cost for the PSI problem is min{⌈P_1 N_2/N ...
finite fixed message length L, the download cost D M M −LSP IR must be a positive integer. ...
arXiv:1912.13501v2
fatcat:p7zq4zkb7jc3dbqlpniug6u4fe
Cache-Aided Private Information Retrieval with Partially Known Uncoded Prefetching: Fundamental Limits
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We investigate the optimal normalized download cost D^*(r) in the retrieval phase as a function of K, N, r. We develop lower and upper bounds for the optimal download cost. ...
This model operates in a two-phase scheme, namely, the prefetching phase where the user acquires side information and the retrieval phase where the user privately downloads the desired message. ...
, PIR for arbitrary message lengths, multi-round PIR, multi-message PIR, PIR from Byzantine databases, secure symmetric PIR with adversaries, cache-aided PIR, PIR with private side information (PSI), PIR ...
arXiv:1712.07021v1
fatcat:t5rg7s7m3rbo5hkp7ppaxtsmg4
The Asymptotic Capacity of Private Search
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The results are based on the asymptotic behavior of a new converse bound for private information retrieval with arbitrarily dependent messages. ...
The capacity of private search is the maximum number of bits of desired information that can be retrieved per bit of download. ...
Since the upload cost of private search does not depend on L while the download cost scales linearly with L, the communication cost of private search for large L is dominated by the download cost. ...
arXiv:1801.05768v2
fatcat:stykq3gl6zc4jm4g4z2wa5lbbe
The Capacity of Symmetric Private Information Retrieval
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The information theoretic capacity of SPIR (equivalently, the reciprocal of minimum download cost) is the maximum number of bits of desired information that can be privately retrieved per bit of downloaded ...
Private information retrieval (PIR) is the problem of retrieving as efficiently as possible, one out of K messages from N non-communicating replicated databases (each holds all K messages) while keeping ...
Remark: The optimal (minimum) normalized download cost D/L = l k /R k = max i l i N N −1 is the same for each message. ...
arXiv:1606.08828v2
fatcat:6jtbofgy4fe4zkrot25ctsuhb4
The Capacity of Symmetric Private Information Retrieval
2016
2016 IEEE Globecom Workshops (GC Wkshps)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The information theoretic capacity of SPIR (equivalently, the reciprocal of minimum download cost) is the maximum number of bits of desired information that can be privately retrieved per bit of downloaded ...
Private information retrieval (PIR) is the problem of retrieving as efficiently as possible, one out of K messages from N non-communicating replicated databases (each holds all K messages) while keeping ...
Remark: The optimal (minimum) normalized download cost D/L = l k /R k = max i l i N N −1 is the same for each message. ...
doi:10.1109/glocomw.2016.7849060
dblp:conf/globecom/SunJ16a
fatcat:pc3kszxpdzhofmxmsnrmes7zuq
Blind interference alignment for private information retrieval
2016
2016 IEEE International Symposium on Information Theory (ISIT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Inspired by this connection, we characterize the information theoretic optimal download cost of PIR, when we have K = 2 messages and the number of databases, N , is arbitrary. ...
Private information retrieval (PIR) refers to the problem where a user retrieves one out of K messages from N non-communicating databases (each holds all K messages) without revealing anything about the ...
Theorem 1 For the private information retrieval problem with 2 messages and N ≥ 2 databases, the optimal download cost η * is 1 + 1 N . ...
doi:10.1109/isit.2016.7541361
dblp:conf/isit/SunJ16
fatcat:ppr2yaw6mzatjbw6lfi47kkfku
Blind Interference Alignment for Private Information Retrieval
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Inspired by this connection, we characterize the information theoretic optimal download cost of PIR, when we have K = 2 messages and the number of databases, N, is arbitrary. ...
Private information retrieval (PIR) refers to the problem where a user retrieves one out of K messages from N non-communicating databases (each holds all K messages) without revealing anything about the ...
Theorem 1 For the private information retrieval problem with 2 messages and N ≥ 2 databases, the optimal download cost η * is 1 + 1 N . ...
arXiv:1601.07885v1
fatcat:smiloce4hnbclevcnzfsnjqzpi
Intermittent Private Information Retrieval with Application to Location Privacy
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2021 pre-print arXiv:2106.00740v1 fatcat:qobplngq4rg4reh2lzwymc2pja
We study the problem of intermittent private information retrieval with multiple servers, in which a user consecutively requests one of K messages from N replicated databases such that part of requests ...
We propose an intermittent private information retrieval scheme that concatenates an obfuscation scheme and a private information retrieval scheme for the time period when privacy is not needed, to prevent ...
In this paper, we will study the intermittent private information retrieval problem by investigating the download cost for the time periods when the user does not need privacy. ...
arXiv:2106.00740v2
fatcat:tgnj7i2kkbgdpnej3mcpilxlna
Private Information Retrieval in Distributed Storage Systems Using an Arbitrary Linear Code
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We propose an information-theoretic private information retrieval (PIR) scheme for distributed storage systems where data is stored using a linear systematic code of rate R > 1/2. ...
We further propose an algorithm to optimize the communication price of privacy (cPoP) using the structure of the underlying linear code. ...
This form of privacy is usually referred to as private information retrieval (PIR). PIR is important to, e.g., protect users from surveillance and monitoring. ...
arXiv:1612.07084v2
fatcat:iappqvyvvjg4hkcjhl3xkkef3q
Fundamental Limits of Cache-Aided Private Information Retrieval with Unknown and Uncoded Prefetching
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We assume that the databases are unaware of the cache content. We investigate D^*(r) the optimal download cost normalized with the message size as a function of K, N, r. ...
As a corollary, we fully characterize the optimal download cost caching ratio tradeoff for K=3. ...
To privately retrieve a message, the optimal total downloaded bits normalized with the message size is D(r) L = (1 − r)(1 + 1 N + · · · + 1 N K−1 ). ...
arXiv:1709.01056v1
fatcat:cx6px7fdpjfoxi25ki6whpzco4
« Previous
Showing results 1 — 15 out of 4,246 results