摘要
为了解决私有数据库信息检索面临的计算安全性和通信量之间很难达到合理的平衡状态的问题,提出一种基于任意第三方的检索方案。通过对现有的私有信息检索方案进行深入分析,找出研究的难点。基于计算不可分辨性概念以及可交换加密函数的理论,建立了一种依赖于任意第三方的私有信息检索方案。该方案充分解放了被请求方,并且可以安全高效地应用于日益频繁的相互协作查询中。对其正确性和安全性给予了分析和证明,实验结果表明了该算法的优化性。
To solve the problem of difficulty achieving the balance between computational security and traffic for information retrieval of private database,a program based on any third-party is proposed.Firstly,the difficulty of research is found out by means of deep analysis on existing private information retrieval programs.Based on the concept of indistinguishability and the theory of commutative encryption,a private information retrieval program depending on any third-party is constructed.The program fully liberates the requested party,and can be safely and efficiently applied to the increasingly frequent interaction query.The analysis and validation? of its correctness and security are carried out and the optimization of this algorithm is verified by the experiment.
出处
《计算机工程与设计》
CSCD
北大核心
2010年第13期2959-2961,3127,共4页
Computer Engineering and Design
基金
国家自然科学基金项目(60773100)
关键词
安全多方计算
私有数据库
信息检索
任意第三方
密码学
secure multi-party computation
private database
information retrieval
any third-party
cryptography