Satya Bagchi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Satya Bagchi has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Pramod Kumar Maurya
School of Engineering and Technology, BML Munjal University, Gurugram, India
11 shared publications - Haradhan Ghosh
School of Mathematical Sciences, National Institute of Science Education and Research, Bhubaneswar, India
10 shared publications - Joydeb Pal
Department of Mathematics National Institute of Technology Durgapur Burdwan India
5 shared publications Pramod Kumar Maurya
4 shared publications- Ramakrishna Bandi
Department of Science and Applied Mathematics, IIIT Naya Raipur, Atal Nagar Nava Raipur, Chhattisgarh 493661, India
4 shared publications - Sanjit Bhowmick
National Institute of Technology Durgapur
4 shared publications
Latest Publications
- Open Access
- 23 May 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
Subgroup perfect codes of Sn in Cayley graphs
- 23 May 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
Open AccessSubgroup perfect codes of Sn in Cayley graphs
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (12) , 27630-27642
RISE: Resource-Efficient RFID Security Protocol in IoT With S-Box and Elliptic Curve Cryptography
Ensuring the security and privacy of radio frequency identification (RFID) systems is paramount to prevent unauthorized access and data breaches. In addition, addressing the insecurity of public keys in RFID tags and preventing server-side tag distinction requires a multifaceted approach. This article proposes an RFID-enabled protocol, called RISE, $r$ esource-efficient RFID security protocol in $I$ oT with $S$ -box and $e$ lliptic curve cryptography, that integrates substitution box (S-box) and elliptic curve cryptography (ECC) to enhance the security of RFID communication. The protocol leverages S-boxes to introduce nonlinearity and confusion, thereby thwarting potential attacks such as cryptanalysis and replay attacks. Additionally, ECC is employed for key exchange and authentication, leveraging computational efficiency and strong security properties. Formal proofs and analysis results demonstrate that RISE provides robust security and can effectively resist various types of attacks. RISE presents notable improvements, with an average 51.18% reduction in computational overhead compared to similar protocols. This advancement not only boosts performance but also enhances resource efficiency.
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (12) , 27630-27642
RISE: Resource-Efficient RFID Security Protocol in IoT With S-Box and Elliptic Curve Cryptography
Ensuring the security and privacy of radio frequency identification (RFID) systems is paramount to prevent unauthorized access and data breaches. In addition, addressing the insecurity of public keys in RFID tags and preventing server-side tag distinction requires a multifaceted approach. This article proposes an RFID-enabled protocol, called RISE, $r$ esource-efficient RFID security protocol in $I$ oT with $S$ -box and $e$ lliptic curve cryptography, that integrates substitution box (S-box) and elliptic curve cryptography (ECC) to enhance the security of RFID communication. The protocol leverages S-boxes to introduce nonlinearity and confusion, thereby thwarting potential attacks such as cryptanalysis and replay attacks. Additionally, ECC is employed for key exchange and authentication, leveraging computational efficiency and strong security properties. Formal proofs and analysis results demonstrate that RISE provides robust security and can effectively resist various types of attacks. RISE presents notable improvements, with an average 51.18% reduction in computational overhead compared to similar protocols. This advancement not only boosts performance but also enhances resource efficiency.
- Open AccessSubgroup perfect codes of $ S_n $ in Cayley graphsA perfect code in a graph $Γ= (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a subgroup perfect code of $G$ if there exists a Cayley graph of $G$ which admits $H$ as a perfect code. In this work, we present a classification of cyclic 2-subgroup perfect codes in $ S_n$. We analyze these subgroup codes, detailing their structure and properties. We extend our discussion to various classes of subgroup codes in the symmetric group $ S_n $, encompassing both commutative and non-commutative cases. We provide numerous examples to illustrate and support our findings.Open AccessSubgroup perfect codes of $ S_n $ in Cayley graphsA perfect code in a graph $Γ= (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a subgroup perfect code of $G$ if there exists a Cayley graph of $G$ which admits $H$ as a perfect code. In this work, we present a classification of cyclic 2-subgroup perfect codes in $ S_n$. We analyze these subgroup codes, detailing their structure and properties. We extend our discussion to various classes of subgroup codes in the symmetric group $ S_n $, encompassing both commutative and non-commutative cases. We provide numerous examples to illustrate and support our findings.
- 21 January 2026
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (2) , 571-589
Hull dimension of optimal binary LRCs with availability
- 21 January 2026
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (2) , 571-589
Hull dimension of optimal binary LRCs with availability
- 19 November 2025
- Published by Springer Nature in Wireless Networks
- Vol. 32 (1) , 189-206
Lightweight authentication protocol for supply chains utilizing blockchain-enabled RFID
- 19 November 2025
- Published by Springer Nature in Wireless Networks
- Vol. 32 (1) , 189-206
Lightweight authentication protocol for supply chains utilizing blockchain-enabled RFID
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (5) , 7483-7495
RSEV: Toward Reliable and Secure UAV-Assisted Emergency Deliveries in Internet of Vehicles
Traffic congestion in urban areas poses a critical challenge for timely emergency deliveries, often delaying medical supplies, rescue equipment, and disaster relief operations. UAV-assisted IoV has emerged as a promising solution, where UAVs provide aerial mobility to bypass congested roads and support real-time traffic monitoring. However, the high mobility of UAVs exposes them to impersonation, replay, man-in-the-middle, and insider attacks, which existing protocols handle inefficiently. To overcome these challenges, we propose RSEV, a lightweight authentication protocol that combines Physical Unclonable Functions (PUFs) with cryptographic hash functions for strong mutual authentication under low overhead. Our contributions include: (i) formal security proofs, Scyther-based verification, and heuristic analysis confirming resilience; (ii) a Python implementation demonstrating practicality; and (iii) performance gains of 57.25% in computation cost, 34.82% in communication cost, and 48.29% in energy efficiency over existing protocols.
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (5) , 7483-7495
RSEV: Toward Reliable and Secure UAV-Assisted Emergency Deliveries in Internet of Vehicles
Traffic congestion in urban areas poses a critical challenge for timely emergency deliveries, often delaying medical supplies, rescue equipment, and disaster relief operations. UAV-assisted IoV has emerged as a promising solution, where UAVs provide aerial mobility to bypass congested roads and support real-time traffic monitoring. However, the high mobility of UAVs exposes them to impersonation, replay, man-in-the-middle, and insider attacks, which existing protocols handle inefficiently. To overcome these challenges, we propose RSEV, a lightweight authentication protocol that combines Physical Unclonable Functions (PUFs) with cryptographic hash functions for strong mutual authentication under low overhead. Our contributions include: (i) formal security proofs, Scyther-based verification, and heuristic analysis confirming resilience; (ii) a Python implementation demonstrating practicality; and (iii) performance gains of 57.25% in computation cost, 34.82% in communication cost, and 48.29% in energy efficiency over existing protocols.
- 30 October 2025
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 18 (6) , 1-14
Authentication protocol for RFID-enabled TMIS: An LCD code-based approach
- 30 October 2025
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 18 (6) , 1-14
Authentication protocol for RFID-enabled TMIS: An LCD code-based approach
- 15 September 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (12) , 1-25
SKAP: secure blockchain-based key agreement protocol for healthcare environment
- 15 September 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (12) , 1-25
SKAP: secure blockchain-based key agreement protocol for healthcare environment
- Open AccessSubgroup perfect codes of $S_n$ in Cayley sum graphsA perfect code in a graph $Γ= (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent, and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. Let $ G $ be a finite group, and let $ S $ be a square-free normal subset of $ G $. The Cayley sum graph of $ G $ with respect to $ S $ is a simple graph with vertex set $ G $ and two vertices $ x $ and $ y $ are adjacent if $ xy\in S .$ A subset $ C $ of $ G $ is called perfect code of $ G $ if there exists a Cayley sum graph of $ G $ that admits $ C $ as a perfect code. In particular, if a subgroup of $ G $ is a perfect code of $ G $, then the subgroup is called a subgroup perfect code of $ G $. In this work, we prove that there does not exist any proper perfect subgroup code of symmetric group $ S_n $. Using this result, we provide a complete characterization of the perfect subgroup code of the alternating group $A_n$.Open AccessSubgroup perfect codes of $S_n$ in Cayley sum graphsA perfect code in a graph $Γ= (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent, and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. Let $ G $ be a finite group, and let $ S $ be a square-free normal subset of $ G $. The Cayley sum graph of $ G $ with respect to $ S $ is a simple graph with vertex set $ G $ and two vertices $ x $ and $ y $ are adjacent if $ xy\in S .$ A subset $ C $ of $ G $ is called perfect code of $ G $ if there exists a Cayley sum graph of $ G $ that admits $ C $ as a perfect code. In particular, if a subgroup of $ G $ is a perfect code of $ G $, then the subgroup is called a subgroup perfect code of $ G $. In this work, we prove that there does not exist any proper perfect subgroup code of symmetric group $ S_n $. Using this result, we provide a complete characterization of the perfect subgroup code of the alternating group $A_n$.
- 30 April 2025
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 124
Lightweight RFID-enabled authentication protocol in post-quantum environment
- 30 April 2025
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 124
Lightweight RFID-enabled authentication protocol in post-quantum environment