Loss-Tolerant Bundle Fragment Authentication for Space-Based DTNs

Bundle authentication, which ensures the authenticity and integrity of bundles, is critical in space Delay/disruption-Tolerant Networks (DTNs). When bundle fragment services are needed, the previous solutions directly using digital signatures suffer from heavy computational costs and bandwidth overheads. This paper addresses the issue of fragment authentication for Bundle Protocol by exploiting erasure codes and the batch transmission characteristic of DTNs. Erasure codes are adopted to allow all the fragments of a bundle to equally share only one signature, to tolerate high delays as well as unexpected loss of connectivity. Following this generic idea, we present two approaches, both of which are effective in filtering inauthentic fragments as early as possible. The first one takes a surprisingly low bandwidth overhead, while it makes all received fragments of a bundle to be removed when there is an inauthentic one, because of its failure in locating the inauthentic fragments. Considering this defect, we present an improved scheme which is able to detect inauthentic fragments thanks to a special hash chain and then only remove these inauthentic ones. The performance simulation demonstrates that both our schemes significantly reduce bandwidth overheads and computational costs as compared to the prior works.

[1]  Refik Molva,et al.  Efficient Multicast Packet Authentication , 2003, NDSS.

[2]  Vipul Gupta,et al.  Energy analysis of public-key cryptography for wireless sensor networks , 2005, Third IEEE International Conference on Pervasive Computing and Communications.

[3]  Stephen Farrell,et al.  Bundle Security Protocol Specification , 2011, RFC.

[4]  Stephen Farrell,et al.  Delay-Tolerant Networking Security Overview , 2009 .

[5]  Tomaso de Cola A protocol design for incorporating erasure codes within CCSDS: The case of DTN protocol architecture , 2010, 2010 5th Advanced Satellite Multimedia Systems Conference and the 11th Signal Processing for Space Communications Workshop.

[6]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[7]  Daniel A. Spielman,et al.  Practical loss-resilient codes , 1997, STOC '97.

[8]  Mario Marchese,et al.  Joint Use of Custody Transfer and Erasure Codes in DTN Space Networks: Benefits and Shortcomings , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[9]  Luigi Rizzo,et al.  Effective erasure codes for reliable computer communication protocols , 1997, CCRV.

[10]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[11]  Aniket Kate,et al.  Anonymity and security in delay tolerant networks , 2007, 2007 Third International Conference on Security and Privacy in Communications Networks and the Workshops - SecureComm 2007.

[12]  Luciana Arantes,et al.  Using Evolving Graphs to evaluate DTN routing protocols. , 2009 .

[13]  Harald Ernst,et al.  Performance analysis of CCSDS File Delivery Protocol and erasure coding techniques in deep space environments , 2007, Comput. Networks.

[14]  Vinton G. Cerf,et al.  Delay-Tolerant Networking Architecture , 2007, RFC.

[15]  Qinghua Li,et al.  Multicasting in delay tolerant networks: a social network perspective , 2009, MobiHoc '09.

[16]  Tomaso de Cola A protocol design for incorporating erasure codes within CCSDS: The case of DTN protocol architecture , 2010 .

[17]  Igor Bisio,et al.  Congestion Aware Routing Strategies for DTN-Based Interplanetary Networks , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[18]  Zhenfu Cao,et al.  A Probabilistic Misbehavior Detection Scheme toward Efficient Trust Establishment in Delay-Tolerant Networks , 2014 .

[19]  V. Pless Introduction to the Theory of Error-Correcting Codes , 1991 .

[20]  Craig Partridge Authentication For Fragments , 2005 .

[21]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[22]  Randall J. Atkinson,et al.  Security Architecture for the Internet Protocol , 1995, RFC.

[23]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[24]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[25]  V. Cahill,et al.  Security considerations in space and delay tolerant networks , 2006, 2nd IEEE International Conference on Space Mission Challenges for Information Technology (SMC-IT'06).

[26]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[27]  Emmanuel Lochin,et al.  Robust Streaming in Delay Tolerant Networks , 2010, 2010 IEEE International Conference on Communications.

[28]  Thrasyvoulos Spyropoulos,et al.  Optimal Buffer Management Policies for Delay Tolerant Networks , 2008, 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[29]  Yi Mu,et al.  Non-Interactive Key Establishment for Bundle Security Protocol of Space DTNs , 2014, IEEE Transactions on Information Forensics and Security.

[30]  F. Moore,et al.  Polynomial Codes Over Certain Finite Fields , 2017 .

[31]  J. H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[32]  Mostafa Ammar,et al.  Routing in Space and Time in Networks with Predictable Mobility , 2004 .

[33]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[34]  M. Darnell,et al.  Error Control Coding: Fundamentals and Applications , 1985 .

[35]  Xiaodong Lin,et al.  An Opportunistic Batch Bundle Authentication Scheme for Energy Constrained DTNs , 2010, 2010 Proceedings IEEE INFOCOM.