Demo Data from EDBT 2026 / reviewers in the wild / expert
Prithwi Bagchi
dblp:342/7297
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0005-1406-101XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 70% Cryptographic protocols and secure computation · 23% Blockchain and cryptocurrency security · 7% | |
| Computer networks
1 paper |
Internet of things and sensor networks · 100% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › key exchange
authenticated key exchange |
1.0 | 1 | 2026 | Big Data Analytics-Envisioned Quantum-Safe Lattice-Based Three-Party Authenticated Key Agreement Protocol for Cloud IoT-Enabled Healthcare Applications · IEEE Trans. Dependable Secur. Comput. 2026 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography |
1.0 | 1 | 2026 | Big Data Analytics-Envisioned Quantum-Safe Lattice-Based Three-Party Authenticated Key Agreement Protocol for Cloud IoT-Enabled Healthcare Applications · IEEE Trans. Dependable Secur. Comput. 2026 |
Cryptographic primitives and cryptanalysis
post-quantum cryptography |
1.0 | 1 | 2026 | Big Data Analytics-Envisioned Quantum-Safe Lattice-Based Three-Party Authenticated Key Agreement Protocol for Cloud IoT-Enabled Healthcare Applications · IEEE Trans. Dependable Secur. Comput. 2026 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
ring-LWE |
1.0 | 1 | 2026 | Big Data Analytics-Envisioned Quantum-Safe Lattice-Based Three-Party Authenticated Key Agreement Protocol for Cloud IoT-Enabled Healthcare Applications · IEEE Trans. Dependable Secur. Comput. 2026 |
Blockchain and cryptocurrency security › blockchain data management
blockchain-based data aggregation |
0.3 | 1 | 2026 | Big Data Analytics-Envisioned Quantum-Safe Lattice-Based Three-Party Authenticated Key Agreement Protocol for Cloud IoT-Enabled Healthcare Applications · IEEE Trans. Dependable Secur. Comput. 2026 |
Methods — techniques the papers use, named apart from their topics
formal security analysis · 2.0big data analytics · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Securing Financial Transactions Using DLT-Enabled Quantum-Safe Authentication Scheme
Debnath Ghosh, Abhishek Kumar Pandey, Prithwi Bagchi, Ashok Kumar Das, Shantanu Pal, Ravi Kappagantu, Srinivas V. Katakam, Jitendra Chougala |
IWCMC | 3 |
| 2026 | Big Data Analytics-Envisioned Quantum-Safe Lattice-Based Three-Party Authenticated Key Agreement Protocol for Cloud IoT-Enabled Healthcare ApplicationsabstractCloud-based Internet of Things (IoT)-enabled smart healthcare plays a vital role in modern society, yet security and privacy challenges remain unavoidable. The authenticated key agreement (AKA) process, which serves as the foundation of secure communication, is widely recognized as a key solution to these challenges. However, many existing AKA methods in the literature either involve high communication and computational costs or fail to withstand quantum attacks. Post-quantum cryptography (PQC) introduces a new class of cryptographic algorithms designed to resist future quantum computer threats. In this article, we present a quantum-secure, lattice-based three-party AKA scheme for smart IoT healthcare applications, leveraging the computationally complex Ring-Learning With Errors (Ring-LWE) problem. Our approach integrates secure big-data analytics with blockchain technology by utilizing authentication procedures for secure data aggregation before storing it in the blockchain. A comprehensive security evaluation including formal and informal analysis, demonstrates the scheme's strong resilience against both classical and quantum attacks. Additionally, experimental results confirm that the proposed scheme is well-suited for real-time smart healthcare applications. Prithwi Bagchi, Aakash Roy, Mohammad Wazid, Ashok Kumar Das, Bharat K. Bhargava, Youngho Park 0005 |
IEEE Trans. Dependable Secur. Comput. | 1 |
| 2025 | Quantum Safe Lattice-Based Single Round Online Collaborative Multi-Signature Scheme for Blockchain-Enabled IoT ApplicationsabstractMulti-signature protocols allow a group of signers to collectively generate a single signature for a shared message. In the context of a decentralized blockchain, multi-signature schemes play a pivotal role in reducing the signature size. Recently, several multi-signature methods have emerged in the literature, some operating in discrete-log settings and others in lattice settings. However, many of the existing lattice-based multi-signature schemes incur high computation costs and online round complexity. Traditional public key-based multi-signature schemes are susceptible to quantum threats, and they are computationally intensive as well. A lattice-based multi-signature can provide robust security, which often falls short in terms of efficiency when it comes to round complexity. In this article, we aim to introduce a single-round lattice-based multi-signature scheme specifically designed for decentralized public blockchains. What sets the proposed scheme apart is its ability to function without the need for trapdoor commitments or sample pre-images, which are common features in existing lattice-based signature methods. Furthermore, we explore some potential applications in a generic Internet of Things (IoT) environment and their integration of the proposed scheme with the blockchain technology. The security of the proposed scheme is based on lattice-hard problems, like Ring-SIS (Shortest Integer Solution) and Ring-LWE (Learning with Errors). Prithwi Bagchi, Basudeb Bera, Ashok Kumar Das, Biplab Sikdar 0001 |
ACM Trans. Sens. Networks | 1 |