紀要論文

Fine-grained Dynamic Searchable Symmetric Encryption for Conjunction Query

積集合検索が可能な柔軟な動的検索可能暗号

eng

24321192

https://doi.org/10.15002/00022733

法政大学大学院情報科学研究科

法政大学大学院紀要. 情報科学研究科編

15

1

6

2020-03-24

Version of Record

Searchable Symmetric Encryption (SSE) has been researched from three perspectives: security, performance, and functionality, and various SSEs have been proposed. Some SSEs are constructed with a data structure called Bloom Filter (BF). However, while BF has a good storage cost, it cannot efficiently perform data update operating and has a problem in functionality. With the spread of the cloud in recent years, it is desirable to have many functions. In this research, we propose two SSEs that have update function employing Counting Bloom Filter (CBF). The first, proposes a single keyword search SSE called D-IDX that can be updated flexibly. The second, improves D-IDX and proposes SSE called Dynamic Cross-Tags（DXT） that can efficiently perform conjunction keyword searches in addition to update operating. Both SSEs use CBF to enable efficient updating of keywords without significantly changing the data stored on the server. Although both SSEs have the same security, DXT can construct a more secure SSE by employing homomorphic encryption. We have implemented proposed SSEs. It shows that it is efficient and practical in update operation and multiple keywords search.

Article

AA12746425