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

Padhya, Mukti; Jinwala, Devesh C.

doi:10.1007/s13369-019-04302-x

Cited by 11 publications

(27 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2|G| Table 5, we can observe that none of the existing KASE schemes listed in the table provide revocation of delegated rights, conjunctive keywords search using a single trapdoor and energy-efficient encryption as well as decryption algorithms for resource-limited devices. Additionally, as shown in Table 5, the KASE schemes [4,13,23,24,31,32,34,35] do not support search over multiowners' data using a single trapdoor. On the other hand, the KASE schemes proposed in [18][19][20][21][22] provide the solution to search over multi-owners' data using a single trapdoor.…”

Section: Evaluation Of Kase Schemesmentioning

confidence: 99%

“…The KASE [23] scheme provides a mechanism that can handle emergency situations where no authorized user exists to perform (or to delegate) a time-critical task. The KASE scheme proposed in [24] supports the conjunctive range and sort query on the encrypted dataset and enhances the query expressiveness of the existing KASE [4, 13, 18-22, 32, 34, 35] schemes. As compared to the previous solutions, the KASE [24] scheme supports multi-dimensional, multi-keyword searches on the encrypted dataset using a single trapdoor.…”

Section: Related Workmentioning

confidence: 99%

“…The KASE scheme proposed in [24] supports the conjunctive range and sort query on the encrypted dataset and enhances the query expressiveness of the existing KASE [4, 13, 18-22, 32, 34, 35] schemes. As compared to the previous solutions, the KASE [24] scheme supports multi-dimensional, multi-keyword searches on the encrypted dataset using a single trapdoor. Wang et al propose the verifiable KASE scheme in [31].…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

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

Padhya

Jinwala

2020

Data Sci. Eng.

Self Cite

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: Evaluation Of Kase Schemesmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

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

Padhya

Jinwala

2020

Data Sci. Eng.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The key aggregate searchable encryption (KASE) scheme [5 ] is more extended in scope, in which a DO delegates search rights over a selected dataset using an aggregate key and the user can search over shared data by submitting a single aggregate trapdoor to the cloud. The KAE schemes [4, 6–11 ] and KASE schemes [5, 12–23 ] focus on the list of data that the DO wants to share with other users rather than focusing on the role or the attributes of recipients. This data‐centric characteristic of the KAE and the KASE helps them to reduce the number of keys required for group data sharing, as compared to the user‐centric data sharing schemes [1–3 ].…”

Section: Introductionmentioning

confidence: 99%

“…This data‐centric characteristic of the KAE and the KASE helps them to reduce the number of keys required for group data sharing, as compared to the user‐centric data sharing schemes [1–3 ]. Despite the advantage of the secure delegation of search rights using a constant size key, the KASE schemes [5, 12–23 ] also bring the security issues and challenges.…”

Section: Introductionmentioning

confidence: 99%

P ² KASE A ² —privacy‐preserving key aggregate searchable encryption supporting authentication and access control on multi‐delegation

Padhya

Jinwala

2020

IET Inf. secur

Self Cite

View full text Add to dashboard Cite

Enhancing data security using global mutation based novel artificial immune network optimization in public cloud storage system

Kaliyamoorthy

Ramalingam

2021

Trans Emerging Tel Tech

View full text Add to dashboard Cite

During the past few years, several investigations and efforts have undergone to achieve secure data in the cloud. On the other hand, few security problems that arise because of virtualization and multitenancies are communication, isolation, as well as resource management system. Practically, it becomes a troublesome task for the user to attain secure output. Therefore, in this article, a RSA cryptosystem using global mutation‐based novel artificial immune network optimization algorithm is proposed. Here, an optimal key generation is achieved using a global mutation based novel artificial immune network optimization (GM‐NAINO). In addition to this, the data integrity is achieved by enhancing secure data transmission. Finally, seven diverse test functions are employed in evaluating the efficiency of the proposed technique. The experimental analysis are performed and the evaluation results demonstrated that the performances of the proposed technique is better when comparison with other techniques.

show abstract

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

Cited by 11 publications

References 31 publications

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

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

P ² KASE A ² —privacy‐preserving key aggregate searchable encryption supporting authentication and access control on multi‐delegation

Enhancing data security using global mutation based novel artificial immune network optimization in public cloud storage system

Contact Info

Product

Resources

About

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

Cited by 11 publications

References 31 publications

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

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

P 2 KASE A 2 —privacy‐preserving key aggregate searchable encryption supporting authentication and access control on multi‐delegation

Enhancing data security using global mutation based novel artificial immune network optimization in public cloud storage system

Contact Info

Product

Resources

About

P ² KASE A ² —privacy‐preserving key aggregate searchable encryption supporting authentication and access control on multi‐delegation