A5103086553- Cryptography and Data Security
- Complexity and Algorithms in Graphs
- Privacy-Preserving Technologies in Data
- Security in Wireless Sensor Networks
- Cryptographic Implementations and Security
- Advanced Authentication Protocols Security
- Chaos-based Image/Signal Encryption
- Coding theory and cryptography
- Cryptography and Residue Arithmetic
- Internet Traffic Analysis and Secure E-voting
- Cloud Data Security Solutions
- Blockchain Technology Applications and Security
- Mobile Ad Hoc Networks
- Energy Efficient Wireless Sensor Networks
- Advanced Steganography and Watermarking Techniques
- Polynomial and algebraic computation
- Quantum Computing Algorithms and Architecture
- User Authentication and Security Systems
- Wireless Communication Security Techniques
- graph theory and CDMA systems
- Access Control and Trust
- Digital Rights Management and Security
- Network Security and Intrusion Detection
- Cooperative Communication and Network Coding
- Wireless Body Area Networks
Indian Institute of Technology Kharagpur
2015-2024
Jadavpur University
2018-2019
Indian Institute of Technology Indore
2013
National University of Ireland, Maynooth
2008-2010
Institute for Infocomm Research
2007-2008
Indian Statistical Institute
2005
In this paper, we present and analyze a variant of Burmester-Desmedt group key agreement protocol (BD) enhance it to dynamic setting where set users can leave or join the at any time during execution with updated keys. contrast BD protocol, let us refer our as DB protocol. Although is similar there are subtle differences between them: 1) Key computation in different simpler than same complexity protocol; 2) Number rounds required authenticated one less that introduced by Katz-Yung; 3) more...
This paper presents an efficient password-based authenticated encrypted group key agreement protocol immune to dictionary attack under the computation Diffie-Hellman (CDH) assumption. In a protocol, users only share human-memorable low entropy password; and using this low-entropy password, can agree upon high-entropy session which they may use build secure communication channel among themselves. While designing such protocols, one should limit number of on-line password guessing achieve...
A self-healing key distribution scheme enables a large group of users (sensor nodes) to establish session dynamically over an unreliable, or lossy wireless network. The main property ensures that the qualified can recover lost keys on their own from broadcast packets and some private information, without any additional communication with manager, thus decreasing load manager. only requirement for user keys, is its membership in both before after sessions which containing are sent....
In this paper, we develop and analyze a new self-healing key distribution scheme with revocation capability, scalable to very large groups in unreliable ad hoc wireless environment. The main emphasis of our proposed is that it has significant improvement terms both storage communication overhead compared the previous works. t capability O((t + 1) log q), complexity O((t+1+j) where q prime j current session number. contrast schemes, use different more efficient technique. On positive note,...
Abstract With the help of a multi-signature scheme, we can reduce cost storage and bandwidth in case many signers signing same message. Therefore, schemes be used bitcoin to size blockchain. In this paper, propose lattice-based scheme with following highlighted features. Our supports signature compression public key aggregation. The only existing by Kansal Dutta (Africacrypt, 2020) that both aggregation has communication $\widetilde{\mathcal{O}}(n^2)$, whereas our is $\mathcal{O}(n)$. plain...