Ashutosh Bhatia

Dr. Ashutosh Bhatia


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
30 May 2025 in IEEE Open Journal of the Communications Society
Verified
Journal Article
Open access
ABAshutosh Bhatia
Ashutosh Bhatia
SBSainath Bitragunta
Sainath Bitragunta
KTKamlesh Tiwari
Kamlesh Tiwari
The Quantum Key Distribution (QKD) protocol utilizes quantum mechanics principles for cryptographic key exchange, ensuring absolute secrecy. Current QKD techniques are susceptible to man-in-the-middle (MITM) attacks due to the absence of an inherent mechanism for identity verification within the quantum channel. For authentication, these systems rely on classical or post-quantum cryptography, which diminishes the perfect security advantage provided by QKD. We present a Physical Unclonable Function (PUF)-based authenticated QKD protocol (PUF-AQKD), which avoids the necessity for authenticated classical channels and is useful in mitigating MITM attacks. The fundamental concept of PUF-AQKD is to implement a phase shift in the basis used for polarizing the transmitted qubits. The phase shift is dictated by PUFs, which are anticipated to result in analogous (correlated) responses for devices manufactured under similar conditions but dissimilar responses in different conditions. An adversary lacking a correlated PUF response shared by Alice and Bob would inadvertently increase the Quantum Bit Error Rates (QBER) observed at Bob’s end. We present a mathematical model to assess the efficacy of the proposed PUF-AQKD method and perform simulations utilizing the NetSquid simulator. The mathematical analysis and simulation findings indicate that PUF-AQKD can efficiently identify eavesdroppers, even during incomplete measurements, without the necessity of an authorized classical channel.

26 October 2021 in IEEE Access
Verified
Journal Article
Open access
GAGeetika Arora
Geetika Arora
SKSumit Kalra
Sumit Kalra
ABAshutosh Bhatia
Ashutosh Bhatia
KTKamlesh Tiwari
Kamlesh Tiwari
Palmprint identification aims to establish identity of a given query sample by comparing it with all the templates in the database and locating the most-similar one. It becomes compute-intensive as the number of comparisons becomes proportional to the size of the database. The process needs to be fastened to get response in real-time especially for large databases. This paper proposes a palmprint database indexing approach called PalmHashNet that generates highly discriminative embeddings to create a fixed-size candidate list for comparison to make identification a constant time operation. Acquired palmprint images are fed to the feature extraction network which is pre-trained using softmax loss. To minimize the intra-class distance between samples belonging to the same class a margin is added to the softmax loss. This ensures that the features have high intra-class and low inter-class similarity. k-means and locality sensitive hashing (LSH) are explored for index table creation. In this setting, cluster centers for k-means and hash values in case of LSH serve as indices. For a given query palmprint, the features are extracted and compared with the index values. The candidates lying in the most similar bin are retrieved for identification. The proposed approach gives probabilistic guarantees for the query to be identified in the selected bin. Experiments are conducted on four widely used palmprint databases viz: CASIA, IITD-Touchless, Tongji-Contactless and Hong Kong Polytechnic University Palmprint II (PolyU II) database. The proposed approach achieved a penetration rate of 0.022%, 1.032%, 4.555% and 0.39% at 100% hit rate thus, making the identification process approximately 4500, 96, 21 and 256 times faster on the considered databases respectively. The advantage of the proposed approach is that the query palmprint needs to be compared with only a small percentage of the database instead of the complete database.

25 February 2022 in International Journal of Information Security
Verified
Journal Article
Closed access
PDF file
AAAnkit Agrawal
Ankit Agrawal
ABAshutosh Bhatia
Ashutosh Bhatia
ABAyush Bahuguna
Ayush Bahuguna
KTKamlesh Tiwari
Kamlesh Tiwari
KHK. Haribabu
K. Haribabu
RKRekha Kaushik
Rekha Kaushik

13 January 2025 in IEEE Open Journal of the Communications Society
Verified
Journal Article
Open access
ABAshutosh Bhatia
Ashutosh Bhatia
SBSainath Bitragunta
Sainath Bitragunta
KTKamlesh Tiwari
Kamlesh Tiwari
Quantum Key Distribution (QKD) provides secure communication by leveraging quantum mechanics, with the BB84 protocol being one of its most widely adopted implementations. However, the classical post-processing steps in BB84, such as sifting, error correction, and key verification, often result in significant communication overhead, limiting its efficiency and scalability. In this work, we propose three key optimizations for BB84: (1) PRNG-based predetermined key bit positioning, which eliminates redundant bit exchanges during sifting, (2) hash-based subsequence comparison, enabling lightweight and efficient key verification, and (3) adaptive basis reconciliation, which minimizes the communication costs associated with basis matching. The proposed optimizations achieve a 50% reduction in communication overhead for large key sizes compared to traditional QKD protocols, as demonstrated through rigorous performance analysis. While the focus of this work is on the BB84 protocol, these optimizations are also directly applicable to a broader class of Discrete-Variable QKD (DV-QKD) protocols, such as six-state, B92, and E91, which share a fundamentally similar post-processing structure. This generality highlights the modularity and adaptability of the proposed methods across diverse QKD implementations. The proposed optimizations enhance post-processing efficiency and scalability, enabling practical deployment in bandwidth-limited environments like IoT networks, secure financial systems, and defense communications, thereby supporting broader adoption of quantum communication systems.

20 September 2024 in Internet of Things
Verified
Journal Article
Closed access
LCLaxmi Divya Chhibbar
Laxmi Divya Chhibbar
SPSujay Patni
Sujay Patni
STSiddarth Todi
Siddarth Todi
ABAshutosh Bhatia
Ashutosh Bhatia
KTKamlesh Tiwari
Kamlesh Tiwari

23 December 2017 in Wireless Personal Communications
Verified
Journal Article
Closed access
PDF file
ABAshutosh Bhatia
Ashutosh Bhatia
RPRanjeet K. Patro
Ranjeet K. Patro