| Presentation | 2015-03-06 Fast Searchable Encryption Scheme Using Single Bloom Filter and Its Evalustion Shunsuke KIMURA, Hiroyuki INABA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Recently, cloud storage service which store several documents on the Internet has become widespread. This has the remarkable advantage that the stored data can be accessed from anywhere having Internet connection. However, on the other hand, risk of data leakage would be higher than local storage. Some privacy protection technologies are present in order to prevent risk of data leakage. Searchable encryption is one of the privacy protection technologies. As the stored data is encrypted, the risk of data leakage is low. Bloom filter which is used in some of the searchable encryption scheme is known as an efficient searching algorithm. However, a conventional method using Bloom filter requires longer searching time in proportion to the number of documents, and the other method requires multiple Bloom filter to be managed. So, we have proposed a new method which is capable of faster search by introducing a certain binary tree structure to a single Bloom filter. In this report, a computer simulator of the proposed method and the conventional method are implemented. We make a comparison of the best caculation time, the worst caculation time, and the average caculation time between proposed method and the conventional method. As a result, the superiority of the proposed method have been revealed about caculation time. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | privacy protection / searchable encryption / Bloom filter / binary tree |
| Paper # | SITE2014-79,IA2014-111 |
| Date of Issue |
| Conference Information | |
| Committee | SITE |
|---|---|
| Conference Date | 2015/2/26(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Social Implications of Technology and Information Ethics (SITE) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Fast Searchable Encryption Scheme Using Single Bloom Filter and Its Evalustion |
| Sub Title (in English) | |
| Keyword(1) | privacy protection |
| Keyword(2) | searchable encryption |
| Keyword(3) | Bloom filter |
| Keyword(4) | binary tree |
| 1st Author's Name | Shunsuke KIMURA |
| 1st Author's Affiliation | Kyoto Institute of Technology() |
| 2nd Author's Name | Hiroyuki INABA |
| 2nd Author's Affiliation | Kyoto Institute of Technology |
| Date | 2015-03-06 |
| Paper # | SITE2014-79,IA2014-111 |
| Volume (vol) | vol.114 |
| Number (no) | 494 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |