Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2015-03-06 14:20
Fast Searchable Encryption Scheme Using Single Bloom Filter and Its Evalustion
Shunsuke Kimura, Hiroyuki Inaba (KIT) SITE2014-79 IA2014-111
Abstract (in Japanese) (See Japanese page) 
(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) 
(in English) privacy protection / searchable encryption / Bloom filter / binary tree / / / /  
Reference Info. IEICE Tech. Rep., vol. 114, no. 494, SITE2014-79, pp. 227-232, March 2015.
Paper # SITE2014-79 
Date of Issue 2015-02-26 (SITE, IA) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF SITE2014-79 IA2014-111

Conference Information
Committee IA IPSJ-IOT SITE  
Conference Date 2015-03-05 - 2015-03-06 
Place (in Japanese) (See Japanese page) 
Place (in English)  
Topics (in Japanese) (See Japanese page) 
Topics (in English) Internet and Information Ethics Education, etc. 
Paper Information
Registration To SITE 
Conference Code 2015-03-IA-IOT-SITE 
Language Japanese 
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  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Shunsuke Kimura  
1st Author's Affiliation Kyoto Institute of Technology (KIT)
2nd Author's Name Hiroyuki Inaba  
2nd Author's Affiliation Kyoto Institute of Technology (KIT)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2015-03-06 14:20:00 
Presentation Time 25 minutes 
Registration for SITE 
Paper # SITE2014-79, IA2014-111 
Volume (vol) vol.114 
Number (no) no.494(SITE), no.495(IA) 
Page pp.227-232 
#Pages 6 
Date of Issue 2015-02-26 (SITE, IA) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan