An Efficient Hierarchical Multi-Authority Attribute Based Encryption Scheme for Profile Matching using a Fast Ate Pairing in Cloud Environment

Chandrasekaran, Balaji; Nogami, Yasuyuki; Ramasamy, Balakrishnan

doi:10.24138/jcomss.v14i2.461

Cited by 2 publications

(25 citation statements)

References 9 publications

(35 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ling and Weng proposed a MA-CP-ABE scheme that generates ciphertext with hidden access structure but the length of ciphertext varies with number of attributes in access policy [15]. Chandrasekaran et al [16] proposed a MA-CP-ABE scheme which improves the efficiency of [12] using fast ate pairing, this scheme also has the problem of key escrow. The MA-CP-ABE scheme given in [17] generates constant length ciphertext and supports hidden access policy but the scheme is not correct as it has unauthorized access attack.…”

Section: Related Workmentioning

confidence: 99%

“…The MA-CP-ABE scheme given in [17] generates constant length ciphertext and supports hidden access policy but the scheme is not correct as it has unauthorized access attack. In the schemes given in [9][10][11] and [13][14][15][16][17], CA does not have control over attributes of AA but resolves the problem of performance bottleneck and key escrow. The schemes, given in [12] and [16] handle corrupt resistant against AAs but both are not free from key escrow.…”

Section: Related Workmentioning

confidence: 99%

“…Therefore, the scheme is not secure in presence of corrupt or compromised AA. Authors in [12,16] have proposed schemes, where CA has control over attributes of AAs but their schemes are having problems of key escrow.…”

Section: Introductionmentioning

confidence: 99%

“…It is thus evident that existing MA-CP-ABE schemes either CA does not have control on attributes of AAs or are not key escrow free [12,16]. Hence, the main focus of this paper is to improve the efficiency of MA-CP-ABE scheme with hidden access policy by generating constant length ciphertext and to handle dishonest AAs.…”

Section: Introductionmentioning

confidence: 99%

“…In the proposed scheme, if a corrupt AA generates a secret key for an unauthorized user, the user will not be able to decrypt the ciphertext. The proposed scheme is proved to be secure against Chosen Plaintext Attack (CPA) and its efficiency is found to be better than [14][15][16][17].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Privacy Preserving and Efficient Multi Authority – CP-ABE Scheme for Secure Cloud Communication

Porwal

Mittal

2021

JCSANDM

View full text Add to dashboard Cite

In the cloud computing environment, Multi authority Ciphertext Policy-Attribute Based Encryption (CP-ABE) schemes are used as a key escrow free solution to securely and efficiently share data over cloud. However, the length of ciphertext in existing Multi Authority-CP-ABE schemes increases with the number of attributes in the access policy. Moreover, these schemes do not protect against dishonest attribute authorities. In this paper, a constant length ciphertext Multi Authority-CP-ABE scheme is proposed that reduces the communication overhead over the network. The scheme also prevents dishonest authority from compromising the system. Apart from this, for enhanced privacy of receivers, the access policy is communicated in hidden form. Thus, the presented scheme provides an efficient corrupt resistant, key escrow free Multi Authority-CP-ABE scheme by generating constant length ciphertext and hidden access structure. Results demonstrate the enhanced security and reduced cost of encryption and decryption by 8% and 48% respectively as compared to other existing works.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Privacy Preserving and Efficient Multi Authority – CP-ABE Scheme for Secure Cloud Communication

Porwal

Mittal

2021

JCSANDM

View full text Add to dashboard Cite

show abstract

An Efficient Blockchain-Based Bidirectional Friends Matching Scheme in Social Networks

Yang

Wang

et al. 2020

IEEE Access

View full text Add to dashboard Cite

In social networks, the personal attributes or hobbies of the users are exposed to the server to establish the relationships. Service providers may store these information for commercial purpose or statistical analysis. Furthermore, the server may expose to external attacks, which may disclose users' privacy information. In this paper, we present a hierarchical blockchain-based attribute matching scheme, which realizes privacy-preserving attribute matching under multiple semi-trusted servers. The scheme employs CP-ABE and bloom filter to satisfy the requirements of the users to make friend discovery, and reduces the computation cost of users by outsourcing decryption of CP-ABE. Besides, the hierarchical blockchain only implements the consensus and storage of matching results on the blockchain, while the complex calculations and a large amount of data storage are off-chain, which reduces the consumption of the blockchain and improves the operation efficiency. Finally, we prove the scheme can resist single point failure, collusion attack, internal attack and external attack, the experimental results demonstrate the proposed scheme is feasibility and efficiency.

show abstract

An Efficient Hierarchical Multi-Authority Attribute Based Encryption Scheme for Profile Matching using a Fast Ate Pairing in Cloud Environment

Cited by 2 publications

References 9 publications

A Privacy Preserving and Efficient Multi Authority – CP-ABE Scheme for Secure Cloud Communication

A Privacy Preserving and Efficient Multi Authority – CP-ABE Scheme for Secure Cloud Communication

An Efficient Blockchain-Based Bidirectional Friends Matching Scheme in Social Networks

Contact Info

Product

Resources

About