Publicly Verifiable Private Information Retrieval Protocols Based on Function Secret Sharing
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908543688376320 |
|---|---|
| author | Zhu, Lin Kong, Lingwei Ning, Xin Qu, Xiaoyang Wang, Jianzong |
| author_facet | Zhu, Lin Kong, Lingwei Ning, Xin Qu, Xiaoyang Wang, Jianzong |
| contents | Private Information Retrieval (PIR) is a fundamental cryptographic primitive that enables users to retrieve data from a database without revealing which item is being accessed, thereby preserving query privacy. However, PIR protocols also face the challenge of result verifiability, as users expect the reconstructed data to be trustworthy and authentic. In this work, we propose two effective constructions of publicly verifiable PIR (PVPIR) in the multi-server setting, which achieve query privacy, correctness, and verifiability simultaneously. We further present three concrete instantiations based on these constructions. For the point query, our protocol introduces minimal computational overhead and achieves strong verifiability guarantees with significantly lower communication costs compared to existing Merkle tree-based approaches. For the predicate query, the communication complexity of our scheme remains stable as the database size increases, demonstrating strong scalability and suitability for large-scale private query applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_13684 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Publicly Verifiable Private Information Retrieval Protocols Based on Function Secret Sharing Zhu, Lin Kong, Lingwei Ning, Xin Qu, Xiaoyang Wang, Jianzong Cryptography and Security Private Information Retrieval (PIR) is a fundamental cryptographic primitive that enables users to retrieve data from a database without revealing which item is being accessed, thereby preserving query privacy. However, PIR protocols also face the challenge of result verifiability, as users expect the reconstructed data to be trustworthy and authentic. In this work, we propose two effective constructions of publicly verifiable PIR (PVPIR) in the multi-server setting, which achieve query privacy, correctness, and verifiability simultaneously. We further present three concrete instantiations based on these constructions. For the point query, our protocol introduces minimal computational overhead and achieves strong verifiability guarantees with significantly lower communication costs compared to existing Merkle tree-based approaches. For the predicate query, the communication complexity of our scheme remains stable as the database size increases, demonstrating strong scalability and suitability for large-scale private query applications. |
| title | Publicly Verifiable Private Information Retrieval Protocols Based on Function Secret Sharing |
| topic | Cryptography and Security |
| url | https://arxiv.org/abs/2509.13684 |