Provably Secure Symmetric Private Information Retrieval with Quantum Cryptography [PDF]
Private information retrieval (PIR) is a database query protocol that provides user privacy in that the user can learn a particular entry of the database of his interest but his query would be hidden from the data centre.
Wen Yu Kon, Charles Ci Wen Lim
doaj +4 more sources
On the Existence of XOR-Based Codes for Private Information Retrieval with Private Side Information [PDF]
We consider the problem of Private Information Retrieval with Private Side Information (PIR-PSI), wherein the privacy of the demand and the side information are jointly preserved. Although the capacity of the PIR-PSI setting is known, we observe that the
Murali Krishnan K. H., Jagadeesh Harshan
doaj +4 more sources
On the Optimal File Size of Capacity-Achieving Byzantine-Resistant Private Information Retrieval Schemes [PDF]
We consider the problem of designing a Private Information Retrieval (PIR) scheme for n files replicated on k servers that can collude and return incorrect answers.
Stanislav Kruglik +3 more
doaj +3 more sources
Symmetric private information retrieval supported by quantum-secure key-exchange network [PDF]
Quantum key distribution provides a provably secure way for private key distribution, which enables the practical implementation of information retrieval that preserves both the user privacy and database security.
Shuang Wang
doaj +2 more sources
Experimental symmetric private information retrieval with measurement-device-independent quantum network [PDF]
We realised a provably-secure symmetric private information retrieval supported by a quantum-secure key-exchange network. Our demonstration achieves secure retrieval of 582-byte fingerprint files from a database with 800 entries.
Chao Wang +3 more
doaj +2 more sources
On Share Conversions for Private Information Retrieval [PDF]
Beimel et al. in CCC 12’ put forward a paradigm for constructing Private Information Retrieval (PIR) schemes, capturing several previous constructions for k ≥ 3 servers. A key component in the paradigm, applicable to three-server PIR,
Anat Paskin-Cherniavsky, Leora Schmerler
doaj +2 more sources
Asymmetry Helps: Improved Private Information Retrieval Protocols for Distributed Storage [PDF]
We consider private information retrieval (PIR) for distributed storage systems (DSSs) with noncolluding nodes where data is stored using a non maximum distance separable (MDS) linear code.
Hsuan-Yin Lin +3 more
openalex +4 more sources
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval [PDF]
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding n-bit strings over an l-bit alphabet, where the decoder only uses b bits of each queried position of the codeword, needs code ...
Stephanie Wehner, Ronald de Wolf
openalex +8 more sources
The capacity of cache aided private information retrieval [PDF]
The problem of cache enabled private information retrieval (PIR) is considered in which a user wishes to privately retrieve one out of $K$ messages, each of size $L$ bits from $N$ distributed databases.
Ravi Tandon
openalex +3 more sources
Towards Characterizing the Download Cost of Cache-Aided Private Updating [PDF]
We consider the problem of privately updating a message out of K messages from N replicated and non-colluding databases where a user has an outdated version of the message W^θ of length L bits that differ from the current version Wθ in at most f bits ...
Bryttany Stark +2 more
doaj +2 more sources

