基于后量子网格的云存储密文策略属性加密方案调查：分类、开放问题和未来方向

IF 5.5 2区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

IEEE Transactions on Services Computing Pub Date : 2024-10-14 DOI:10.1109/TSC.2024.3479930

Gudipati Sravya;Pasupuleti Syam Kumar;R. Padmavathy

{"title":"基于后量子网格的云存储密文策略属性加密方案调查：分类、开放问题和未来方向","authors":"Gudipati Sravya;Pasupuleti Syam Kumar;R. Padmavathy","doi":"10.1109/TSC.2024.3479930","DOIUrl":null,"url":null,"abstract":"Ciphertext Policy Attribute-Based Encryption (CP-ABE) is one of the most prevalent cryptographic primitives for realizing privacy and fine-grained access control in cloud computing. However, most of the existing CP-ABE schemes constructed using Paring-Based Cryptography (PBC) from Discrete Logarithm Problem (DLP) or Diffie Hellman Problem (DHP) assumptions are susceptible to quantum attacks, whereas CP-ABE schemes constructed using lattice-based cryptography based on Learning with Errors (LWE) and Ring-LWE (R-LWE) assumptions are quantum-safe and ensure fine-grained access control. This paper comprehensively surveys the existing Lattice-based CP-ABE (LCP-ABE) schemes based on LWE and R-LWE assumptions. Further, this paper analyzes and compares the security and performance features of existing LCP-ABE schemes. Finally, this paper identifies the open issues and future directions that need further investigation on LCP-ABE schemes.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"17 6","pages":"4540-4557"},"PeriodicalIF":5.5000,"publicationDate":"2024-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Survey of Post-Quantum Lattice-Based Ciphertext-Policy Attribute-Based Encryption Schemes for Cloud Storage: Taxonomy, Open Issues, and Future Directions\",\"authors\":\"Gudipati Sravya;Pasupuleti Syam Kumar;R. Padmavathy\",\"doi\":\"10.1109/TSC.2024.3479930\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ciphertext Policy Attribute-Based Encryption (CP-ABE) is one of the most prevalent cryptographic primitives for realizing privacy and fine-grained access control in cloud computing. However, most of the existing CP-ABE schemes constructed using Paring-Based Cryptography (PBC) from Discrete Logarithm Problem (DLP) or Diffie Hellman Problem (DHP) assumptions are susceptible to quantum attacks, whereas CP-ABE schemes constructed using lattice-based cryptography based on Learning with Errors (LWE) and Ring-LWE (R-LWE) assumptions are quantum-safe and ensure fine-grained access control. This paper comprehensively surveys the existing Lattice-based CP-ABE (LCP-ABE) schemes based on LWE and R-LWE assumptions. Further, this paper analyzes and compares the security and performance features of existing LCP-ABE schemes. Finally, this paper identifies the open issues and future directions that need further investigation on LCP-ABE schemes.\",\"PeriodicalId\":13255,\"journal\":{\"name\":\"IEEE Transactions on Services Computing\",\"volume\":\"17 6\",\"pages\":\"4540-4557\"},\"PeriodicalIF\":5.5000,\"publicationDate\":\"2024-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Services Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10715672/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10715672/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

基于密文策略属性的加密（cipher Policy Attribute-Based Encryption, CP-ABE）是云计算中实现隐私和细粒度访问控制的最流行的加密原语之一。然而，大多数现有的基于离散对数问题（DLP）或Diffie Hellman问题（DHP）假设的基于配对加密（PBC）构造的CP-ABE方案容易受到量子攻击，而基于错误学习（LWE）和环LWE （R-LWE）假设的基于格加密构造的CP-ABE方案是量子安全的，并确保了细粒度的访问控制。本文综合评述了现有的基于LWE和R-LWE假设的格基CP-ABE （LCP-ABE）方案。在此基础上，对现有LCP-ABE方案的安全性和性能特点进行了分析和比较。最后，本文指出了LCP-ABE方案有待进一步研究的问题和未来发展方向。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Survey of Post-Quantum Lattice-Based Ciphertext-Policy Attribute-Based Encryption Schemes for Cloud Storage: Taxonomy, Open Issues, and Future Directions

Ciphertext Policy Attribute-Based Encryption (CP-ABE) is one of the most prevalent cryptographic primitives for realizing privacy and fine-grained access control in cloud computing. However, most of the existing CP-ABE schemes constructed using Paring-Based Cryptography (PBC) from Discrete Logarithm Problem (DLP) or Diffie Hellman Problem (DHP) assumptions are susceptible to quantum attacks, whereas CP-ABE schemes constructed using lattice-based cryptography based on Learning with Errors (LWE) and Ring-LWE (R-LWE) assumptions are quantum-safe and ensure fine-grained access control. This paper comprehensively surveys the existing Lattice-based CP-ABE (LCP-ABE) schemes based on LWE and R-LWE assumptions. Further, this paper analyzes and compares the security and performance features of existing LCP-ABE schemes. Finally, this paper identifies the open issues and future directions that need further investigation on LCP-ABE schemes.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING

CiteScore

11.50

自引率

6.20%

发文量

278

审稿时长

>12 weeks

期刊介绍： IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.