Next Article in Journal
An Autonomous, Self-Authenticating, and Self-Contained Secure Boot Process for Field-Programmable Gate Arrays
Previous Article in Journal
Intrinsic Run-Time Row Hammer PUFs: Leveraging the Row Hammer Effect for Run-Time Cryptography and Improved Security
Article Menu

Export Article

Open AccessArticle
Cryptography 2018, 2(3), 14; https://doi.org/10.3390/cryptography2030014

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

Department of Computer Applications, National Institute of Technology, Tiruchirappalli 620015, India
*
Author to whom correspondence should be addressed.
Received: 25 May 2018 / Revised: 22 June 2018 / Accepted: 13 July 2018 / Published: 15 July 2018
Full-Text   |   PDF [3447 KB, uploaded 16 July 2018]   |  

Abstract

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. View Full-Text
Keywords: attribute based encryption; TP-MBNR-PH; KP-ABE; multi-authority; cloud computing attribute based encryption; TP-MBNR-PH; KP-ABE; multi-authority; cloud computing
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Chandrasekaran, B.; Balakrishnan, R. An Efficient Tate Pairing Algorithm for a Decentralized Key-Policy Attribute Based Encryption Scheme in Cloud Environments. Cryptography 2018, 2, 14.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Cryptography EISSN 2410-387X Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top