Provably Secure Symmetric Private Information Retrieval with Quantum Cryptography

Kon, Wen Yu; Lim, Charles Ci Wen

doi:10.3390/e23010054

Cited by 21 publications

(14 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The security of SPIR supported with QKD technology has been shown in Ref. (16). Therefore, in this paper, we demonstrate the practical implementation of such a system [see Fig.…”

Section: Introductionmentioning

confidence: 76%

See 1 more Smart Citation

Experimental symmetric private information retrieval with measurement-device-independent quantum network

Wang¹,

Kon²,

Ng³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

Retrieving information from a database, or information retrieval (IR), is a simple task with an expansive range of applications. However, oftentimes, the user and data centres involved in IR tasks would have privacy concerns. To this end, we require symmetric private information retrieval (SPIR), which possesses stringent system requirements that are challenging to meet in practice. This is especially so for SPIR with databases needing long-term security, for which the use of multiple data centres and a secure method of key distribution are necessary. In this paper, we report an experimental implementation of SPIR with information-theoretic secure keys generated by measurementdevice-independent (MDI) QKD. In particular, we demonstrate the SPIR scheme on a simple fingerprint database, successfully retrieving a 582-byte fingerprint file from a database with 800 entries. Our simulation and experimental results show the feasibility of the proposed SPIR scheme, presenting a promising way

show abstract

“…The security of SPIR supported with QKD technology has been shown in Ref. (16). Therefore, in this paper, we demonstrate the practical implementation of such a system [see Fig.…”

Section: Introductionmentioning

confidence: 76%

“…Firstly, to ensure the security of the SPIR protocol, we assume that the data centres are non-communicating (1,16). If the two data centres are allowed to communicate, they are then able to behave like a single entity, which renders the SPIR protocol insecure.…”

Section: Discussionmentioning

confidence: 99%

Experimental symmetric private information retrieval with measurement-device-independent quantum network

Wang¹,

Kon²,

Ng³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…For each ∈ [ ], server secrecy is achieved because in every round the received state of the user is |B ( ) B ( ) | ⊗ init with B (20) and this state is independent of Y with ≠ .…”

Section: =1mentioning

confidence: 99%

“…Quantum PIR (QPIR) considers fulfilling the PIR task with quantum communication between the user and the servers [13]- [20]. Following the study on the classical PIR capacity [4], the papers [21]- [24] considered the capacity of QPIR and quantum symmetric PIR (QSPIR), where in addition to the requirements of PIR, the user obtains no other information than the desired file.…”

mentioning

confidence: 99%

Quantum Private Information Retrieval from MDS-coded and Colluding Servers

Allaix

Holzbaur

Pllaha

et al. 2020

2020 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

In quantum private information retrieval (QPIR), a user retrieves a classical file from multiple servers by downloading quantum systems without revealing the identity of the file. The QPIR capacity is the maximal achievable ratio of the retrieved file size to the total download size. In this paper, the capacity of QPIR from MDS-coded and colluding servers is studied. Two classes of QPIR, called stabilizer QPIR and dimension squared QPIR induced from classical strongly linear PIR are defined, and the related QPIR capacities are derived. For the non-colluding case, the general QPIR capacity is derived when the number of files goes to infinity. The capacities of symmetric and non-symmetric QPIR with coded and colluding servers are proved to coincide, being double to their classical counterparts. A general statement on the converse bound for QPIR with coded and colluding servers is derived showing that the capacities of stabilizer QPIR and dimension squared QPIR induced from any class of PIR are upper bounded by twice the classical capacity of the respective PIR class. The proposed capacity-achieving scheme combines the star-product scheme by Freij-Hollanti et al. and the stabilizer QPIR scheme by Song et al. by employing (weakly) self-dual Reed-Solomon codes. I. INTRODUCTIONWith the amount of data stored in distributed storage systems steadily increasing, the demand for user privacy has surged in recent years. One notion that has received considerable attention is private information retrieval (PIR), where the Partial results have been accepted to ISIT 2021 [1]. C. Hollanti and M.

show abstract

“…Quantum PIR (QPIR) considers accomplishing the PIR task with quantum communication between the user and the servers [13]- [20]. Following the study on the classical PIR capacity [4], the papers [21]- [24] considered the capacity of QPIR and quantum symmetric PIR (QSPIR), where the user obtains no other information than the desired file in addition to the requirements of PIR.…”

Section: Introductionmentioning

confidence: 99%

On the Capacity of Quantum Private Information Retrieval From MDS-Coded and Colluding Servers

Allaix

Song

Holzbaur

et al. 2022

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

In quantum private information retrieval (QPIR), a user retrieves a classical file from multiple servers by downloading quantum systems without revealing the identity of the file. The QPIR capacity is the maximal achievable ratio of the retrieved file size to the total download size. In this paper, the capacity of QPIR from MDS-coded and colluding servers is studied for the first time. Two general classes of QPIR, called stabilizer QPIR and dimension-squared QPIR induced from classical strongly linear PIR are defined, and the related QPIR capacities are derived. For the non-colluding case, the general QPIR capacity is derived when the number of files goes to infinity. A general statement on the converse bound for QPIR with coded and colluding servers is derived showing that the capacities of stabilizer QPIR and dimension-squared QPIR induced from any class of PIR are upper bounded by twice the classical capacity of the respective PIR class. The proposed capacity-achieving scheme combines the star-product scheme by Freij-Hollanti et al. and the stabilizer QPIR scheme by Song et al. by employing (weakly) self-dual Reed-Solomon codes. Partial results have been published at ISIT 2021 [1]. C. Hollanti and M.

show abstract

Provably Secure Symmetric Private Information Retrieval with Quantum Cryptography

Cited by 21 publications

References 44 publications

Experimental symmetric private information retrieval with measurement-device-independent quantum network

Experimental symmetric private information retrieval with measurement-device-independent quantum network

Quantum Private Information Retrieval from MDS-coded and Colluding Servers

On the Capacity of Quantum Private Information Retrieval From MDS-Coded and Colluding Servers

Contact Info

Product

Resources

About