Fair multi-owner search over encrypted data with forward and backward privacy in cloud-assisted Internet of Things

Najafi, Aniseh; Bayat, Majid; Javadi, Hamid Haj Seyyed

doi:10.1016/j.future.2021.06.010

Cited by 7 publications

(5 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…File injection attacks [20] can destroy encrypted systems when an SSE scheme lacks forward privacy. Owing to the need for and importance of accommodating multiple users in some systems, several schemes have been developed with the aim of addressing this requirement, as documented in [23,24,29]. The constructions outlined in these articles employed asymmetric encryption techniques, resulting in elevated computational costs during search and decryption processes.…”

Section: Previous Workmentioning

confidence: 99%

“…The SSMDO [23] and Naja f i [24] share similarities with our proposed approach in terms of achieving privacy for multiple users, and we, therefore, compared the execution times of these algorithms. This comparison included evaluating the time taken for index generation, client storage, and the search process.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…The test results were obtained on a computer equipped with an Intel(R) Core(TM) i5-10210U CPU @ 1.60GHz 2.11 GHz, 8GB of RAM, and a 512 GB SSD hard disk. To enable a comparative analysis of our proposed scheme with existing ones, the time cost and running time results for SSMDO and Al-Najafy, as reported in [24], have been referenced.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…Our approach introduces a unique combination of pseudorandom functions (PRFs) and forwardbackward privacy preservation mechanisms, ensuring that updates are indistinguishable from random numbers, thereby guaranteeing both Type II backward and forward privacy. The novelty of our scheme lies in its efficient yet secure design, demonstrated through a comprehensive security analysis and experimental evaluations, where it consistently outperforms existing schemes, including SSMDO [23] and Najafi [24], in terms of index generation, search process efficiency, and overall system performance. In our approach, the server maintains an encrypted index that correlates individual keywords with specific sets of file identifiers, which denote the files containing those keywords.…”

mentioning

confidence: 94%

See 3 more Smart Citations

Fast Multi-User Searchable Encryption with Forward and Backward Private Access Control

Bulbul,

Abduljabbar,

Najem

et al. 2024

JSAN

View full text Add to dashboard Cite

Untrusted servers are servers or storage entities lacking complete trust from the data owner or users. This characterization implies that the server hosting encrypted data may not enjoy full trust from data owners or users, stemming from apprehensions related to potential security breaches, unauthorized access, or other security risks. The security of searchable encryption has been put into question by several recent attacks. Currently, users can search for encrypted documents on untrusted cloud servers using searchable symmetric encryption (SSE). This study delves deeply into two pivotal concepts of privacy within dynamic searchable symmetric encryption (DSSE) schemes: forward privacy and backward privacy. The former serves as a safeguard against the linkage of recently added documents to previously conducted search queries, whereas the latter guarantees the irretrievability of deleted documents in subsequent search inquiries. However, the provision of fine-grained access control is complex in existing multi-user SSE schemes. SSE schemes may also incur high computation costs due to the need for fine-grained access control, and it is essential to support document updates and forward privacy. In response to these issues, this paper suggests a searchable encryption scheme that uses simple primitive tools. We present a multi-user SSE scheme that efficiently controls access to dynamically encrypted documents to resolve these issues, using an innovative approach that readily enhances previous findings. Rather than employing asymmetric encryption as in comparable systems, we harness low-complexity primitive encryption tools and inverted index-based DSSE to handle retrieving encrypted files, resulting in a notably faster system. Furthermore, we ensure heightened security by refreshing the encryption key after each search, meaning that users are unable to conduct subsequent searches with the same key and must obtain a fresh key from the data owner. An experimental evaluation shows that our scheme achieves forward and Type II backward privacy and has much faster search performance than other schemes. Our scheme can be considered secure, as proven in a random oracle model.

show abstract

Section: Previous Workmentioning

confidence: 99%

Section: Performance Evaluationmentioning

confidence: 99%

Section: Performance Evaluationmentioning

confidence: 99%

mentioning

confidence: 94%

See 2 more Smart Citations

Fast Multi-User Searchable Encryption with Forward and Backward Private Access Control

Bulbul,

Abduljabbar,

Najem

et al. 2024

JSAN

View full text Add to dashboard Cite

show abstract

“…There are different data encryption schemes in the literature designed for the application of data outsourcing. Orderpreserving encryption (OPE) schemes [1,2] and searchable encryption schemes [3][4][5] are developed to perform, respectively, range queries and keyword search queries at the server side efficiently. Partially homomorphic encryption schemes [6,7] are designed to support a limited number of operations on the ciphertexts.…”

Section: Introductionmentioning

confidence: 99%

A novel secure data outsourcing scheme based on data hiding and secret sharing for relational databases

2023

View full text Add to dashboard Cite

Data encryption‐based and secret sharing‐based data outsourcing schemes protect the confidentiality of sensitive attributes but not their secrecy. Ciphertexts/shares generated by a data encryption/secret sharing scheme can attract the attention of interceptors. Thus, it is desired to hide the existence of highly‐sensitive attributes (as secret attributes) in the outsourced relations in addition to protecting their contents. This paper proposes a novel scheme that integrates data hiding with secret sharing for relational databases to protect both the secrecy and confidentiality of secret attributes. It embeds one or multiple secret attributes in a relation into one or multiple cover attributes in the same relation. A set of share (and possibly index) columns are constructed such that they are pretended to be associated with only the cover attributes, while those share columns and some virtual share columns can be used to recover both the secret and cover attributes. What interceptors observe in each relation include the attributes stored in plaintext and the share (and possibly index) columns associated with the cover attributes but not any extra column. Thus, they find nothing suspicious. This is the first effective data hiding scheme for relational databases that protects the secrecy of secret attributes.

show abstract

A Fine-Grained Access Control Scheme for Electronic Health Records Based on Roles and Attributes

Zhang

Yang

Zhu

et al. 2022

Communications in Computer and Information Science

View full text Add to dashboard Cite

Fair multi-owner search over encrypted data with forward and backward privacy in cloud-assisted Internet of Things

Cited by 7 publications

References 18 publications

Fast Multi-User Searchable Encryption with Forward and Backward Private Access Control

Fast Multi-User Searchable Encryption with Forward and Backward Private Access Control

A novel secure data outsourcing scheme based on data hiding and secret sharing for relational databases

A Fine-Grained Access Control Scheme for Electronic Health Records Based on Roles and Attributes

Contact Info

Product

Resources

About