A Revocable Certificateless Encryption Scheme for Multi-User

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Concurrency and Computation-Practice & Experience Pub Date : 2024-10-30 DOI:10.1002/cpe.8321
Yiming Mou, Lunzhi Deng, Yu Ruan
{"title":"A Revocable Certificateless Encryption Scheme for Multi-User","authors":"Yiming Mou,&nbsp;Lunzhi Deng,&nbsp;Yu Ruan","doi":"10.1002/cpe.8321","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Certificateless cryptography, which solves the key escrow problem and avoids the complexity of certificate management, is an important part of public key cryptography. In the multi-user scenarios, broadcast encryption can improve computational efficiency and reduce communication cost. Moreover, there may be some malicious users in the above scenarios, and the decryption permissions of these users need an effective mechanism to revoke them. In this paper, a revocable certificateless encryption scheme for multi-user (RCLE-MU) is proposed to address this issue. In the scheme, the Cloud Server Provider (CSP) utilizes the master time key to periodically generate time keys for legitimate users. For illegitimate users, their decryption privileges are revoked since they are unable to obtain the time keys. Then this new scheme is proved to be ciphertext indistinguishable under selected identity and chosen-ciphertext attacks (sID-CCAs). Finally, compared with several other schemes, the new scheme has more efficiency advantage. So it is suitable for multi-user scenarios.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 1","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8321","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Certificateless cryptography, which solves the key escrow problem and avoids the complexity of certificate management, is an important part of public key cryptography. In the multi-user scenarios, broadcast encryption can improve computational efficiency and reduce communication cost. Moreover, there may be some malicious users in the above scenarios, and the decryption permissions of these users need an effective mechanism to revoke them. In this paper, a revocable certificateless encryption scheme for multi-user (RCLE-MU) is proposed to address this issue. In the scheme, the Cloud Server Provider (CSP) utilizes the master time key to periodically generate time keys for legitimate users. For illegitimate users, their decryption privileges are revoked since they are unable to obtain the time keys. Then this new scheme is proved to be ciphertext indistinguishable under selected identity and chosen-ciphertext attacks (sID-CCAs). Finally, compared with several other schemes, the new scheme has more efficiency advantage. So it is suitable for multi-user scenarios.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无证书加密技术解决了密钥托管问题,避免了证书管理的复杂性,是公钥加密技术的重要组成部分。在多用户场景中,广播加密可以提高计算效率,降低通信成本。此外,上述场景中可能存在一些恶意用户,这些用户的解密权限需要一种有效的机制来撤销。本文针对这一问题提出了一种可撤销的多用户无证书加密方案(RCLE-MU)。在该方案中,云服务器提供商(CSP)利用主时间密钥定期为合法用户生成时间密钥。对于非法用户,由于他们无法获得时间密钥,其解密权限将被取消。然后,证明了这种新方案在选定身份和选定密文攻击(sID-CCAs)下是密文不可区分的。最后,与其他几种方案相比,新方案具有更高的效率优势。因此,它适用于多用户场景。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
期刊最新文献
Issue Information A Multi-Workflow Scheduling Approach With Explicit Evolutionary Multi-Objective Multi-Task Optimization Algorithm in Cloud Environment Measuring Thread Timing to Assess the Feasibility of Early-Bird Message Delivery Across Systems and Scales Issue Information Analysis and Fuzzy Neural Networks-Based Inertia Coefficient Adjustment Strategy of Power Converters
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1