Secure keyword search using bloom filter with specified character positions

Authors:
Takanori Suga;Takashi Nishide;Kouichi Sakurai
Affiliations:
Department of Informatics, Graduate School of Information Science and Electrical Engineering, Kyushu University, Japan;Department of Informatics, Faculty of Information Science and Electrical Engineering, Kyushu University, Japan;Department of Informatics, Faculty of Information Science and Electrical Engineering, Kyushu University, Japan
Venue:
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Year:
2012

Citing 10
Cited 1

Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Practical Techniques for Searches on Encrypted Data

SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Searchable symmetric encryption: improved definitions and efficient constructions

Proceedings of the 13th ACM conference on Computer and communications security
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions

Journal of Cryptology
Privacy-Preserving Queries for a DAS Model Using Encrypted Bloom Filter

DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Conjunctive, subset, and range queries on encrypted data

TCC'07 Proceedings of the 4th conference on Theory of cryptography
Private query on encrypted data in multi-user settings

ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Fuzzy keyword search over encrypted data in cloud computing

INFOCOM'10 Proceedings of the 29th conference on Information communications
Searching keywords with wildcards on encrypted data

SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Privacy preserving keyword searches on remote encrypted data

ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security

Fuzzy keyword search over encrypted data in the public key setting

WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management

Quantified Score

Hi-index	0.00

Visualization

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.