BALAJI CHANDRASEKARAN

Mr. BALAJI CHANDRASEKARAN

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2018 in Journal of Communications Software and Systems
Verified
Journal Article
Open access
PDF file
BCBALAJI CHANDRASEKARAN
BALAJI CHANDRASEKARAN
RBRamadoss Balakrishnan
Ramadoss Balakrishnan
YNYasuyuki Nogami
Yasuyuki Nogami
Secure Data Communication using File Hierarchy Attribute Based Encryption in Wireless Body Area Networks

12 June 2019 in ETRI Journal
Verified
Journal Article
Open access
PDF file
BCBALAJI CHANDRASEKARAN
BALAJI CHANDRASEKARAN
RBRamadoss Balakrishnan
Ramadoss Balakrishnan
YNYasuyuki Nogami
Yasuyuki Nogami
The major challenge in wireless body area networks (WBAN) is setting up a protected communication between data consumers and a body area network controller while meeting the security and privacy requirements. This paper proposes efficient and secure data communication in WBANs using a Twofish symmetric algorithm and ciphertext‐policy attribute‐based encryption with constant size ciphertext; in addition, the proposed scheme incorporates policy updating to update access policies. To the best of the author's knowledge, policy updating in WBAN has not been studied in earlier works. The proposed scheme is evaluated in terms of message size, energy consumption, and computation cost, and the results are compared with those of existing schemes. The result shows that the proposed method can achieve higher efficiency than conventional methods.

3 October 2019 in Journal of Applied Security Research
Verified
Journal Article
Closed access
BCBALAJI CHANDRASEKARAN
BALAJI CHANDRASEKARAN
YNYasuyuki Nogami
Yasuyuki Nogami
RBRamadoss Balakrishnan
Ramadoss Balakrishnan
One of the most preferred encryption techniques for data sharing in cloud environment is Ciphertext-Policy Attribute Based Encryption (CP-ABE). An efficient File Hierarchy CP-ABE (FH-CP-ABE) scheme using an integrated access structure was proposed by Wang and colleagues. Their working construction was based on symmetric pairing. In this article, we propose an efficient Asymmetric File Hierarchy Ciphertext-Policy Attribute Based Encryption (AFH-CP-ABE) which is based on an asymmetric pairing construction using denominator elimination and twist mapping. We apply this optimized Tate pairing in the proposed AFH-CP-ABE to find out its computational costs for encryption and decryption using gmp 6.0.0 library and then compared with existing schemes.

5 September 2024 in IEEE Potentials
Verified
Journal Article
Closed access
BCBALAJI CHANDRASEKARAN
BALAJI CHANDRASEKARAN
SNSmrithy Girijakumari Sreekantan Nair
Smrithy Girijakumari Sreekantan Nair
The traditional education system faces numerous challenges, some of which can be addressed effectively with the integration of artificial intelligence (AI) tools like ChatGPT (Wu et al., 2023).

15 July 2018 in Cryptography
Verified
Journal Article
Open access
PDF file
BCBALAJI CHANDRASEKARAN
BALAJI CHANDRASEKARAN
RBRamadoss Balakrishnan
Ramadoss Balakrishnan
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.

1 January 2016
Verified
Conference Paper
Closed access
BCBALAJI CHANDRASEKARAN
BALAJI CHANDRASEKARAN
RBRamadoss Balakrishnan
Ramadoss Balakrishnan
In cloud computing computational paradigm, the main objective is to incorporate efficient access control and confidentiality services on accessing Big Data in storage perspective. Several Attribute Based Encryption (ABE) schemes have emerged in this perspective and served the purpose. Most of the attribute based encryption schemes use bilinear pairing approach for computation. High computational complexity in bilinear pairing implementation is making the algorithm insufficient. In order to cope up with these complexity issues, point halving technique with Multi-Base Number Representation (MBNR) is recommended for efficient computation of field operations. And at the same time an enhancement of Tate pairing using MBNR is recommended for significant improvement of pairing computation.