Secure keyword search using bloom filter with specified character positions

Takanori Suga, Takashi Nishide, Kouichi Sakurai

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

20 被引用数 (Scopus)

抄録

There are encryption schemes called searchable encryption which enable keyword searches. Traditional symmetric ones support only full keyword matches. Therefore, both a data owner and data searcher have to enumerate all possible keywords to realize a variety of searches. It causes increases of data size and run time.We propose searchable symmetric encryption which can check characters in the specified position as we perform search on plaintexts. Our scheme realizes a variety of searches such as fuzzy keyword search, wildcard search, and so on.

本文言語英語
ホスト出版物のタイトルProvable Security - 6th International Conference, ProvSec 2012, Proceedings
ページ235-252
ページ数18
DOI
出版ステータス出版済み - 9 14 2012
イベント6th International Conference on Provable Security, ProvSec 2012 - Chengdu, 中国
継続期間: 9 26 20129 28 2012

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
7496 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他6th International Conference on Provable Security, ProvSec 2012
国/地域中国
CityChengdu
Period9/26/129/28/12

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Secure keyword search using bloom filter with specified character positions」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル