A Pairing-free Dynamic Multi-receiver Certificateless Authenticated Searchable Encryption for cloud storage

被引:4
作者
Chenam, Venkata Bhikshapathi [1 ]
Ali, Syed Taqi [1 ]
机构
[1] Visvesvaraya Natl Inst Technol, Dept Comp Sci & Engn, Nagpur 440010, Maharashtra, India
关键词
Searchable encryption; Certificateless cryptography; Conjunctive sub-set keyword search; Dynamic multi-receiver; Pairing-free; Standard model; PUBLIC-KEY ENCRYPTION; KEYWORD SEARCH; SCHEME;
D O I
10.1016/j.jisa.2024.103801
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the current age of constrained local storage capacity, ensuring the security and privacy of user data against unauthorized third -party access has grown significantly more vital. Searchable Encryption (SE) has arisen as a promising method for preserving the confidentiality of user data while also enabling efficient search capabilities. Certificateless Searchable Encryption (CLSE) stands out among a range of SE cryptosystems by effectively addressing issues related to certification management and key escrow. Nevertheless, the majority of current CLSE approaches heavily depend on computationally intensive bilinear pairings and do not offer robust support for conjunctive keyword searches in multi -receiver scenarios. To address these limitations, we propose a Pairing -free Dynamic Multi -receiver Certificateless Authenticated Searchable Encryption (PDMCLASE) scheme. PDMCLASE focuses on three essential features: (1) Dynamic multi -receiver functionality, enabling new data receivers to access documents while revoking access for existing receivers; (2) Conjunctive subset keyword search, empowering data receivers to perform efficient conjunctive searches on subsets of keywords; and (3) Data sender authentication, ensuring the authenticity of keyword encryption by the data sender. Furthermore, PDMCLASE attains keyword privacy by leveraging elliptic curve hardness problems within the standard model. Through our performance analysis, we establish that PDMCLASE not only delivers improved functionality but also demonstrates reduced computational overhead when compared to alternative schemes.
引用
收藏
页数:11
相关论文
共 33 条
[1]  
Abdalla M, 2005, LECT NOTES COMPUT SC, V3621, P205
[2]  
Al-Riyami SS, 2003, LECT NOTES COMPUT SC, V2894, P452
[3]   Security prioritized multiple workflow allocation model under precedence constraints in cloud computing environment [J].
Alam, Mahfooz ;
Shahid, Mohammad ;
Mustajab, Suhel .
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2024, 27 (01) :341-376
[4]   Searchable encryption on the cloud: a survey [J].
Andola, Nitish ;
Gahlot, Raghav ;
Yadav, Vijay Kumar ;
Venkatesan, S. ;
Verma, Shekhar .
JOURNAL OF SUPERCOMPUTING, 2022, 78 (07) :9952-9984
[5]  
Bhikshapathi Chenam Venkata, 2024, Peer-to-Peer Netw Appl
[6]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
[7]   Trapdoor Privacy in Public Key Encryption With Keyword Search: A Review [J].
Chan, Koon-Ming ;
Heng, Swee-Huay ;
Yau, Wei-Chuen ;
Tan, Shing-Chiang .
IEEE ACCESS, 2022, 10 :21584-21598
[8]   A certificateless authenticated searchable encryption with dynamic multi-receiver for cloud storage [J].
Chenam, Venkata Bhikshapathi ;
Ali, Syed Taqi .
COMPUTER COMMUNICATIONS, 2023, 211 :157-177
[9]   A designated tester-based certificateless public key encryption with conjunctive keyword search for cloud-based MIoT in dynamic multi-user environment [J].
Chenam, Venkata Bhikshapathi ;
Ali, Syed Taqi .
JOURNAL OF INFORMATION SECURITY AND APPLICATIONS, 2023, 72
[10]   A designated cloud server-based multi-user certificateless public key authenticated encryption with conjunctive keyword search against IKGA [J].
Chenam, Venkata Bhikshapathi ;
Ali, Syed Taqi .
COMPUTER STANDARDS & INTERFACES, 2022, 81