scholarly journals Trapdoor Privacy in Asymmetric Searchable Encryption Schemes

2014 ◽  
pp. 31-50 ◽  
Author(s):  
Afonso Arriaga ◽  
Qiang Tang ◽  
Peter Ryan
Keyword(s):  
Searchable Encryption ◽  
Encryption Schemes

scholarly journals Security-Efficiency Tradeoffs in Searchable Encryption

2019 ◽  
Vol 2019 (4) ◽  
pp. 132-151 ◽  
Author(s):  
Raphael Bost ◽  
Pierre-Alain Fouque
Keyword(s):  
Lower Bounds ◽  
Minimum Cost ◽  
Searchable Encryption ◽  
Search Queries ◽  
Trade Offs ◽  
Encryption Schemes ◽  
Security Properties ◽  
Client State ◽  
The Relationship

Abstract Besides their security, the efficiency of searchable encryption schemes is a major criteria when it comes to their adoption: in order to replace an unencrypted database by a more secure construction, it must scale to the systems which rely on it. Unfortunately, the relationship between the efficiency and the security of searchable encryption has not been widely studied, and the minimum cost of some crucial security properties is still unclear. In this paper, we present new lower bounds on the trade-offs between the size of the client state, the efficiency and the security for searchable encryption schemes. These lower bounds target two kinds of schemes: schemes hiding the repetition of search queries, and forward-private dynamic schemes, for which updates are oblivious. We also show that these lower bounds are tight, by either constructing schemes matching them, or by showing that even a small increase in the amount of leaked information allows for constructing schemes breaking the lower bounds.

An Attribute-Based Searchable Encryption Scheme for Non-Monotonic Access Structure

2020 ◽  
pp. 263-283 ◽  
Author(s):  
Mamta ­ ◽  
Brij B. Gupta
Keyword(s):  
Access Control ◽  
Searchable Encryption ◽  
Access Structure ◽  
Encryption Scheme ◽  
Security Model ◽  
Secret Key ◽  
Fine Grained ◽  
Diffie Hellman ◽  
Attribute Based Encryption ◽  
Encryption Schemes

Attribute based encryption (ABE) is a widely used technique with tremendous application in cloud computing because it provides fine-grained access control capability. Owing to this property, it is emerging as a popular technique in the area of searchable encryption where the fine-grained access control is used to determine the search capabilities of a user. But, in the searchable encryption schemes developed using ABE it is assumed that the access structure is monotonic which contains AND, OR and threshold gates. Many ABE schemes have been developed for non-monotonic access structure which supports NOT gate, but this is the first attempt to develop a searchable encryption scheme for the same. The proposed scheme results in fast search and generates secret key and search token of constant size and also the ciphertext components are quite fewer than the number of attributes involved. The proposed scheme is proven secure against chosen keyword attack (CKA) in selective security model under Decisional Bilinear Diffie-Hellman (DBDH) assumption.

Fogging the cloud — Implementing and evaluating searchable encryption schemes in practice

2015 ◽  
Author(s):  
Manuel Koschuch ◽  
Michael Hombauer ◽  
Sigrid Schefer-Wenzl ◽  
Ulrich Habock ◽  
Stefan Hrdlicka
Keyword(s):  
Searchable Encryption ◽  
Encryption Schemes

scholarly journals EFFICIENT AND EXPRESSIVE KEYWORD SEARCH OVER ENCRYPTED DATA IN CLOUD

2020 ◽  
pp. 145-147
Author(s):  
Zeeshan Sharief
Keyword(s):  
Keyword Search ◽  
Bilinear Pairings ◽  
Searchable Encryption ◽  
Encrypted Data ◽  
Access Structures ◽  
Attribute Based Encryption ◽  
Cloud Server ◽  
Encryption Schemes ◽  
Boolean Formulas ◽  
Significant Performance

Searchable encryption allows a cloud server to conduct keyword search over encrypted data on behalf of the data users without learning the underlying plaintexts. However, most existing searchable encryption schemes only support single or conjunctive keyword search, while a few other schemes that can perform expressive keyword search are computationally inefficient since they are built from bilinear pairings over the composite-order groups. In this paper, we propose an expressive public-key searchable encryption scheme in the prime-order groups, which allows keyword search policies i.e., predicates, access structures to be expressed in conjunctive, disjunctive or any monotonic Boolean formulas and achieves significant performance improvement over existing schemes. We formally define its security and prove that it is selectively secure in the standard model. Also, we implement the proposed scheme using a rapid prototyping tool called Charm and conduct several experiments to evaluate it performance. The results demonstrate that our scheme is much more efficient than the ones built over the composite-order groups. INDEX TERMS - Searchable encryption, cloud computing, expressiveness, attribute-based encryption

scholarly journals Verifying Fuzzy Keyword Search Over Cipher Text in Cloud Computing

2019 ◽  
Vol 9 (1) ◽  
pp. 3252-3257
Keyword(s):  
Cloud Computing ◽  
Keyword Search ◽  
Searchable Encryption ◽  
Knowledge User ◽  
Cloud Server ◽  
Encryption Schemes ◽  
Fuzzy Keyword Search ◽  
Word Search ◽  
To Come ◽  
Cloud Servers

To enhance the potency of knowledge looking out, most knowledge house owners store their knowledge files in numerous cloud servers within the kind of ciphertext. Thus, economical search victimization fuzzy keywords become a vital issue in such a cloud computing atmosphere. Searchable cryptography will support knowledge user to select and retrieve the cipher documents over encrypted cloud knowledge by keyword-based search. Most of the prevailing searchable encryption schemes solely specialize in the precise keyword search. When knowledge user makes writing system errors, these schemes fail to come to the results of interest. In searchable encryption, the cloud server may come to the invalid result to knowledge user for saving the computation price or alternative reasons. Therefore, these precise keyword search schemes notice very little sensible significance in real-world applications. So as to deal with these problems, we tend to propose unique verifiable fuzzy keyword search theme over encrypted cloud knowledge. We tend to propose a verifiable precise keyword search theme which extend this theme to the fuzzy keyword search theme. Here we tend to thus propose a system for fuzzy keyword sets rather than precise word search. This will help us drastically to reduce the costs and it also allows to have multi-users using the system simultaneously.

On the Security of Verifiable Searchable Encryption Schemes

2021 ◽  
pp. 1-1
Author(s):  
Chuang Li ◽  
Chunxiang Xu ◽  
Shanshan Li ◽  
Kefei Chen ◽  
Yinbin Miao
Keyword(s):  
Searchable Encryption ◽  
Encryption Schemes
Sign in / Sign up

Export Citation Format

Share Document