Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-33272-2_15 | ProvSec |
Keywords | Field | DocType |
searchable encryption,bloom filter,fuzzy keyword search,keyword search,data owner,wildcard search,full keyword,encryption scheme,data size,possible keyword,secure keyword search,searchable symmetric encryption,specified character position,symmetric encryption | Keyword density,Information retrieval,Wildcard character,Computer science,Attribute-based encryption,Encryption,40-bit encryption,Probabilistic encryption,On-the-fly encryption,Filesystem-level encryption | Conference |
Citations | PageRank | References |
9 | 0.56 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takanori Suga | 1 | 9 | 0.56 |
| Takashi Nishide | 2 | 357 | 27.86 |
| Kouichi Sakurai | 3 | 1514 | 213.71 |