隐匿信息检索技术现状与展望

杜瑞颖; 黄正帝; 石闽; 周尔俊; 何琨; 陈晶

doi:10.12263/DZXB.20250525

您当前的位置：

首页 >

文章列表页 >

隐匿信息检索技术现状与展望

综述评论 | 更新时间：2026-04-24

- 隐匿信息检索技术现状与展望
- Private Information Retrieval: Current Status and Future Prospects
- 电子学报 2025年53卷第12期页码：4719-4739
- 作者机构：
  
  空天信息安全与可信计算教育部重点实验室，武汉大学国家网络安全学院，湖北武汉 430072
- 作者简介：
  
  [ "杜瑞颖女，1964年5月出生于河南省新乡市.博士.现为武汉大学教授、博士生导师.主要研究方向为网络安全、隐私保护、云安全和移动安全等. E-mail: duraying@whu.edu.cn" ]
  [ "黄正帝男，2001年7月出生于江西省抚州市.现为武汉大学在读硕士生.主要研究方向为隐私保护、应用密码学. E-mail: rechardhuang@whu.edu.cn" ]
  [ "石闽男，1993年3月出生于安徽省安庆市.现为武汉大学国家网络安全学院博士后研究员.主要研究方向为密码协议与形式化方法. E-mail: itachi@whu.edu.cn" ]
  [ "周尔俊男，1998年3月出生于湖南省岳阳市.现为武汉大学国家网络安全学院博士研究生.主要研究方向为安全多方计算、隐私计算. E-mail: sanfeng@whu.edu.cn" ]
  [ "何琨男，1986年10月出生于湖北省武汉市.现为武汉大学副教授、博士生导师.主要研究方向为应用密码学、网络安全、云计算安全、人工智能安全和区块链安全等.中国电子学会会员编号：E190156480M. E-mail: hekun@whu.edu.cn" ]
  [ "陈晶男，1981年3月出生于湖北省武汉市.现为武汉大学教授、博士生导师.主要研究方向为网络安全、人工智能安全、分布式系统安全和区块链等. E-mail: chenjing@whu.edu.cn" ]
- 基金信息：
  
  国家重点研发计划(2022YFB3102100);国家自然科学基金(62076187);湖北省重点研发计划(2024BAB018);武汉市知识创新专项(2023010201010062)
- DOI：10.12263/DZXB.20250525
  中图分类号： TP309;
- 收稿：2025-06-19，
  
  录用：2025-12-10，
  
  纸质出版：2025-12-25
- 稿件说明：
移动端阅览
杜瑞颖, 黄正帝, 石闽, 等. 隐匿信息检索技术现状与展望[J]. 电子学报, 2025, 53(12): 4719-4739.

DU Rui-ying, HUANG Zheng-di, SHI Min, et al. Private Information Retrieval: Current Status and Future Prospects[J]. Acta Electronica Sinica, 2025, 53(12): 4719-4739.
杜瑞颖, 黄正帝, 石闽, 等. 隐匿信息检索技术现状与展望[J]. 电子学报, 2025, 53(12): 4719-4739. DOI：10.12263/DZXB.20250525

DU Rui-ying, HUANG Zheng-di, SHI Min, et al. Private Information Retrieval: Current Status and Future Prospects[J]. Acta Electronica Sinica, 2025, 53(12): 4719-4739. DOI：10.12263/DZXB.20250525

摘要

在数据驱动决策的时代，大数据分析与云计算的深度融合在释放数据价值的同时，也将数据安全与隐私保护推向了核心挑战的前沿.隐匿信息检索作为关键的多方安全计算技术，允许用户从远程数据库中检索特定信息而完全不泄露查询目标，为不可信环境下的数据查询提供了坚实的隐私保障.该技术已在医疗、金融等诸多领域展现出应用潜力，持续受到学术界与工业界的广泛关注.然而，随着数据规模与用户数量的激增，现有方案面临着效率与实用性之间的显著矛盾.早期基于信息论安全的多服务器方案依赖多不合谋的强安全假设，而基于计算安全的单服务器方案则在通信、计算和存储开销上面临严峻挑战.因此，在确保安全的前提下，如何全面提升检索效率已成为推动该技术落地的核心问题.本文系统性地梳理与总结了隐匿信息检索技术的研究现状.首先，我们明确了隐匿信息检索的形式化定义及其核心属性，并概述了实现该技术的主流密码学原语.其次，本文构建了一个以服务器数量为依据的技术分类框架，将现有方案划分为多服务器与单服务器两大脉络，并深入剖析了基于函数秘密共享、可穿刺伪随机函数、同态加密及不经意传输等不同技术路线的设计原理与性能权衡.进一步地，本文探讨了为适应具体功能要求而衍生的多种实用变体，包括批处理隐匿信息检索、对称隐匿信息检索、关键字隐匿信息检索和可更新隐匿信息检索，分析了它们各自解决的问题与设计特点.在应用层面，本文通过社交发现、匿名通信和广告投递等典型场景，具体阐述了隐匿信息检索如何解决实际的隐私保护痛点.最后，基于全面的综述分析，本文展望了该领域的未来发展趋势，指出研究重点应聚焦于进一步优化理论开销、设计支持多功能的统一灵活框架，以及通过系统级创新解决实际部署难题，从而推动隐匿信息检索技术从理论走向广泛的实际应用.

Abstract

In the era of data-driven decision making

the deep integration of big data analytics and cloud computing has pushed data security and privacy protection to the forefront of core challenges while unleashing the value of data. As a key multi-party secure computing technology

private information retrieval allows users to retrieve specific information from remote databases without revealing the query target at all

providing a solid privacy guarantee for data query in untrustworthy environments. The technology has demonstrated its application potential in many fields

such as healthcare and finance

and continues to receive extensive attention from both academia and industry. However

with the proliferation of data size and number of users

the existing schemes face a significant contradiction between efficiency and practicality. Early multi-server schemes based on information-theoretic security rely on the strong security assumption of multiple non-collusion

while single-server schemes based on computational security face severe challenges in communication

computation

and storage overheads. Therefore

how to comprehensively improve the retrieval efficiency under the premise of ensuring security has become a core issue to drive the technology to the ground. In this paper

we systematically sort out and summarize the current research status of private information retrieval technology. First

we clarify the formal definition of private information retrieval and its core attributes

and outline the mainstream cryptographic primitives that realize the technology. Second

this paper constructs a technology categorization framework based on the number of servers

divides the existing schemes into two main vectors: multi-server and single-server

and deeply analyzes the design principles and performance trade-offs of different technology routes based on function secret sharing

puncturable pseudorandom function

homomorphic encryption and oblivious transfer. Further

this paper explores various practical variants derived to meet specific functional requirements

including batch private information retrieval

symmetric private information retrieval

keyword private information retrieval and updatable private information retrieval

and analyzes their respective problems and design features. At the application level

this paper specifically illustrates how private information retrieval can address practical privacy protection pain points through typical scenarios such as social discovery

anonymous communication and ad delivery. Finally

based on the comprehensive review and analysis

this paper looks forward to the future development trend of this area

pointing out that research should focus on further optimizing the theoretical overhead

designing a unified and flexible framework to support multi-functionality

and solving practical deployment challenges through system-level innovation

so as to promote private information retrieval technology from theory to a wide range of practical applications.

关键词

Keywords

references

CHOR B , GOLDREICH O , KUSHILEVITZ E , et al . Private information retrieval [C ] // Proceedings of IEEE 36th Annual Foundations of Computer Science . Piscataway : IEEE , 2002 : 41 - 50 .

BORISOV N , DANEZIS G , GOLDBERG I . DP5: A private presence service [J ] . Proceedings on Privacy Enhancing Technologies , 2015 , 2015( 2 ): 4 - 24 .

PARHI R , SCHLIEP M , HOPPER N . MP3: A more efficient private presence protocol [M ] // Financial Cryptography and Data Security . Berlin, Heidelberg : Springer , 2018 : 38 - 57 .

DEMMLER D , RINDAL P , ROSULEK M , et al . PIR-PSI: Scaling private contact discovery [J ] . Proceedings on Privacy Enhancing Technologies , 2018 , 2018( 4 ): 159 - 178 .

HETZ L , SCHNEIDER T , WEINERT C . Scaling mobile private contact discovery to billions of users [C ] // Computer Security-ESORICS 2023 . Cham : Springer , 2024 : 455 - 476 .

ANGEL S , SETTY S . Unobservable communication over fully untrusted infrastructure [C ] // Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation . New York : ACM , 2016 : 551 - 569 .

AHMAD I , YANG Y T , AGRAWAL D , et al . Addra: metadata-private voice communication over fully untrusted infrastructure [C ] // Proceedings of 15th USENIX Symposium on Operating Systems Design and Implementation . Berkeley : USENIX Association , 2021 : 313 - 329 .

VADAPALLI A , STORRIER K , HENRY R . Sabre: Sender-anonymous messaging with fast audits [C ] // 2022 IEEE Symposium on Security and Privacy . Piscataway : IEEE , 2022 : 1953 - 1970 .

TOVEY E , WEISS J , GILAD Y . Distributed PIR: Scaling private messaging via the users’ machines [C ] // Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security . New York : ACM , 2024 : 1967 - 1981 .

GREEN M , LADD W , MIERS I . A protocol for privately reporting ad impressions at scale [C ] // Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security . New York : ACM , 2016 : 1591 - 1601 .

MUGHEES M H , PESTANA G , DAVIDSON A , et al . PrivateFetch: Scalable catalog delivery in privacy-preserving advertising [EB/OL ] . ( 2021-09-16 )[ 2025-06-19 ] . https://arXiv.org/abs/2109.08189 https://arXiv.org/abs/2109.08189 .

SERVAN-SCHREIBER S , HOGAN K , DEVADAS S . Adveil: A private targeted advertising ecosystem [EB/OL ] . ( 2022-03-08 )[ 2025-06-19 ] . https://eprint.iacr.org/2021/1032 https://eprint.iacr.org/2021/1032 .

ZHONG K , MA Y P , ANGEL S . Ibex: Privacy-preserving ad conversion tracking and bidding [C ] // Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security . New York : ACM , 2022 : 3223 - 3237 .

CHOR B , GILBOA N . Computationally private information retrieval (extended abstract) [C ] // Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing . New York : ACM , 1997 : 304 - 313 .

KUSHILEVITZ E , OSTROVSKY R . Replication is not needed: Single database, computationally-private information retrieval [C ] // Proceedings 38th Annual Symposium on Foundations of Computer Science . Piscataway : IEEE , 2002 : 364 - 373 .

GOLDWASSER S , MICALI S . Probabilistic encryption [J ] . Journal of Computer and System Sciences , 1984 , 28 ( 2 ): 270 - 299 .

GHOSHAL A , ZHOU M X , SHI E . Efficient pre-processing PIR without public-key cryptography [C ] // Advances in Cryptology-EUROCRYPT 2024 . Cham : Springer , 2024 : 210 - 240 .

ZHOU M X , PARK A , ZHENG W T , et al . Piano: Extremely simple, single-server PIR with sublinear server computation [C ] // 2024 IEEE Symposium on Security and Privacy . Piscataway : IEEE , 2024 : 4296 - 4314 .

ALBAB K D , ISSA R , VARIA M , et al . Batched differentially private information retrieval [C ] // Proceedings of the 31st USENIX Security Symposium . Berkeley : USENIX Association , 2022 : 3327 - 3344 .

CHOR B , GILBOA N , NAOR M . Private information retrieval by keywords [EB/OL ] . ( 1998-02-03 )[ 2025-06-19 ] . http://eprint.iacr.org/1998/003 http://eprint.iacr.org/1998/003 .

AGUILAR-MELCHOR C , BARRIER J , FOUSSE L , et al . XPIR: Private information retrieval for everyone [J ] . Proceedings on Privacy Enhancing Technologies , 2016 , 2016( 2 ): 155 - 174 .

ANGEL S , CHEN H , LAINE K , et al . PIR with compressed queries and amortized query processing [C ] // 2018 IEEE Symposium on Security and Privacy . Piscataway : IEEE , 2018 : 962 - 979 .

GASARCH W I . A survey on private information retrieval [J ] . Bulletin of EATCS , 2004 , 82 : 72 - 107 .

OSTROVSKY R , SKEITH W E III . A survey of single-database private information retrieval: Techniques and applications [M ] // Public Key Cryptography - PKC 2007 . Berlin, Heidelberg : Springer , 2007 : 393 - 411 .

ALFARANO G N , KHATHURIA K , WEGER V . A survey on single server private information retrieval in a coding theory perspective [J ] . Applicable Algebra in Engineering, Communication and Computing , 2023 , 34 ( 3 ): 335 - 358 .

HOLZBAUR L , HOLLANTI C , WACHTER-ZEH A . Computational code-based single-server private information retrieval [C ] // 2020 IEEE International Symposium on Information Theory . Piscataway : IEEE , 2020 : 1065 - 1070 .

AGUILAR MELCHOR C , GABORIT P . A fast private information retrieval protocol [C ] // 2008 IEEE International Symposium on Information Theory . Piscataway : IEEE , 2008 : 1848 - 1852 .

REGEV O . On lattices, learning with errors, random linear codes, and cryptography [C ] // Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing . New York : ACM , 2005 : 84 - 93 .

VITHANA S , WANG Z S , ULUKUS S . Private information retrieval and its extensions: An introduction, open problems, future directions [J ] . IEEE BITS the Information Theory Magazine , 2023 , 3 ( 4 ): 67 - 85 .

KIM J , PARK J , SUNG H M . Private information retrieval based on homomorphic encryption, revisited [J/OL ] . IACR Cryptology ePrint Archive , 2025 : 729 . https://eprint.iacr.org/2025/729 https://eprint.iacr.org/2025/729 .

NGUYEN H D , GUAJARDO J , HOANG T . Client-efficient online-offline private information retrieval [J ] . Proceedings on Privacy Enhancing Technologies , 2025 ( 3 ): 192 - 212 .

HOOVER A , PATEL S , PERSIANO G , et al . Plinko: Single-server PIR with efficient updates via invertible PRFs [C ] // Advances in Cryptology-EUROCRYPT 2025 . Cham : Springer , 2025 : 3 - 33 .

BOYLE E , GILBOA N , ISHAI Y . Function secret sharing [M ] // Advances in Cryptology - EUROCRYPT 2015 . Berlin, Heidelberg : Springer , 2015 : 337 - 367 .

BOYLE E , GILBOA N , ISHAI Y . Function secret sharing: Improvements and extensions [C ] // Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security . New York : ACM , 2016 : 1292 - 1303 .

GILBOA N , ISHAI Y . Distributed point functions and their applications [C ] // Advances in Cryptology-EUROCRYPT 2014 . Berlin : Springer , 2014 : 640 - 658 .

GOLDREICH O , GOLDWASSER S , MICALI S . How to construct random functions [J ] . Journal of the ACM , 1986 , 33 ( 4 ): 792 - 807 .

WANG F , YUN C , GOLDWASSER S , et al . Splinter: practical private queries on public data [C ] // Proceedings of the 14th USENIX Symposium on Networked Systems Design and Implementation . Berkeley : USENIX Association , 2017 : 299 - 313 .

Corporation Intel . Advanced encryption standard instructions (AES-NI) [EB/OL ] . ( 2012-02-02 )[ 2025-06-19 ] . https://www.intel.cn/content/www/cn/zh/developer/articles/technical/advanced-encryption-standard-instructions-aes-ni.html https://www.intel.cn/content/www/cn/zh/developer/articles/technical/advanced-encryption-standard-instructions-aes-ni.html .

KRUGLIK S , DAU S H , KIAH H M , et al . Verifiable information-theoretic function secret sharing [EB/OL ] . ( 2024-03-18 )[ 2025-06-19 ] . https://eprint.iacr.org/2024/453 https://eprint.iacr.org/2024/453 .

KRUGLIK S , DAU S H , KIAH H M , et al . Querying twice to achieve information-theoretic verifiability in private information retrieval [J ] . IEEE Transactions on Information Forensics and Security , 2024 , 19 : 8172 - 8187 .

PARK A , LEONG T , MATURANA F , et al . Communication-efficient, fault tolerant PIR over erasure coded storage [C ] // 2024 IEEE Symposium on Security and Privacy . Piscataway : IEEE , 2024 : 4331 - 4347 .

SHAMIR A . How to share a secret [J ] . Communications of the ACM , 1979 , 22 ( 11 ): 612 - 613 .

XING P Z , LI H W , HAO M , et al . Distributed function secret sharing and applications [EB/OL ] . ( 2025 )[ 2025-06-19 ] . https://www.ndss-symposium.org/wp-content/uploads/2025-2233-paper.pdf https://www.ndss-symposium.org/wp-content/uploads/2025-2233-paper.pdf .

KIM D , SON Y , KIM D , et al . Privacy-preserving approximate GWAS computation based on homomorphic encryption [J ] . BMC Medical Genomics , 2020 , 13 ( 7 ): 77 .

BEIMEL A , ISHAI Y , MALKIN T . Reducing the servers computation in private information retrieval: PIR with preprocessing [C ] // Advances in Cryptology - CRYPTO 2000 . Berlin : Springer , 2000 : 55 - 73 .

CORRIGAN-GIBBS H , KOGAN D . Private information retrieval with sublinear online time [C ] // Advances in Cryptology-EUROCRYPT 2020 . Cham : Springer , 2020 : 44 - 75 .

SHI E , AQEEL W , CHANDRASEKARAN B , et al . Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time [C ] // Advances in Cryptology - CRYPTO 2021 . Cham : Springer , 2021 : 641 - 669 .

RISTENPART T , YILEK S . The mix-and-cut shuffle: Small-domain encryption secure against N queries [C ] // Advances in Cryptology - CRYPTO 2013 . Berlin : Springer , 2013 : 392 - 409 .

STEFANOV E , SHI E . FastPRP: Fast pseudo-random permutations for small do-mains [EB/OL ] . ( 2012-06-15 )[ 2025-06-19 ] . https://eprint.iacr.org/2012/254 https://eprint.iacr.org/2012/254 .

LAZZARETTI A , PAPAMANTHOU C . TreePIR: Sublinear-time and polylog-bandwidth private information retrieval from DDH [C ] // Advances in Cryptology - CRYPTO 2023 . Cham : Springer , 2023 : 284 - 314 .

BONEH D . The decision diffie-Hellman problem [C ] // Algorithmic Number Theory . Berlin : Springer , 1998 : 48 - 63 .

ZHOU M X , LIN W K , TSELEKOUNIS Y , et al . Optimal single-server private information retrieval [C ] // Advances in Cryptology-EUROCRYPT 2023 . Cham : Springer , 2023 : 395 - 425 .

SINGH J , WEI Y , ZIKAS V . Information-theoretic multi-server private information retrieval with client preprocessing [C ] // Theory of Cryptography . Cham : Springer , 2025 : 423 - 450 .

DOTTLING N , DUJMOVIC J , LOSS J , et al . Minicrypt PIR for big batches [EB/OL ] . ( 2025-02-21 )[ 2025-06-19 ] . https://eprint.iacr.org/2025/317 https://eprint.iacr.org/2025/317 .

LAZZARETTI A , PAPAMANTHOU C . Single pass client-preprocessing private information retrieval [C ] // Proceedings of the 33rd USENIX Conference on Security Symposium . New York : ACM , 2024 : 5967 - 5984 .

DURSTENFELD R . Algorithm 235: Random permutation [J ] . Communications of the ACM , 1964 , 7 ( 7 ): 420 - 421 .

KNUTH D E . The Art of Computer Programming, Volume II: Seminumerical Algorithms [M ] . Massachusetts : Addison-Wesley , 1997 .

ROCHE D S , AVIV A , CHOI S G , et al . Deterministic, stash-free write-only ORAM [C ] // Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security . New York : ACM , 2017 : 507 - 521 .

CRAMER R , GENNARO R , SCHOENMAKERS B . A secure and optimally efficient multi-authority election scheme [C ] // Advances in Cryptology - EUROCRYPT'97 . Berlin : Springer , 1997 : 103 - 118 .

刘明洁 , 王安 . 全同态加密研究动态及其应用概述 [J ] . 计算机研究与发展 , 2014 , 51 ( 12 ): 2593 - 2603 .

LIU M J , WANG A . Fully homomorphic encryption and its applications [J ] . Journal of Computer Research and Development , 2014 , 51 ( 12 ): 2593 - 2603 . (in Chinese)

杨亚涛 , 赵阳 , 张卷美 , 等 . 同态密码理论与应用进展 [J ] . 电子与信息学报 , 2021 , 43 ( 2 ): 475 - 487 .

YANG Y T , ZHAO Y , ZHANG J M , et al . Theory and application progress of homomorphic cryptography [J ] . Journal of Electronics & Information Technology , 2021 , 43 ( 2 ): 475 - 487 . (in Chinese)

周素芳 , 窦家维 , 郭奕旻 , 等 . 安全多方向量计算 [J ] . 计算机学报 , 2017 , 40 ( 5 ): 1134 - 1150 .

ZHOU S F , DOU J W , GUO Y M , et al . Secure multi-party vector calculation [J ] . Chinese Journal of Computers , 2017 , 40 ( 5 ): 1134 - 1150 . (in Chinese)

李顺东 , 赵雪玲 , 家珠亮 , 等 . 集合交集元素和的保密计算 [J ] . 电子学报 , 2023 , 51 ( 1 ): 86 - 92 .

LI S D , ZHAO X L , JIA Z L , et al . Secure calculation of the sum of elements in the intersection of sets [J ] . Acta Electronica Sinica , 2023 , 51 ( 1 ): 86 - 92 . (in Chinese)

马秀莲 , 张倦倦 , 李顺东 , 等 . 保密计算交集对应元素和的最大值 [J ] . 电子学报 , 2023 , 51 ( 7 ): 1835 - 1841 .

MA X L , ZHANG J J , LI S D , et al . The maximum value of the sum of elements corresponding to the intersection of secret computation [J ] . Acta Electronica Sinica , 2023 , 51 ( 7 ): 1835 - 1841 . (in Chinese)

窦家维 , 刘旭红 , 周素芳 , 等 . 高效的集合安全多方计算协议及应用 [J ] . 计算机学报 , 2018 , 41 ( 8 ): 1844 - 1860 .

DOU J W , LIU X H , ZHOU S F , et al . Efficient set security multiparty computing protocol and its application [J ] . Chinese Journal of Computers , 2018 , 41 ( 8 ): 1844 - 1860 . (in Chinese)

巩林明 , 李顺东 , 窦家维 , 等 . 同态加密方案及安全两点直线计算协议 [J ] . 软件学报 , 2017 , 28 ( 12 ): 3274 - 3292 .

GONG L M , LI S D , DOU J W , et al . Homomorphic encryption scheme and secure two-point straight line calculation protocol [J ] . Journal of Software , 2017 , 28 ( 12 ): 3274 - 3292 . (in Chinese)

陈振华 , 李顺东 , 陈立朝 , 等 . 点和区间关系的全隐私保密判定 [J ] . 中国科学(信息科学) , 2018 , 48 ( 2 ): 187 - 204 .

CHEN Z H , LI S D , CHEN L C , et al . Full privacy and confidentiality judgment of the relationship between point and interval [J ] . Science in China (Information Sciences) , 2018 , 48 ( 2 ): 187 - 204 . (in Chinese)

李宗育 , 桂小林 , 顾迎捷 , 等 . 同态加密技术及其在云计算隐私保护中的应用 [J ] . 软件学报 , 2018 , 29 ( 7 ): 1827 - 1851 .

LI Z Y , GUI X L , GU Y J , et al . Homomorphic encryption technology and its application in privacy protection of cloud computing [J ] . Journal of Software , 2018 , 29 ( 7 ): 1827 - 1851 . (in Chinese)

李顺东 , 窦家维 , 王道顺 , 等 . 同态加密算法及其在云安全中的应用 [J ] . 计算机研究与发展 , 2015 , 52 ( 6 ): 1378 - 1388 .

LI S D , DOU J W , WANG D S , et al . Homomorphic encryption algorithm and its application in cloud security [J ] . Journal of Computer Research and Development , 2015 , 52 ( 6 ): 1378 - 1388 . (in Chinese)

李占利 , 陈立朝 , 陈振华 , 等 . 云环境下多方保密计算最大值、最小值及其统计学应用 [J ] . 密码学报 , 2019 , 6 ( 2 ): 219 - 233 .

LI Z L , CHEN L C , CHEN Z H , et al . Maximum and minimum values of multi-party secret calculation in cloud environment and its statistical application [J ] . Journal of Cryptologic Reseatch , 2019 , 6 ( 2 ): 219 - 233 . (in Chinese)

MENON S J , WU D J . SPIRAL: Fast, high-rate single-server PIR via FHE composition [C ] // 2022 IEEE Symposium on Security and Privacy . Piscataway : IEEE , 2022 : 930 - 947 .

GENTRY C , SAHAI A , WATERS B . Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based [M ] // Advances in Cryptology . Berlin, Heidelberg : Springer , 2013 : 75 - 92 .

HENZINGER A , HONG M M , CORRIGAN-GIBBS H , et al . One server for the price of two: simple and fast single-server private information retrieval [C ] // Proceedings of the 32nd USENIX Security Symposium . Berkeley : USENIX Association , 2023 : 3889 - 3905 .

LAURIE B . Certificate transparency [J ] . Communications of the ACM , 2014 , 57 ( 10 ): 40 - 46 .

MEIKLEJOHN S , DEBLASIO J , O’BRIEN D , et al . SoK: SCT auditing in certificate transparency [J ] . Proceedings on Privacy Enhancing Technologies , 2022 , 2022( 3 ): 336 - 353 .

CASTRO D L , LEWI K , SUH E . WhisPIR: Stateless private information retrieval with low communication [EB/OL ] . ( 2024-02-19 )[ 2025-06-19 ] . https://eprint.iacr.org/2024/266 https://eprint.iacr.org/2024/266 .

BRAKERSKI Z , GENTRY C , VAIKUNTANATHAN V . (leveled) fully homomorphic encryption without bootstrapping [J ] . ACM Transactions on Computation Theory (TOCT) , 2014 , 6 ( 3 ): 1 - 36 .

LUO M , LIU F H , WANG H . Faster FHE-based single-server private information retrieval [C ] // Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security . New York : ACM , 2024 : 1405 - 1419 .

LYUBASHEVSKY V , PEIKERT C , REGEV O . On ideal lattices and learning with errors over rings [C ] // Advances in Cryptology - EUROCRYPT 2010 . Berlin : Springer , 2010 : 1 - 23 .

HALEVI S , SHOUP V . Faster homomorphic linear transformations in HElib [C ] // Advances in Cryptology - CRYPTO 2018 . Cham : Springer , 2018 : 93 - 120 .

KANG J Y , SCHILD L . Pirouette: Query efficient single-server PIR [J ] . IACR Cryptol. EPrint Arch. , 2025 , 2025 : 680 .

CHILLOTTI I , GAMA N , GEORGIEVA M , et al . Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds [C ] // Advances in Cryptology - ASIACRYPT 2016 . Berlin : Springer , 2016 : 3 - 33 .

KLUCZNIAK K . NTRU-v-um: Secure fully homomorphic encryption from NTRU with small modulus [C ] // Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security . New York : ACM , 2022 : 1783 - 1797 .

ZHOU F C , SUN J T , WANG Q , et al . Efficient private information retrievals for single-server based on verifiable homomorphic encryption [J ] . Computer Standards & Interfaces , 2025 , 93 : 103961 .

PARNO B , HOWELL J , GENTRY C , et al . Pinocchio: Nearly practical verifiable computation [J ] . Communications of the ACM , 2016 , 59 ( 2 ): 103 - 112 .

YU Q , MADDAH-ALI M ALI , AVESTIMEHR A S . Polynomial codes: An optimal design for high-dimensional coded matrix multiplication [EB/OL ] . ( 2018-01-24 )[ 2025-06-19 ] . https://arXiv.org/abs/1705.10464 https://arXiv.org/abs/1705.10464 .

RABIN M O . How to exchange secrets with oblivious transfer [EB/OL ] . ( 2011-10-18 )[ 2025-06-19 ] . https://eprint.iacr.org/2005/187 https://eprint.iacr.org/2005/187 .

BELLARE M , MICALI S . Non-interactive oblivious transfer and applications [C ] // Advances in Cryptology - CRYPTO’ 89 Proceedings . New York : Springer , 1990 : 547 - 557 .

BRASSARD G , CREPEAU C , ROBERT J M . All-or-nothing disclosure of secrets [M ] // Advances in Cryptology - CRYPTO'86 . Berlin, Heidelberg : Springer , 2007 : 234 - 238 .

石润华 , 仲红 , 崔杰 , 等 . 具有统计特性的不经意传输协议 [J ] . 电子学报 , 2014 , 42 ( 11 ): 2273 - 2279 .

SHI R H , ZHONG H , CUI J , et al . Unintentional transport protocol with statistical characteristics [J ] . Acta Electronica Sinica , 2014 , 42 ( 11 ): 2273 - 2279 . (in Chinese)

冯涛 , 马建峰 , 李凤华 , 等 . UC 安全的高效不经意传输协议 [J ] . 电子学报 , 2008 , 36 ( 1 ): 17 - 23 .

FENG T , MA J F , LI F H , et al . Efficient and casual transport protocol for UC security [J ] . Acta Electronica Sinica , 2008 , 36 ( 1 ): 17 - 23 . (in Chinese)

DÖTTLING N , GARG S , ISHAI Y , et al . Trapdoor hash functions and their applications [C ] // Advances in Cryptology - CRYPTO 2019 . Cham : Springer , 2019 : 3 - 32 .

LIPMAA H . An oblivious transfer protocol with log-squared communication [C ] // Information Security . Berlin : Springer , 2005 : 314 - 328 .

GARG S , HAJIABADI M , OSTROVSKY R . Efficient range-trapdoor functions and applications: Rate-1 OT and more [C ] // Theory of Cryptography . Cham : Springer , 2020 : 88 - 116 .

CHASE M , GARG S , HAJIABADI M , et al . Amortizing rate-1 OT and applications to PIR and PSI [C ] // Theory of Cryptography . Cham : Springer , 2021 : 126 - 156 .

BALLARD L , GREEN M , MEDEIROS B D , et al . Correlation-resistant storage via key-word-searchable encryption [EB/OL ] . ( 2005-11-22 )[ 2025-06-19 ] . https://eprint.iacr.org/2005/417 https://eprint.iacr.org/2005/417 .

BRANCO P , DÖTTLING N , SRINIVASAN A . A framework for statistically sender private OT with optimal rate [C ] // Advances in Cryptology - CRYPTO 2023 . Cham : Springer , 2023 : 548 - 576 .

BITANSKY N , FREIZEIT S . Statistically sender-private OT from LPN and derandomization [C ] // Advances in Cryptology - CRYPTO 2022 . Cham : Springer , 2022 : 625 - 653 .

COUTEAU G , DEVADAS L , DEVADAS S , et al . QuietOT: Lightweight oblivious transfer with a public-key setup [C ] // Advances in Cryptology - ASIACRYPT 2024 . Singapore : Springer , 2025 : 197 - 231 .

SERVAN-SCHREIBER S . Constrained pseudorandom functions for inner-product predicates from weaker assumptions [C ] // Advances in Cryptology - ASIACRYPT 2024 . Singapore : Springer , 2025 : 232 - 265 .

MAHDAVI R A , KERSCHBAUM F . Constant-weight PIR: Single-round keyword PIR via constant-weight equality operators [EB/OL ] . ( 2022-02-16 )[ 2025-06-19 ] . https://arXiv.org/abs/2202.07569 https://arXiv.org/abs/2202.07569 .

BENTLEY J L , SAXE J B . Decomposable searching problems I. Static-to-dynamic transformation [J ] . Journal of Algorithms , 1980 , 1 ( 4 ): 301 - 358 .

ISHAI Y , KUSHILEVITZ E , OSTROVSKY R , et al . Batch codes and their applications [C ] // Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing . New York : ACM , 2004 : 262 - 271 .

HENRY R . Polynomial batch codes for efficient IT-PIR [J ] . Proceedings on Privacy Enhancing Technologies , 2016 ( 4 ): 202 - 218 .

MUGHEES M H , REN L . Vectorized batch private information retrieval [C ] // 2023 IEEE Symposium on Security and Privacy . Piscataway : IEEE , 2023 : 437 - 452 .

LIU J , LI J Y , WU D , et al . PIRANA: Faster multi-query PIR via constant-weight codes [C ] // 2024 IEEE Symposium on Security and Privacy . Piscataway : IEEE , 2024 : 4315 - 4330 .

SMART N P , VERCAUTEREN F . Fully homomorphic SIMD operations [J ] . Designs, Codes and Cryptography , 2014 , 71 ( 1 ): 57 - 81 .

GERTNER Y , ISHAI Y , KUSHILEVITZ E , et al . Protecting data privacy in private information retrieval schemes [C ] // Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing . New York : ACM , 1998 : 151 - 160 .

WANG Z S , ULUKUS S . Symmetric private information retrieval at the private information retrieval rate [J ] . IEEE Journal on Selected Areas in Information Theory , 2022 , 3 ( 2 ): 350 - 361 .

LIN C Y , LIU Z Y , MALKIN T . XSPIR: Efficient symmetrically private information retrieval from ring-LWE [C ] // Computer Security - ESORICS 2022 . Cham : Springer , 2022 : 217 - 236 .

DUCAS L , STEHLÉ D . Sanitization of FHE ciphertexts [C ] // Advances in Cryptology - EUROCRYPT 2016 . Berlin : Springer , 2016 : 294 - 310 .

LI S S , PENG L Q , LIU W R , et al . BitBatSPIR: Efficient batch symmetric private information retrieval from PSI [J ] . IEEE Transactions on Dependable and Secure Computing , 2025 , 22 ( 6 ): 6028 - 6039 .

PATEL S , SEO J Y , YEO K . Don't be dense: Efficient keyword PIR for sparse databases [C ] // Proceedings of the 32nd USENIX Security Symposium . Berkeley : USENIX Association , 2023 : 3853 - 3870 .

CELI S , DAVIDSON A . Call me by my name: Simple, practical private information retrieval for keyword queries [C ] // Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security . New York : ACM , 2024 : 4107 - 4121 .

GRAF T M , LEMIRE D . Binary fuse filters: Fast and smaller than xor filters [J ] . Journal of Experimental Algorithmics (JEA) , 2022 , 27 : 1 - 15 .

XU K X , SU L , HE S , et al . BstPIR: Keyword private information retrieval based on binary search trees [J ] . IEEE Internet of Things Journal , 2025 , 12 ( 12 ): 21304 - 21314 .

HAO M , LIU W R , PENG L Q , et al . Practical keyword private information retrieval from key-to-index mappings [C ] // Proceedings of the 34th USENIX Security Symposium . Berkeley : USENIX Association , 2025 : 3397 - 3416 .

GUPTA T , CROOKS N , MULHERN W , et al . Scalable and private media consumption with Popcorn [C ] // Proceedings of the 13th Usenix Conference on Networked Systems Design and Implementation . New York : ACM , 2016 : 91 - 107 .

CHENG R , SCOTT W , MASSEROVA E , et al . Talek: Private group messaging with hidden access patterns [C ] // Proceedings of the 36th Annual Computer Security Applications Conference . New York : ACM , 2020 : 84 - 99 .

KOGAN D , CORRIGAN-GIBBS H . Private blocklist lookups with checklist [C ] // Proceedings of the 30th USENIX Security Symposium . Berkeley : USENIX Association , 2021 : 875 - 892 .

MA Y P , ZHONG K , RABIN T , et al . Incremental offline/online PIR [C ] // Proceedings of the 31st USENIX Security Symposium . Berkeley : USENIX Association , 2022 : 1741 - 1758 .

田秀霞 , 王晓玲 , 高明 , 等 . 数据库服务: 安全与隐私保护 [J ] . 软件学报 , 2010 , 21 ( 5 ): 991 - 1006 .

TIAN X X , WANG X L , GAO M , et al . Database service-security and privacy protection [J ] . Journal of Software , 2010 , 21 ( 5 ): 991 - 1006 . (in Chinese)

孟小峰 , 张啸剑 . 大数据隐私管理 [J ] . 计算机研究与发展 , 2015 , 52 ( 2 ): 265 - 281 .

MENG X F , ZHANG X J . Big data privacy management [J ] . Journal of Computer Research and Development , 2015 , 52 ( 2 ): 265 - 281 . (in Chinese)

钱文君 , 沈晴霓 , 吴鹏飞 , 等 . 大数据计算环境下的隐私保护技术研究进展 [J ] . 计算机学报 , 2022 , 45 ( 4 ): 669 - 701 .

QIAN W J , SHEN Q N , WU P F , et al . Research progress of privacy protection technology in big data computing environment [J ] . Chinese Journal of Computers , 2022 , 45 ( 4 ): 669 - 701 . (in Chinese)

曹珍富 , 董晓蕾 , 周俊 , 等 . 大数据安全与隐私保护研究进展 [J ] . 计算机研究与发展 , 2016 , 53 ( 10 ): 2137 - 2151 .

CAO Z F , DONG X L , ZHOU J , et al . Research progress of big data security and privacy protection [J ] . Journal of Computer Research and Development , 2016 , 53 ( 10 ): 2137 - 2151 . (in Chinese)

SAINT-ANDRE P , SMITH K , TRONČON R . XMPP - The Definitive Guide: Building Real-Time Applications with Jabber Technologies [M ] . California : O’Reilly , 2009 .

PINKAS B , SCHNEIDER T , ZOHNER M . Scalable private set intersection based on OT extension [J ] . ACM Transactions on Privacy and Security (TOPS) , 2018 , 21 ( 2 ): 1 - 35 .

EPPSTEIN D . Cuckoo filter: Simplification and analysis [EB/OL ] . ( 2016-04-20 )[ 2025-06-19 ] . https://arxiv.org/abs/1604.06067 https://arxiv.org/abs/1604.06067 .

FREIVALDS R . Probabilistic machines can use less running time [EB/OL ] . ( 1977 )[ 2025-06-19 ] . https://www.semanticscholar.org/paper/Probabilistic-Machines-Can-Use-Less-Running-Time-Freivalds/4d7756df23e6162994de1806761d8e3afcb9aac4 https://www.semanticscholar.org/paper/Probabilistic-Machines-Can-Use-Less-Running-Time-Freivalds/4d7756df23e6162994de1806761d8e3afcb9aac4 .

TOUBIANA V , NARAYANAN A , BONEH D , et al . Adnostic: Privacy preserving targeted advertising [C ] // Proceedings of the Network and Distributed System Security Symposium . California : Internet Society , 2010 .

GIONIS A , INDYK P , MOTWANI R . Similarity search in high dimensions via hashing [C ] // Proceedings of the 25th International Conference on Very Large Data Bases . New York : ACM , 1999 : 518 - 529 .

KREUTER B , LEPOINT T , ORRÙ M , et al . Anonymous tokens with private metadata bit [C ] // Advances in Cryptology - CRYPTO 2020 . Cham : Springer , 2020 : 308 - 336 .

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

面向CNN的区块链可信隐私服务计算模型

区块链赋能可信数据空间安全的研究进展

融合多源城市环境信息的知识图谱驱动轨迹生成模型