Efficient Identity Based Signature Schemes Based on Pairings
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
An Identity-Based Signature from Gap Diffie-Hellman Groups
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Security Considerations in Space and Delay Tolerant Networks
SMC-IT '06 Proceedings of the 2nd IEEE International Conference on Space Mission Challenges for Information Technology
Applicability of identity-based cryptography for disruption-tolerant networking
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Efficient security primitives derived from a secure aggregation algorithm
Proceedings of the 15th ACM conference on Computer and communications security
Multicasting in delay tolerant networks: a social network perspective
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Message fragmentation in opportunistic DTNs
WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
Location-based compromise-tolerant security mechanisms for wireless sensor networks
IEEE Journal on Selected Areas in Communications
DTN: an architectural retrospective
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Bundle Authentication is a critical security service in Delay Tolerant Networks (DTNs) that ensures authenticity and integrity of bundles during multi-hop transmissions. Public key signatures, which have been suggested in existing bundle security protocol specification, achieve bundle authentication at the cost of an increased computational, transmission overhead and a higher energy consumption, which is not desirable for energy-constrained DTNs. On the other hand, the unique "store-carry-and-forward" transmission characteristic of DTNs implies that bundles from distinct/common senders can be buffered opportunistically at some common intermediate nodes. This "buffering" characteristic distinguishes DTN from any other traditional wireless networks, for which an intermediate cache is not supported. To exploit such a buffering characteristic, in this paper, we propose an Opportunistic Batch Bundle Authentication Scheme (OBBA) to achieve efficient bundle authentication. The proposed scheme adopts batch verification techniques, allowing a computational overhead to be bounded by the number of opportunistic contacts instead of the number of messages. Furthermore, we introduce a novel concept of a fragment authentication tree to minimize communication cost by choosing an optimal tree height. Finally, we implement OBBA in a specific DTN scenario setting: pocket-switched networks on campus. The simulation results in terms of computation time, transmission overhead and power consumption are given to demonstrate the efficiency and effectiveness of the proposed schemes.