Verifiable and Authenticated Searchable Encryption Scheme with Aggregate Key in Cloud Storage

Liu, Zhenhua; Liu, Yaohui

doi:10.1109/cis2018.2018.00100

Cited by 8 publications

(63 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The constant size of the aggregate key makes the KASE scheme more suitable for devices having limited storage resources, such as smart cards, IoT sensors. However, the existing KASE schemes [4,13,[18][19][20][21]31] use two pairing operations to generate a keyword ciphertext for each keyword to be attached with the document. Similarly, for decryption of ciphertext pairing operations are required.…”

Section: Motivationmentioning

confidence: 99%

“…The authors of [25] show that for different security levels (i.e., for 80 bits, 112 bits and 128 bits) and prime order groups, the pairing operation (on random group elements) requires significantly more time and power resource as compared to the group exponentiation (of a random group element with a random exponent) and multiplication operation. Therefore, the limited power resource of sensor nodes in IoT deployment does not support the expensive computational cost of the existing KASE schemes [4,13,[18][19][20][21]31]. The expensive computational cost of encryption and decryption phases make the existing KASE [4,13,[18][19][20][21]31] schemes infeasible to use in power-constrained devices.…”

Section: Motivationmentioning

confidence: 99%

“…Therefore, the limited power resource of sensor nodes in IoT deployment does not support the expensive computational cost of the existing KASE schemes [4,13,[18][19][20][21]31]. The expensive computational cost of encryption and decryption phases make the existing KASE [4,13,[18][19][20][21]31] schemes infeasible to use in power-constrained devices. Therefore, the KASE schemes [22,34,35] propose different solutions to generate keyword ciphertext without using expensive pairing operations and make the schemes practical for the Fig.…”

Section: Motivationmentioning

confidence: 99%

“…The ZY18 scheme proposed in [21] provides solution for verification of search result using an aggregate key and user authentication. The cloud server can verify the legality of data user by authenticating whether data user's identity is contained in the authorized users' identity set.…”

Section: Related Workmentioning

confidence: 99%

“…The cloud server can verify the legality of data user by authenticating whether data user's identity is contained in the authorized users' identity set. However, the solution proposed in [21] is not secure against impersonation attack. The ZY18 scheme does not give any formal proof to prove the security of the scheme.…”

Section: Related Workmentioning

confidence: 99%

See 4 more Smart Citations

R-OO-KASE: Revocable Online/Offline Key Aggregate Searchable Encryption

Padhya

Jinwala

2020

Data Sci. Eng.

View full text Add to dashboard Cite

The existing Key Aggregate Searchable Encryption (KASE) schemes allow searches on the encrypted dataset using a single query trapdoor, with a feature to delegate the search rights of multiple files using a constant size key. However, the operations required to generate the ciphertext and decrypt it in these schemes incur higher computational costs, due to the computationally expensive pairing operations in encryption/decryption. This makes the use of such schemes in resource-constrained devices, such as Radio Frequency Identification Devices, Wireless Sensor Network nodes, Internet of Things nodes, infeasible. Motivated with the goal to reduce the computational cost, in this paper, we propose a Revocable Online/Offline KASE (R-OO-KASE) scheme, based on the idea of splitting the encryption/decryption operations into two distinct phases: online and offline. The offline phase computes the majority of costly operations when the device is on an electrical power source. The online phase generates final output with the minimal computational cost when the message (or ciphertext) and keywords become known. In addition, the proposed scheme R-OO-KASE also offers multi-keyword search capability and allows the data owners to revoke the delegated rights at any point in time, the two features are not supported in the existing schemes. The security analysis and empirical evaluations show that the proposed scheme is efficient to use in resource-constrained devices and provably secure as compared to the existing KASE schemes.

show abstract

Section: Motivationmentioning

confidence: 99%

Section: Motivationmentioning

confidence: 99%

Section: Motivationmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

R-OO-KASE: Revocable Online/Offline Key Aggregate Searchable Encryption

Padhya

Jinwala

2020

Data Sci. Eng.

View full text Add to dashboard Cite

show abstract

Key‐aggregate searchable encryption with multi‐user authorization and keyword untraceability for distributed IoT healthcare systems

Trivedi

Patel

2023

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Adopting Internet-of-Things (IoT) enables pervasive computing by integrating distributed healthcare infrastructures to enhance conventional medical services. Integrated healthcare systems store numerous encrypted electronic health records (EHR) on clouds that multiple users frequently access as per delegated access rights. Sharing any group of selected EHR within any group of users involving different encryption keys potentially heightens security and privacy concerns over inadvertent data leaks. This necessitates a searchable encryption mechanism in distributed IoT requiring secure multi-user authorization and efficient searchable keys management with compact trapdoors. Contemporary state-of-the-art protocols utilize large numbers of expensive encryption keys and keyword trapdoors while lacking secure multi-user authorization and keyword untraceability on clouds. This motivates us to design a novel key-aggregate searchable encryption protocol that jointly achieves multi-user authorization and keyword untraceability for distributed IoT applications. Key-aggregation reduces complexity in sharing (n) documents by executing a stand-alone trapdoor, while token-based authorization allows keyword search only to legitimate data users. Additionally, secure dynamic indexing achieves keyword untraceability on clouds. Security analysis illustrates correctness and resilience against typical attacks. Performance and empirical analysis demonstrate a relative advantage in storage, communication, and computational costs while incorporating secure multi-user authorization and keyword untraceability as additional security features.

show abstract

CRSQ-KASE: Key Aggregate Searchable Encryption Supporting Conjunctive Range and Sort Query on Multi-owner Encrypted Data

Padhya

Jinwala

2020

Arab J Sci Eng

View full text Add to dashboard Cite

Verifiable and Authenticated Searchable Encryption Scheme with Aggregate Key in Cloud Storage

Cited by 8 publications

References 13 publications

R-OO-KASE: Revocable Online/Offline Key Aggregate Searchable Encryption

R-OO-KASE: Revocable Online/Offline Key Aggregate Searchable Encryption

Key‐aggregate searchable encryption with multi‐user authorization and keyword untraceability for distributed IoT healthcare systems

CRSQ-KASE: Key Aggregate Searchable Encryption Supporting Conjunctive Range and Sort Query on Multi-owner Encrypted Data

Contact Info

Product

Resources

About