A construction of a keyword search to allow partial matching with a block cipher

研究成果

抄録

This paper considers a new construction of a keyword search including partial matching on an encrypted document. Typically, an index-based searchable symmetric encryption has been investigated. However, it makes a partial keyword matching difficult without a designated trapdoor. Thus, our objective is to propose a keyword search scheme which enables us to search a part of a keyword only by building trapdoors of each original keyword. The main idea is to insulate each character of a keyword into a bitstream of the sequence generated by a pseudorandom number generator. It achieves a partial search by giving a restriction on the length of a keyword.

本文言語English
ホスト出版物のタイトルInformation Security Applications - 19th International Conference, WISA 2018, Revised Selected Papers
編集者Brent ByungHoon Kang, JinSoo Jang
出版社Springer Verlag
ページ241-252
ページ数12
ISBN(印刷版)9783030179816
DOI
出版ステータスPublished - 2019
イベント19th World International Conference on Information Security and Application, WISA 2018 - Jeju Island
継続期間: 8月 23 20188月 25 2018

出版物シリーズ

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

Conference

Conference19th World International Conference on Information Security and Application, WISA 2018
国/地域Korea, Republic of
CityJeju Island
Period8/23/188/25/18

ASJC Scopus subject areas

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

フィンガープリント

「A construction of a keyword search to allow partial matching with a block cipher」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル