Chunka Chunka
@nitap.ac.in
Assistant Professor
National Institute of Technology Arunachal Pradesh
RESEARCH INTERESTS
Cryptography and Network Security
Scopus Publications
Scholar Citations
Scholar h-index
Scholar i10-index
Scopus Publications
Chukhu Chunka, Subhasish Banerjee, and Gupta Sachin Kumar
Wiley
Atiya Khan, Saroj K. Biswas, and Chukhu Chunka
IEEE
Sleep apnea is a sleep disorder with some potentially severe consequences, characterized by recurring disturbance in breathing during sleep. This happens when the muscles in the back of the throat cannot maintain an open airway, leading to brief awakenings to take a breath. Since the last decades, several expert systems have been proposed for apnea detection, but only a few have analyzed the data exhaustively before classification. This paper proposes a model for apnea detection named Expert System for Apnea Detection (ESAD) that uses Discrete Wavelet Transform (DWT) for EEG signal decomposition and for features extraction, namely Standard Deviation(SD), Power, Mean, Energy, Kurtosis, Max, Min, Variance and Root Mean Square (RMS). The proposed ESAD uses Isolation Forest (IF) for outlier detection as the used medical data can have noise and anomalies. Finally, the SVM with Radial Basis Function (RBF) kernel is incorporated for detecting and classifying sleep apnea disorder accurately. The model’s performance is evaluated by incorporating key performance metrics like - Precision, Accuracy, F1-Score and Recall and ROC-AUC curve. On comparing ESAD with other machine learning models, it outperforms other incorporated shallow learning models like - Decision Tree, KNN, and Naive Bayes with superior performance, demonstrating higher accuracy and precision in detecting apnea events.
Chukhu Chunka, Subhasish Banerjee, Soumyajit Nag, and Rajat Subhra Goswami
Springer Science and Business Media LLC
Chukhu Chunka, Avinash Maurya, and Parashjyoti Borah
Springer Nature Singapore
Parashjyoti Borah, Ranjan Phukan, and Chukhu Chunka
Springer Nature Singapore
Chukhu Chunka and Subhasish Banerjee
Springer Science and Business Media LLC
A Wireless Body Area Networks (WBANs) is a wireless network in which sensors are embedded inside the body of a human, to monitor the health of patient continuously without any constraint in his normal daily life activities. As the information from the embed sensor is transmitted through wireless network and device has a limited battery power, therefore, the assurance of security in such tiny devices related to medical patients is highly recommended. Thus, the shared information must be maintained in terms of integrity, confidentiality, non-repudiation, untraceable key establishment, and mutual authentication in WBAN. In this context, to achieve high security and efficiency in WBAN, an efficient mutual authentication and secret key agreement scheme have been proposed in this paper and also listed out some drawbacks of an existing mutual authentication and key agreement of Li et al.’s scheme. To confirm the efficiency and security, the proposed scheme has been verified using formal security analysis tool namely, ProVerif and BAN logic. The low communication and computation costs indicate that our scheme is more suitable for practical application in healthcare as compared to other existing schemes.
Chukhu Chunka, Subhasish Banerjee, and Rajat Subhra Goswami
Springer Science and Business Media LLC
Securely accessing the information from sensor nodes is the premier need and becomes the challenging area in wireless sensor networks (WSNs) and internet of things environment (IoT). Consequently, keeping up the protection of shared information, authentication assumes a vital role. Where after the mutual authentication, it makes the agreement of the session key among the participants. In this regard, Kalra et al.’s proposed a mechanism for client authentication and session key agreement, and guaranteed, their scheme is highly secured against many possible and well-known threats. However, in this paper, it has been demonstrated that their scheme can suffer from sensor node capturing attack, leakage of gateway node’s secret key and also impractical for session key agreement. Further, an improved scheme has been proposed to conquer the security flaws of Kalra et al.’s scheme. In addition, to check the security properties and to prove the mutual authentication among the participant, the proposed scheme has been verified by ProVerif protocol verification tools. Finally, a comparative study with the other related schemes has also been defined to prove the efficiency of the proposed scheme.
Chukhu Chunka, Subhasish Banerjee, Soumyajit Nag, and Rajat Subhra Goswami
Springer Singapore
Idea behind the key agreement protocol is to enable the entities to communicate safely over insecure public networks. In this paper, we proposed a secure key agreement protocol using Diffie-Hellman key agreement. In 2005, Lee and Lee [1] proposed a key agreement protocol dependent on Diffie-Hellman and guarantee that their protocol beat the attacks like man-in-the-middle attack. However, we brought up that Lee and Lee are defenseless against man-in-the-middle attack, impersonate attack and replay attack. Further proposed an improved key agreement protocol and demonstrated that the protocol is secure against the attacks. To confirm the security properties, we have done formal verification called ProVerif tools. Finally, to demonstrate the efficient, we compared other related authentication key agreement schemes with the proposed scheme.
Chukhu Chunka, Subhasish Banerjee, and Rajat Subhra Goswami
IEEE
The major objectives of the computer networks are, sharing information and providing uninterrupted services over a distance. Because of the critical nature of computer networks and continuous development in information technology, the probability of getting hacked and leaking of the shared message becomes a bigger threat. Therefore, achieving perfect security in such shared data is an incredible research challenge. The pioneering work of Shannon on perfect security says that shared data can only be kept confidential if the length of the key is higher or equal to the size of the message. Therefore, in this paper, we have proposed a pseudorandom function which will take negotiated session keys and data block as a seed value and produce the required number of distinct keys i.e. Automatic Variable key (AVK) for each block of data transmission instead using the same key every time.
The purpose of information security is to protect information or data from misuse, unauthorized access and also to ensure the secured communication between transmitter and receiver. In this regard, one of the primary and foremost necessity is to protect the key by any means and should also be unbreakable. In this context, a mechanism namely, Automatic Variable Key (AVK) has been introduced to maintain the secrecy of the key. However, in this approach the initial key must be established earlier, then only it changes the keys and make unpredictable to guess, for every new block of data transmission. Thus, to overcome from this extra burden of initial distribution of key, we propose a new technique using Artificial Intelligent (AI) in order to generate the initial key automatically using the Genetic Algorithm (GA). We have demonstrated the importance of AI in the area of cryptography by our scheme. A comparative study is also carried out with the existing schemes to prove the proficiency of proposed scheme. Thus, in order to prove the unpredictability among the auto-generated keys, we have verified the randomness with the help of National Institute of Standards Technology (NIST) Test suite.
Subhasish Banerjee, Chukhu Chunka, Srijon Sen, and Rajat Subhra Goswami
Springer Science and Business Media LLC
Over the last two decades, several researchers have recommended many remote user authentication schemes, following since introducing the concept way back in 1981. Researchers are continuously trying to enhance the security in authentication protocols by incorporating the several features into their work. A few years back, Turkanovic et al. (Ad Hoc Netw 20:96–112, 2014) have presented a novel work for authenticating users in IOT environment using smart cards for wireless sensor networks. In this paper, we have demonstrated that their scheme doesn’t resist many possible security threats and have numerous flaws, and also proposed an enhanced and secure biometric-based user authentication technique to overcome their weaknesses. The stated protocol not only overcome from the flaws of Turkanovic et al.’s scheme but also reduce the computation overhead as well. Later, to proving the mutual authentication among the entities and session key secrecy of the proposed scheme has also been verified by ProVerif (2.0) simulation tool.
Chukhu Chunka, Rajat Subhra Goswami, and Subhasish Banerjee
Springer Singapore
Purpose of computer network is to share the information and provide the secure services. Due to publically in nature of computer network opens the possibility of hacking and stealing the confidential information by the attackers. To maintain confidentiality, integrity and to defend interception, fabrication, and modification of data become a burning issue. In this regard, many mechanisms have been proposed by researchers, among which Automatic Variable Key (AVK) is a novel approach. But in AVK initial key is distributed through Rivest-Shamir-Adleman (RSA). Thus, to surmount this initial distribution of key, we have proposed a new technique using Artificial Intelligence where the initial key is distributed to both the parties through fitness function of GA. To validate the proposed scheme, National Institute of Standards Technology (NIST) statistical tools is used to check the randomness among the auto-generated keys and is compared with existing related schemes. The Standard Deviation of Hamming distance is calculated for three different experiments and values obtained are 8.05, 6.44 and 7.05 which shows improvement in performance as compared to similar existing methods.
Amar Taggu, Chukhu Chunka, and Ningrinla Marchang
ACM Press
Cognitive Radio Network (CRN) nodes called the Cognitive Radio (CR) nodes, sense the presence of a Primary User (PU) activity. The sensing reports from all the CR nodes are sent to a Fusion Centre (FC) which aggregates these reports and takes decision about the presence of the PU, based on some decision rules. Such a collaborative sensing mechanism forms the foundation of any centralised CRN. However, this approach can be misused by malicious Secondary Users (SUs) by carrying out Spectrum Sensing Data Falsification (SSDF) attacks. SSDF attacks which invade the CRN during spectrum sensing phase can affect the global decision of spectrum occupancy and thus, degrade the overall performance of a CRN. In this paper, a threshold-based detection strategy, CODES, is proposed for detection of SSDF attacks. Simulation results show successful detection of malicious SUs across a range of SSDF attacks.