{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:42:45Z","timestamp":1761324165775,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2018,7,15]],"date-time":"2018-07-15T00:00:00Z","timestamp":1531612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Human Resource Development (MHRD) under the Government of India.","award":["Institute Felloship"],"award-info":[{"award-number":["Institute Felloship"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/cryptography2030014","type":"journal-article","created":{"date-parts":[[2018,7,16]],"date-time":"2018-07-16T04:05:33Z","timestamp":1531713933000},"page":"14","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Tate Pairing Algorithm for a Decentralized Key-Policy Attribute Based Encryption Scheme in Cloud Environments"],"prefix":"10.3390","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7786-5385","authenticated-orcid":false,"given":"Balaji","family":"Chandrasekaran","sequence":"first","affiliation":[{"name":"Department of Computer Applications, National Institute of Technology, Tiruchirappalli 620015, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramadoss","family":"Balakrishnan","sequence":"additional","affiliation":[{"name":"Department of Computer Applications, National Institute of Technology, Tiruchirappalli 620015, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,7,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/11426639_27","article-title":"Fuzzy identity-based encryption","volume":"3494","author":"Sahai","year":"2005","journal-title":"Advances in Cryptology\u2014EUROCRYPT 2005"},{"key":"ref_2","first-page":"173","article-title":"Using threshold attribute based encryption for practical biometric-based access control","volume":"1","author":"Nali","year":"2005","journal-title":"Int. J. Netw. Secur."},{"key":"ref_3","unstructured":"Goyal, V., Pandey, O., Sahai, A., and Waters, B. (November, January 30). Attribute based encryption for fine-grained access control of encrypted data. Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS \u201906), Alexandria, VA, USA."},{"key":"ref_4","unstructured":"Ostrovsky, R., Sahai, A., and Waters, B. (November, January 29). Attribute-based encryption with non-monotonic access structures. Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS \u201907), Alexandria, VA, USA."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/978-3-642-19379-8_6","article-title":"Expressive key policy attribute-based encryption with constant-size ciphertexts","volume":"6571","author":"Attrapadung","year":"2011","journal-title":"Public Key Cryptography\u2014PKC 2011"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Bethencourt, J., Sahai, A., and Waters, B. (2007, January 20\u201323). Ciphertext-policy attribute-based encryption. Proceedings of the IEEE Symposium on Security and Privacy (SP \u201907), Oakland, CA, USA.","DOI":"10.1109\/SP.2007.11"},{"key":"ref_7","unstructured":"Cheung, L., and Newport, C. (November, January 29). Provably secure ciphertext policy ABE. Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS \u201907), Alexandria, VA, USA."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Nishide, T., Yoneyama, K., and Ohta, K. (2008). Attribute-based encryption with partially hidden encryptor-specified access structures. Applied Cryptography and Network Security (ACNS 2008), Springer.","DOI":"10.1007\/978-3-540-68914-0_7"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1504\/IJACT.2010.033798","article-title":"A ciphertext-policy attribute-based encryption scheme with constant ciphertext length","volume":"2","author":"Emura","year":"2010","journal-title":"Int. J. Appl. Cryptogr."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Liang, X., Cao, Z., Lin, H., and Xing, D. (2009, January 10\u201312). Provably secure and efficient bounded ciphertext policy attribute based encryption. Proceedings of the 4th International Symposium on ACM Symposium on Information, Computer and Communications Security (ASIACCS \u201909), Sydney, Australia.","DOI":"10.1145\/1533057.1533102"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Chase, M., and Chow, S.S. (2009, January 9\u201313). Improving privacy and security in multi-authority attribute-based encryption. Proceedings of the 16th ACM Conference on Computer and Communications Security, New York, NY, USA.","DOI":"10.1145\/1653662.1653678"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2939","DOI":"10.1109\/TC.2015.2510646","article-title":"User Collusion Avoidance Scheme for Privacy-Preserving Decentralized Key-Policy Attribute-Based Encryption","volume":"65","author":"Rahulamathavan","year":"2016","journal-title":"IEEE Trans. Comput."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"18009","DOI":"10.1109\/ACCESS.2018.2820182","article-title":"Improving Privacy and Security in Decentralizing Multi-Authority Attribute-Based Encryption in Cloud Computing","volume":"6","author":"Yang","year":"2018","journal-title":"IEEE Access"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Chase, M. (2007). Multi-authority attribute based encryption. Theory of Cryptography, Springer.","DOI":"10.1007\/978-3-540-70936-7_28"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2618","DOI":"10.1016\/j.ins.2010.03.004","article-title":"Secure threshold multi authority attribute based encryption without a central authority","volume":"180","author":"Lin","year":"2010","journal-title":"Inf. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Lewko, A., and Waters, B. (2011). Decentralizing attribute-based encryption. Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer.","DOI":"10.1007\/978-3-642-20465-4_31"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Waters, B. (2011). Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization. International Workshop on Public Key Cryptography, Springer.","DOI":"10.1007\/978-3-642-19379-8_4"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2150","DOI":"10.1109\/TPDS.2012.50","article-title":"Privacy-preserving decentralized key-policy attribute-based encryption","volume":"23","author":"Han","year":"2012","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1109\/TPDS.2012.328","article-title":"Security analysis of a privacy\u2014preserving decentralized key-policy attribute-based encryption scheme","volume":"24","author":"Ge","year":"2013","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1109\/TC.2004.43","article-title":"Field Inversion and Point Halving Revisited","volume":"53","author":"Fong","year":"2004","journal-title":"IEEE Trans. Comput."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10623-005-3299-y","article-title":"Trading Inversions for Multiplications in Elliptic Curve Cryptography","volume":"39","author":"Ciet","year":"2006","journal-title":"Des. Codes Cryptogr."},{"key":"ref_22","first-page":"69","article-title":"Fast Elliptic Curve Point Multiplication using Double-Base Chains","volume":"2005","author":"Dimitrov","year":"2005","journal-title":"Cryptol. Epr. Arch."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1090\/S0025-5718-07-02048-0","article-title":"The double-base number system and its application to elliptic curve cryptography","volume":"77","author":"Dimitrov","year":"2008","journal-title":"Math. Comput."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1016\/j.amc.2006.05.111","article-title":"Fast elliptic scalar multiplication using new double-base chain and point halving","volume":"183","author":"Wong","year":"2006","journal-title":"Appl. Math. Comput."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Mishra, P.K., and Dimitrov, V. (2007). Efficient quintuple formulas for elliptic curves and efficient scalar multiplication using multibase number representation. International Conference on Information Security, Springer.","DOI":"10.1007\/978-3-540-75496-1_26"},{"key":"ref_26","first-page":"259","article-title":"An Algorithm to enhance Elliptic Curves scalar Multiplication Combining MBNR with point halving","volume":"4","author":"Ismail","year":"2010","journal-title":"Appl. Math. Sci."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1007\/s11432-008-0070-9","article-title":"Efficient Tate Pairing Computation Using Double-Base Chains","volume":"51","author":"Zhao","year":"2008","journal-title":"Sci. China Ser. F Inf. Sci."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Izu, T., and Takagi, T. (2003). Efficient computations of the Tate pairing for the large MOV degrees. International Conference on Information Security and Cryptology, Springer.","DOI":"10.1007\/3-540-36552-4_20"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1093\/ietfec\/e89-a.1.134","article-title":"Efficient algorithms for Tate pairing","volume":"1","author":"Kobayashi","year":"2006","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"ref_30","first-page":"75","article-title":"Secure Data Communication using File Hierarchy Attribute Based Encryption in Wireless Body Area Networks","volume":"14","author":"Chandrasekaran","year":"2018","journal-title":"J. Commun. Softw. Syst."}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/2\/3\/14\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:12:18Z","timestamp":1760195538000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/2\/3\/14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,15]]},"references-count":30,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2018,9]]}},"alternative-id":["cryptography2030014"],"URL":"https:\/\/doi.org\/10.3390\/cryptography2030014","relation":{},"ISSN":["2410-387X"],"issn-type":[{"type":"electronic","value":"2410-387X"}],"subject":[],"published":{"date-parts":[[2018,7,15]]}}}