Satya Bagchi

Dr. Satya Bagchi

orcid

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
21 May 2018 in Wireless Personal Communications
Verified
Journal Article
Closed access
PDF file
PMPRAMOD KUMAR MAURYA
PRAMOD KUMAR MAURYA
SBSatya Bagchi
Satya Bagchi

29 May 2017 in Wireless Personal Communications
Verified
Journal Article
Closed access
PDF file
PMPramod Kumar Maurya
Pramod Kumar Maurya
JPJoydeb Pal
Joydeb Pal
SBSatya Bagchi
Satya Bagchi

18 February 2022 in Mediterranean Journal of Mathematics
Verified
Journal Article
Closed access
PDF file
SRSaikat Roy
Saikat Roy
SBSatya Bagchi
Satya Bagchi
DSDebmalya Sain
Debmalya Sain

1 February 2021 in Linear and Multilinear Algebra
Verified
Journal Article
Closed access
SRSaikat Roy
Saikat Roy
SBSatya Bagchi
Satya Bagchi
We obtain a necessary and sufficient condition for Birkhoff–James orthogonality in the space of all continuous vector-valued functions from a compact topological space to a finite-dimensional Hilbert space, by using some basic geometric ideas. We apply our outcomes to characterize Birkhoff–James orthogonality of sesquilinear forms. Moreover, using Birkhoff–James orthogonality of sesquilinear forms, we obtain a different proof of the renowned Bhatia–Šemrl Theorem.

23 January 2023 in IEEE Access
Verified
Journal Article
Open access
PMPRAMOD KUMAR MAURYA
PRAMOD KUMAR MAURYA
HGHaradhan Ghosh
Haradhan Ghosh
SBSatya Bagchi
Satya Bagchi
Privacy and security are central issues in the deployment of an RFID system. It is vulnerable to several attacks, such as replay attacks, location tracking, man-in-middle attack, de-synchronization attack, etc., due to the inherent weaknesses of underlying wireless communications. In order to tackle these privacy and security concerns, this paper presents an ultralightweight authentication protocol based on group homomorphism and maximum distance separable (MDS) code. We use group homomorphism properties to make a server lookup table that reduces searching complexity and overcomes scalability issues. We develop an ultralightweight protocol using MDS code properties that employs only bit-wise operators. Formal and informal security analysis of the proposed protocol shows that our proposed protocol resists various attacks. In addition, we use automated security protocol verification tools, AVISPA and Scyther, to validate the security features of the proposed protocol. We demonstrate the correctness proof of the proposed protocol using BAN logic. To measure the level of privacy of the proposed protocol, we use two benchmark metrics to simulate the proposed protocol. The performance analysis indicates that the proposed protocol is efficient for a low-cost environment.

9 January 2024 in Peer-to-Peer Networking and Applications
Verified
Journal Article
Closed access
PDF file
HGHaradhan Ghosh
Haradhan Ghosh
PMPRAMOD KUMAR MAURYA
PRAMOD KUMAR MAURYA
SBSatya Bagchi
Satya Bagchi