Forward and Backward Secure Searchable Encryption Scheme Supporting Conjunctive Queries Over Bipartite Graphs
Forward and Backward Secure Searchable Encryption Scheme Supporting Conjunctive Queries Over Bipartite Graphs
复制标题
DOI：
10.1109/tcc.2021.3131176
复制
发表时间：
2023-01
影响因子：
6.5
通讯作者：
Mingyue Li;Chunfu Jia;Ruizhong Du;Wei Shao
中科院分区：
文献类型：
--
作者：
Mingyue Li;Chunfu Jia;Ruizhong Du;Wei Shao
动态可搜索加密允许客户将其加密数据外包给云服务器，并保留查询和更新数据的能力，受到了广泛的关注。在这种情况下，必须确保服务器尽可能少地推断外包数据的内容及其处理的查询。在这篇文章中，我们提出了一个前向和后向安全的二分图上的可搜索加密方案（FBSSE-BG），它提供了最强的后向安全性。特别地，我们引入了更新计数器的概念来构造一种新的双向索引结构，该结构实现了二分图上的合取查询，并支持外包数据的灵活更新。此外，为了最大限度地减少透露给服务器的信息，我们提出了一种新的不经意的数据结构来存储双向索引，并使用语义安全的加密方案来加密节点信息，使服务器只能观察到一系列的ORAM位置和加密路径。最后，我们证明了FBSSE-BG的安全性，通过使用现实世界与理想世界的形式化，并提供其实现的实验效率评估。
Dynamic searchable encryption, which allows clients to outsource their encrypted data to cloud servers and retain the ability to query and update data, has received wide attention. In the setting, it is essential to ensure that a server infers as little as possible about the content of the outsourced data and the queries it processes. In this article, we propose a forward and backward secure searchable encryption scheme on bipartite graphs (FBSSE-BG) that offers the strongest level of backward security. In particular, we introduce the notion of update counter to construct a new bi-directional index structure, which realizes conjunctive queries over bipartite graphs and supports flexible updates of outsourced data. Besides, to minimize the information revealed to servers, we propose a new oblivious data structure to store the bi-directional index and use a semantically-secure encryption scheme to encrypt node information, such that servers can only observe a series of ORAM locations and encrypted paths. Finally, we prove the security of FBSSE-BG by using the real-world versus ideal-world formalization and provide experimental efficiency evaluations for its implementations.