1. NCCU Academic Hub
  2. 學術產出
  3. College of Informatics
  4. Proceedings
  5. Item

學術產出-Proceedings

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 Multi-value Private Information Retrieval using Homomorphic Encryption
作者 左瑞麟
Tso, Raylin
Hsu, Hsiang-Chen
Liu, Zi-Yuan
Chen, Kung
貢獻者 資科系
關鍵詞 private information retrieval ; communication complexity ; homomorphic encryption
日期 2020-08
上傳時間 9-Dec-2021 16:08:38 (UTC+8)
摘要 Private information retrieval (PIR) is a privacy protection that allows users to retrieve information from a database without revealing any information about the retrieved data to the server. Since the pioneering work of Chor et al. (FOCS "95) and of Kushilevitz and Ostrovsky (FOCS "97), PIR has been extensively studied (especially the single database setting) in the past two decades. However, most protocols only allow users to retrieve only one data at a time, which leads to high communication costs. To solve this issue, this work proposes a multi-value private information retrieval protocol using group homomorphic encryption, which allows users to retrieve multiple values at a time. We compared our work with that of Ostrovsky and Skeith (PKC "07) and show that retrieving multiple data at a time significantly can significantly reduces communication costs. Furthermore, we provide rigorous proof that if the underlying group homomorphic encryption is secure, then no attacker can know what data the user has retrieved.
關聯 2020 15th Asia Joint Conference on Information Security (AsiaJCIS)
資料類型 conference
DOI https://doi.org/10.1109/AsiaJCIS50894.2020.00024
dc.contributor 資科系-
dc.creator (作者) 左瑞麟-
dc.creator (作者) Tso, Raylin-
dc.creator (作者) Hsu, Hsiang-Chen-
dc.creator (作者) Liu, Zi-Yuan-
dc.creator (作者) Chen, Kung-
dc.date (日期) 2020-08-
dc.date.accessioned 9-Dec-2021 16:08:38 (UTC+8)-
dc.date.available 9-Dec-2021 16:08:38 (UTC+8)-
dc.date.issued (上傳時間) 9-Dec-2021 16:08:38 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/138285-
dc.description.abstract (摘要) Private information retrieval (PIR) is a privacy protection that allows users to retrieve information from a database without revealing any information about the retrieved data to the server. Since the pioneering work of Chor et al. (FOCS "95) and of Kushilevitz and Ostrovsky (FOCS "97), PIR has been extensively studied (especially the single database setting) in the past two decades. However, most protocols only allow users to retrieve only one data at a time, which leads to high communication costs. To solve this issue, this work proposes a multi-value private information retrieval protocol using group homomorphic encryption, which allows users to retrieve multiple values at a time. We compared our work with that of Ostrovsky and Skeith (PKC "07) and show that retrieving multiple data at a time significantly can significantly reduces communication costs. Furthermore, we provide rigorous proof that if the underlying group homomorphic encryption is secure, then no attacker can know what data the user has retrieved.-
dc.format.extent 159267 bytes-
dc.format.mimetype application/pdf-
dc.relation (關聯) 2020 15th Asia Joint Conference on Information Security (AsiaJCIS)-
dc.subject (關鍵詞) private information retrieval ; communication complexity ; homomorphic encryption-
dc.title (題名) Multi-value Private Information Retrieval using Homomorphic Encryption-
dc.type (資料類型) conference-
dc.identifier.doi (DOI) 10.1109/AsiaJCIS50894.2020.00024-
dc.doi.uri (DOI) https://doi.org/10.1109/AsiaJCIS50894.2020.00024-