高级检索

    基于同态加密支持模糊查询的高效隐私信息检索协议

    An Efficient Private Information Retrieval Protocol Based on Homomorphic Encryption Supporting Wildcard Query

    • 摘要: 隐私信息检索技术可以在进行数据检索的同时保护用户查询隐私,然而现有的隐私信息检索协议仍然不够高效,且功能较为薄弱。基于同态加密和数论原理,提出了一种高效的密文匹配机制,并在此之上设计了一个支持模糊查询的无交互对称隐私数据检索协议,从效率和功能性两个角度着手,显著提升了隐私信息检索的效率,并扩展了协议的功能。在本方案中,对上万条记录进行的单次查询仅需要秒级别的延时,在服务端延时方面优于当下最高效的关键词隐私信息检索方案,并且本方案允许进行带有通配符的模糊查询以及多关键词的查询,可以在保护用户和数据隐私的同时,获得趋近于明文查询的体验。

       

      Abstract: Private information retrieval techniques can protect user query privacy while conducting data retrieval. However, the existing privacy information retrieval protocols are still not efficient enough and have relatively weak functions. Based on homomorphic encryption and number theory principles, an efficient ciphertext matching mechanism is proposed, and a non-interactive symmetric private data retrieval protocol is designed to support fuzzy queries. From the perspectives of efficiency and functionality, the efficiency of privacy information retrieval is significantly improved, and the functionality of the protocol is expanded. Specifically, in the proposed scheme, a single query on tens of thousands of records only requires a delay of seconds, superior to the most efficient keyword-based privacy information retrieval schemes currently available in terms of server-side latency. Additionally, this scheme allows for fuzzy queries with wildcards and multi-keyword queries, enabling users to obtain an experience similar to plaintext queries while protecting user and data privacy.

       

    /

    返回文章
    返回