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. © 2012 Springer-Verlag.
CITATION STYLE
Suga, T., Nishide, T., & Sakurai, K. (2012). Secure keyword search using bloom filter with specified character positions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7496 LNCS, pp. 235–252). https://doi.org/10.1007/978-3-642-33272-2_15
Mendeley helps you to discover research relevant for your work.