Faculty Publications
Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736
Publications by NITK Faculty
Browse
2 results
Search Results
Item A new probabilistic rekeying method for secure multicast groups(2010) Pais, A.R.; Joshi, S.The Logical Key Hierarchy (LKH) is the most widely used protocol in multicast group rekeying. LKH maintains a balanced tree that provide uniform cost of O(log N) for compromise recovery, where N is group size. However, it does not distinguish the behavior of group members even though they may have different probabilities of join or leave. When members have diverse changing probabilities, the gap between LKH and the optimal rekeying algorithm will become bigger. The Probabilistic optimization of LKH (PLKH) scheme, optimized rekey cost by organizing LKH tree with user rekey characteristic. In this paper, we concentrate on further reducing the rekey cost by organizing LKH tree with respect to rekey probabilities of members using new join and leave operations. Simulation results show that our scheme performs 18 to 29% better than PLKH and 32 to 41% better than LKH. © 2010 Springer-Verlag.Item A partial key pre-distribution based en-route filtering scheme for wireless sensor networks(Springer Science and Business Media Deutschland GmbH, 2021) Kumar, A.; Bansal, N.; Pais, A.R.Compromised sensor nodes can be used to inject false reports (bogus reports) in wireless ssensor networks (WSNs). This can cause the sink to take wrong decisions. En-route filtering is a method to detect and filter false reports from WSNs. Most of the existing en-route filtering schemes use probabilistic approaches to filter false reports from the network, where filtering of false reports is based on a fixed probability. Thus false reports can travel multiple hops before being dropped. In this article we seek to overcome limitations of the existing schemes and reduce the overall key storage overhead in the cluster heads. In this article we propose a combinatorial design based partial en-route filtering scheme (CD-PEFS) which filters the fabricated reports deterministically. CD-PEFS reduces the energy requirements in the network by early detection and elimination of the false reports. Adoption of combinatorial design based keys get rid of shared key discovery phase from the network. This considerably reduces the communication overhead in the network. We carried out a detailed analysis of CD-PEFS against an increasing number of compromised sensor nodes in the network. We found that our scheme performs better than existing schemes in terms of filtering efficiency while maintaining low key storage overhead in the network. Further the performance of CD-PEFS is at par with existing schemes in terms of other protocol overheads. © 2020, Springer-Verlag GmbH Germany, part of Springer Nature.