Quantum Private Information Retrieval from Coded Storage Systems
| dc.contributor | Aalto-yliopisto | fi |
| dc.contributor | Aalto University | en |
| dc.contributor.advisor | Hollanti, Camilla, Prof., Aalto University, Department of Mathematics and Systems Analysis, Finland | |
| dc.contributor.advisor | Pllaha, Tefjol, Dr., University of Nebraska-Lincoln, United States of America | |
| dc.contributor.author | Allaix, Matteo | |
| dc.contributor.department | Matematiikan ja systeemianalyysin laitos | fi |
| dc.contributor.department | Department of Mathematics and Systems Analysis | en |
| dc.contributor.lab | Algebra, Number Theory, and Applications | en |
| dc.contributor.school | Perustieteiden korkeakoulu | fi |
| dc.contributor.school | School of Science | en |
| dc.contributor.supervisor | Hollanti, Camilla, Prof., Aalto University, Department of Mathematics and Systems Analysis, Finland | |
| dc.date.accessioned | 2023-11-16T10:00:27Z | |
| dc.date.available | 2023-11-16T10:00:27Z | |
| dc.date.defence | 2023-11-29 | |
| dc.date.issued | 2023 | |
| dc.description.abstract | In the era of extensive data growth, robust and efficient mechanisms are needed to store and manage vast amounts of digital information, such as Data Storage Systems (DSSs). Concurrently, privacy concerns have arisen, leading to the development of techniques like Private Information Retrieval (PIR) to enable data access while preserving privacy. A PIR protocol allows users to retrieve information from a database without revealing the specifics of their query or the data they are accessing. With the advent of quantum computing, researchers have explored the potential of using quantum systems to enhance privacy in information retrieval. In a Quantum Private Information Retrieval (QPIR) protocol, a user can retrieve information from a database by downloading quantum systems from multiple servers, while ensuring that the servers remain oblivious to the specific information being accessed. This scenario offers a unique advantage by leveraging the inherent properties of quantum systems to provide enhanced privacy guarantees and improved communication rates compared to classical PIR protocols. In this thesis we consider the QPIR setting where the queries and the coded storage systems are classical, while the responses from the servers are quantum. This problem was treated by Song et al. for replicated storage and different collusion patterns. This thesis aims to develop QPIR protocols for coded storage by combining known classical PIR protocols with quantum communication algorithms, achieving enhanced privacy and communication costs. We consider different storage codes and robustness assumptions, and we prove that the achieved communication cost is always lower than the classical counterparts. | en |
| dc.format.extent | 94 + app. 70 | |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.isbn | 978-952-64-1524-6 (electronic) | |
| dc.identifier.isbn | 978-952-64-1523-9 (printed) | |
| dc.identifier.issn | 1799-4942 (electronic) | |
| dc.identifier.issn | 1799-4934 (printed) | |
| dc.identifier.issn | 1799-4934 (ISSN-L) | |
| dc.identifier.uri | https://aaltodoc.aalto.fi/handle/123456789/124514 | |
| dc.identifier.urn | URN:ISBN:978-952-64-1524-6 | |
| dc.language.iso | en | en |
| dc.opn | Ravagnani, Alberto, Prof., Eindhoven University of Technology, Netherlands | |
| dc.publisher | Aalto University | en |
| dc.publisher | Aalto-yliopisto | fi |
| dc.relation.haspart | [Publication 1]: Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha, and Camilla Hollanti. Quantum Private Information Retrieval from Coded and Colluding Servers. IEEE Journal on Selected Areas in Information Theory , 1, no. 2: 599–610, August 2020. DOI: 10.1109/JSAIT.2020.3015089 | |
| dc.relation.haspart | [Publication 2]: Matteo Allaix, Seunghoan Song, Lukas Holzbaur, Tefjol Pllaha, Masahito Hayashi, and Camilla Hollanti. On the Capacity of Quantum Private Information Retrieval from MDS-Coded and Colluding Servers. IEEE Journal on Selected Areas in Communications, 40, no. 3: 885–898, January 2022. Full text in Acris/Aaltodoc: http://urn.fi/URN:NBN:fi:aalto-202204062716. DOI: 10.1109/JSAC.2022.3142363 | |
| dc.relation.haspart | [Publication 3]: Matteo Allaix, Yuxiang Lu, Yuhang Yao, Tefjol Pllaha, Camilla Hollanti, and Syed Jafar. N-Sum Box: An Abstraction for Linear Computation over Many-to-one Quantum Networks. Submitted to IEEE Transactions on Information Theory, June 2023. | |
| dc.relation.haspart | [Publication 4]: Perttu Saarela, Matteo Allaix, Ragnar Freij-Hollanti, and Camilla Hollanti. Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed–Muller Codes. In 2022 IEEE International Symposium on Information Theory (ISIT), Espoo, Finland, pp. 2839– 2844, June 2022. DOI: 10.1109/ISIT50566.2022.9834654 | |
| dc.relation.ispartofseries | Aalto University publication series DOCTORAL THESES | en |
| dc.relation.ispartofseries | 192/2023 | |
| dc.rev | Matthews, Gretchen, Prof., Virginia Tech, United States of America | |
| dc.rev | Ravagnani, Alberto, Prof., Eindhoven University of Technology, Netherlands | |
| dc.subject.keyword | coding theory | en |
| dc.subject.keyword | quantum computation | en |
| dc.subject.keyword | quantum private information retrieval | en |
| dc.subject.keyword | coded distributed storage systems | en |
| dc.subject.other | Computer science | en |
| dc.title | Quantum Private Information Retrieval from Coded Storage Systems | en |
| dc.type | G5 Artikkeliväitöskirja | fi |
| dc.type.dcmitype | text | en |
| dc.type.ontasot | Doctoral dissertation (article-based) | en |
| dc.type.ontasot | Väitöskirja (artikkeli) | fi |
| local.aalto.acrisexportstatus | checked 2023-11-29_0852 | |
| local.aalto.archive | yes | |
| local.aalto.formfolder | 2023_11_16_klo_10_53 |
Files
Original bundle
1 - 1 of 1