A Revocable Multi-Authority Attribute Based Encryption Scheme Based On Nonlinear Access Policy

Title

A Revocable Multi-Authority Attribute Based Encryption Scheme Based On Nonlinear Access Policy

Creator

Ancy, P R

Contributor

Addapalli, V N Krishna

Description

Due to the tremendous increase of data, currently individuals and organizations are increasingly opting to store their data with third-party providers as a solution to their storage issues. Ciphertext Policy Attribute Based Encryption facilitates data outsourcing by encrypting the data at the source and uploading it to a third-party storage provider with some restricted access which is mentioned using access policy. In classical Identity-based Encryption (IBE), when a data owner needs to transmit a message to a data user, they would send it together with the data user's specific identity, such as their email address. This ensures that only the intended recipient can access and read the message. The primary issue is that the data owner must possess knowledge of the identity of each user. Other than the traditional IBE, a data owner can utilize attribute-based encryption to deliver a message to a group of individuals who have the same attributes. Here, the data owner does not need to be aware of every user's identity; instead, he can send messages using the attributes and access policies that have been provided, such as which users can access this message. This research work primarily focuses on three CP-ABE aspects: access policy, number of attribute authority, and revocation. The current access policies are insecure due to their linear character, as they always calculate shares using the same linear equation. For this particular issue in this work, a non-linear secret sharing model that enhances the security of the model is proposed. For addressing the key escrow problem, a solution using multiauthority systems were introduced. These systems involve multiple attribute authorities, each responsible for holding a specific subset of attributes for each user. And access policy will be based on non-linear secret sharing scheme. In the third aspect related to revocation, this work has addressed both user and attribute revocation so that it will make this model a perfect implementation model in terms of improved security. Some of the existing approach for revocation are re-encryption, periodic updating of ciphertext instead this work used a polynomial called Lagrange polynomial which helps to address this problem in less complex and more efficient way. These features will make the proposed scheme a real model that is secure and can be implement in any organization.

Source

Author's Submission

Date

2024-01-01

Publisher

Christ(Deemed to be University)

Subject

Computer Science and Engineering

Rights

Open Access

Relation

61000436

Format

PDF

Language

English

Type

PhD

Identifier

http://hdl.handle.net/10603/619669