Improving Privacy and Security in Decentralizing Multi-Authority Attribute-Based Encryption in Cloud Computing

Yang, Yan; Chen, Xingyuan; Chen, Hao; Du, Xuehui

doi:10.1109/access.2018.2820182

Cited by 36 publications

(35 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The time complexity of the proposed decryption algorithm increases linearly with respect to the attributes. Figure 3 clearly shows the significant improvement of the proposed decryption algorithm when compared with the existing schemes [12,13].…”

Section: Resultsmentioning

confidence: 95%

“…Figure 2 clearly shows the significant improvement of the proposed encryption algorithm when compared with the existing schemes [12,13]. Figure 3 depicts the comparison of the total decryption cost of MA-ABE for the proposed scheme and [12,13]. The time complexity of the k,1 , .…”

Section: Resultsmentioning

confidence: 99%

“…Let us assume the number o attribute authorities, = 2, and say, attribute n varies from 10 to 50. Figure 2 depicts the comparison of total encryption cost of MA-ABE for the proposed schem and [12,13]. The time complexity of proposed encryption algorithm increases linearly with respect t k, n k , ∀ k PK k = Y k = e TP−MBNR−PH (g 1 , g 1 ) is a random target group element in .…”

Section: Resultsmentioning

confidence: 99%

“…This scheme is verified using decisional bilinear Diffie-Hellman standard complexity assumption. Yang et al [13] proposed a scheme to improve privacy and security in decentralizing multi-authority attribute-based encryption in cloud computing. Most often existing ABE schemes are constructed from bilinear pairings.…”

Section: Related Workmentioning

confidence: 99%

“…The TP-MBNR-PH algorithm is applied in decentralized KP-ABE to show the reduction in computational costs for encryption and decryption when compared with existing schemes [12,13].…”

mentioning

confidence: 99%

See 4 more Smart Citations

An Efficient Tate Pairing Algorithm for a Decentralized Key-Policy Attribute Based Encryption Scheme in Cloud Environments

Chandrasekaran

Ramasamy

2018

Cryptography

View full text Add to dashboard Cite

Attribute-based encryption (ABE) is used for achieving data confidentiality and access control in cloud environments. Most often ABE schemes are constructed using bilinear pairing which has a higher computational complexity, making algorithms inefficient to some extent. The motivation of this paper is on achieving user privacy during the interaction with attribute authorities by improving the efficiency of ABE schemes in terms of computational complexity. As a result the aim of this paper is two-fold; firstly, to propose an efficient Tate pairing algorithm based on multi-base number representation system using point halving (TP-MBNR-PH) with bases 1/2, 3, and 5 to reduce the cost of bilinear pairing operations and, secondly, the TP-MBNR-PH algorithm is applied in decentralized KP-ABE to compare its computational costs for encryption and decryption with existing schemes.

show abstract

Section: Resultsmentioning

confidence: 95%

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

“…The TP-MBNR-PH algorithm is applied in decentralized KP-ABE to show the reduction in computational costs for encryption and decryption when compared with existing schemes [12,13].…”

mentioning

confidence: 99%

See 3 more Smart Citations

An Efficient Tate Pairing Algorithm for a Decentralized Key-Policy Attribute Based Encryption Scheme in Cloud Environments

Chandrasekaran

Ramasamy

2018

Cryptography

View full text Add to dashboard Cite

show abstract

Analysis of attribute‐based cryptographic techniques and their application to protect cloud services

Belguith

Kaaniche

Hammoudeh

2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Recent technological advances such as the Internet of Things (IoT), fog computing, cloud applications lead to exponential growth in the amount of generated data. Indeed, cloud storage services have experienced unprecedented usage demand. The loss of user control over their cloud stored data introduced several security and privacy concerns. To address these concerns, cryptographic techniques are widely adopted at the user side. Attribute based cryptography is commonly used to provide encrypted and/or authenticated access to outsourced data in remote servers. However, the use of these cryptographic mechanisms often increase the storage and computation costs; consequently, the energy consumption in the entire cloud ecosystem. In this paper, we provide a comparative analysis of different attribute based cryptographic mechanisms suitable for cloud data sharing services. we also provide a detailed discussion of different reviewed schemes, w.r.t. supported features, namely security, privacy and functional requirements. In addition, we explore the limitations of existing attribute based cryptographic mechanisms and propose future research directions to better fit the growing needs of this cloud environment in terms of energysavings, processing and storage efficiency and availability requirements.

show abstract

An Efficient and Recoverable Data Sharing Mechanism for Edge Storage

Wang

Yang

et al. 2019

Wireless Algorithms, Systems, and Applications

View full text Add to dashboard Cite

Improving Privacy and Security in Decentralizing Multi-Authority Attribute-Based Encryption in Cloud Computing

Cited by 36 publications

References 19 publications

An Efficient Tate Pairing Algorithm for a Decentralized Key-Policy Attribute Based Encryption Scheme in Cloud Environments

An Efficient Tate Pairing Algorithm for a Decentralized Key-Policy Attribute Based Encryption Scheme in Cloud Environments

Analysis of attribute‐based cryptographic techniques and their application to protect cloud services

An Efficient and Recoverable Data Sharing Mechanism for Edge Storage

Contact Info

Product

Resources

About