Scholarlink

<p>Ciphertext-Policy Attribute-Based Encryption (CP-ABE) is a promising one-to-many public key encryption mechanism that provides fine-grained access control to encrypted data. However, most of the existing CP-ABE schemes are not resilient to quantum attacks. To resist attacks posed by quantum computers, lattice-based CP-ABE schemes were proposed, but these schemes face challenges such as the key abuse problem caused by malicious users and authorities, which raises significant security concerns in cloud environments because secret keys directly affect users’ data access. Further, these schemes are inefficient due to complex sampling algorithms. To address these issues, this paper proposes a quantum-resistant traceable, revocable, and key escrow-free CP-ABE (QR-TRK-CP-ABE) from the module lattice. QR-TRK-CP-ABE security is proven against chosen plaintext attacks (CPA) and traceability under Module-Learning with Errors (M-LWE) assumptions. Further, QR-TRK-CP-ABE also resists collusion attacks. The performance analysis demonstrates that QR-TRK-CP-ABE achieves competitive efficiency compared to existing lattice-based CP-ABE schemes while providing enhanced security features.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Quantum-resistant traceable, revocable, and key escrow-free CP-ABE for cloud storage

  • 期刊论文

  • 发表日期：

    2025年10月4日

查看全文
  • Sravya Gudipati,
  • Syam kumar Pasupuleti,
  • Padmavathy R

摘要

Ciphertext-Policy Attribute-Based Encryption (CP-ABE) is a promising one-to-many public key encryption mechanism that provides fine-grained access control to encrypted data. However, most of the existing CP-ABE schemes are not resilient to quantum attacks. To resist attacks posed by quantum computers, lattice-based CP-ABE schemes were proposed, but these schemes face challenges such as the key abuse problem caused by malicious users and authorities, which raises significant security concerns in cloud environments because secret keys directly affect users’ data access. Further, these schemes are inefficient due to complex sampling algorithms. To address these issues, this paper proposes a quantum-resistant traceable, revocable, and key escrow-free CP-ABE (QR-TRK-CP-ABE) from the module lattice. QR-TRK-CP-ABE security is proven against chosen plaintext attacks (CPA) and traceability under Module-Learning with Errors (M-LWE) assumptions. Further, QR-TRK-CP-ABE also resists collusion attacks. The performance analysis demonstrates that QR-TRK-CP-ABE achieves competitive efficiency compared to existing lattice-based CP-ABE schemes while providing enhanced security features.