Visible to the public Searchable Encryption Using Secret-Sharing Scheme for Multiple Keyword Search Using Conjunctive and Disjunctive Searching

TitleSearchable Encryption Using Secret-Sharing Scheme for Multiple Keyword Search Using Conjunctive and Disjunctive Searching
Publication TypeConference Paper
Year of Publication2019
AuthorsMohd Kamal, Ahmad Akmal Aminuddin, Iwamura, Keiichi
Conference Name2019 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)
Date Publishedaug
Keywordscloud computing, composability, computation cost, conjunctive searching, cryptography, direct searching, disjunctive searching, Encryption, index search, Indexes, logical conjunctive, logical disjunctive, main searching functions, multiple keyword search, pubcrawl, Public key, query processing, resilience, Resiliency, Search methods, search problems, Searchable encryption, Secrecy Computation, secret sharing, secret-sharing scheme, Servers
AbstractThe main searching functions realized by searchable encryption can be divided into searching using one query and searching using multiple queries. Searchable encryption using one query has been widely studied and researched; however, few methods of searchable encryption can accommodate search using multiple queries. In addition, most of the method proposed thus far utilize the concept of index search. Therefore, a new problem exists, in which an additional process of updating or deleting an index when new documents are added or removed is required. Hence, the overall computation cost increases. Another problem is that a document that is not registered in the index cannot be searched. Therefore, herein, using a secret-sharing scheme that is known to offer a low computational cost, we propose a method that can realize both logical conjunctive (AND) and logical disjunctive (OR) search over multiple conditions, without the construction of any index. Hence, we can realize direct searching over sentences, thus achieving a more efficient search method.
DOI10.1109/DASC/PiCom/CBDCom/CyberSciTech.2019.00038
Citation Keymohd_kamal_searchable_2019