Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Future Generation Co...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Future Generation Computer Systems
Article . 2021 . Peer-reviewed
License: Elsevier TDM
Data sources: Crossref
DBLP
Article . 2025
Data sources: DBLP
versions View all 2 versions
addClaim

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

Authors: Aniseh Najafi; Majid Bayat; Hamid Haj Seyyed Javadi;

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

Abstract

Abstract The trend towards the Internet of Things (IoT) technology promises the growth of home and organizational automation in the world. Due to the large amount of IoT data stored in the semi-trust cloud server, the IoT is vulnerable to cyberattacks. Therefore, the privacy violation of outsourced data is an obstacle to efficient IoT data storage. Searchable encryption is a promising solution for secure storage and selective data retrieval. However, achieving desired privacy, performance, and attributes such as dynamics, access control, scalability, and fair arbitration is still a challenge in searchable encryption schemes. In this paper, we propose a fair and dynamic multi-owner searchable encryption scheme wherein dynamics does not leak the sensitive information. In the proposed scheme, the verifiability and fair arbitration, respectively, prevent the malicious cloud servers and malicious users from having any motivation to disrupt the accuracy of the exchanged data. Generating a single trapdoor corresponding to the conjunctive keyword query, a client can search over all documents stored in the cloud, the owner of which has allowed the client to access. We also prove that our scheme is secure against the keyword guessing attack in the standard model. Finally, evaluating the performance of the proposed scheme on a real dataset, we demonstrate its efficiency as well.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    9
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
9
Top 10%
Average
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!