Error- and loss-tolerant bundle fragment authentication for space DTNs

Xixiang LV, Hui LI

PDF(316 KB)
PDF(316 KB)
Front. Comput. Sci. ›› 2014, Vol. 8 ›› Issue (6) : 1012-1023. DOI: 10.1007/s11704-014-3365-6
RESEARCH ARTICLE

Error- and loss-tolerant bundle fragment authentication for space DTNs

Author information +
History +

Abstract

To ensure the authenticity and integrity of bundles, the in-transit PDUs of bundle protocol (BP) in space delay/disruption-tolerant networks (DTNs), the bundle security protocol specification (IRTF RFC6257) suggested using a digital signature directly over each bundle. However, when bundle fragment services are needed, this mechanism suffers from heavy computational costs, bandwidth overheads and energy consumption. In this paper, we address the fragment authentication issue for BP by exploiting the combination of RS error correction and erasure codes with the help of batch transmission characteristic of DTNs. The RS error correction and erasure codes are adopted to allow the receivers to locate the false/injected fragments and reconstruct the only one signature shared by all fragments of a bundle, even if some other fragments are lost or routed to a different path. Getting only partial authentic fragments, a DTN node is able to detect and filter the false/injected fragments, and authenticate the origin of a bundle as well. Such an approach tolerates high delays, unexpected link disruption and the BP nature of routing fragments of the same bundle possibly via different paths. The performance analysis demonstrates that both of our schemes, which follow our generic idea based on RS codes, significantly reduce bandwidth overheads and computational costs as compared to the prior works.

Keywords

space-based delay tolerant networks / bundle authentication / information security

Cite this article

Download citation ▾
Xixiang LV, Hui LI. Error- and loss-tolerant bundle fragment authentication for space DTNs. Front. Comput. Sci., 2014, 8(6): 1012‒1023 https://doi.org/10.1007/s11704-014-3365-6

References

[1]
The Consultative Committee for Space Data Systems. Rationale, Scenarios, and Requirements for DTN in Space. Draft Informational Report. 2010
[2]
Cerf V, Burleigh S, Hooke A, Torgerson L, Durst R, Scott K, Fall K, Weiss H. Delay-Tolerant Networking Architecture. RFC4838, 2007-April
[3]
Asokan N, Kostianinen K, Ginzboorg P, Ott J, Luo C. Towards Securing Disruption-Tolerant Networking. Nokia Research Center Technical Report NRC-TR-2007-007, 2007
[4]
Farrell S, Cahill V. Security considerations in space and delay tolerant networks. In: Proceedings of 2nd IEEE International Conference on Space Mission Challenges for Information Technology. 2006, 8−38
[5]
Symington. S, Farrell S, Weiss H, Lovell P. Bundle Security Protocol Specification. IRTF, RFC6257, 2011-May
[6]
Atkinson R, Kent S. Security Architecture for the Internet Protocol. IETF, RFC2401, 1998
[7]
Gao W, Li Q, Zhao B, Cao G. Multicasting in delay tolerant networks: a social network perspective. In: Proceedings of the 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing. 2009, 299−308
CrossRef Google scholar
[8]
Spyropoulos T, Psounis K, Raghavendra C. Efficient routing in intermittently connected mobile networks: the multiple-copy case. IEEE/ACM Transactions on Networking, 2008, 16(1): 77−90
CrossRef Google scholar
[9]
Caini C, Cruickshank H, Farrell S, Marchese M. Delay-and disruptiontolerant networking (DTN): an alternative solution for future satellite networking applications. Proceedings of the IEEE, 2011, 99(11): 1980−1997
CrossRef Google scholar
[10]
Farrell S, Symington S, Weiss H, Lovell P. Delay-tolerant Networking Security Overview. IRTF, DTN research group, 2008
[11]
DTNRG. Delay Tolerant Networking Research Group: DTN Interest Mailing List Archive. 2005
[12]
Partridge C. Authentication for fragments. In: Proceedings of the 4th Workshop on Hot Topics in Networks. 2005
[13]
Zhu H, Lin X, Lu R, Shen X, Xing D, Cao Z. An opportunistic batch bundle authentication scheme for energy constrained DTNs. In: Proceedings of IEEE INFOCOM. 2010, 1−9
[14]
Cello M, Gnecco G, Marchese M, Sanguineti M. A model of buffer occupancy for icns. IEEE Communications Letters, 2012, 16(6): 862−865
CrossRef Google scholar
[15]
Blahut R. Theory and Practice of Error Control Codes. Addison-Wesley, 1983
[16]
Lin S, Costello Jr D. Error control coding: fundamentals and applications. Proceedings of IEE on Communication, Radar and Signal Processing, 1985, 132(1): 68
[17]
Pless V. Introduction to the Theory of Error-correcting Codes. Wiley-Interscience, 1998
CrossRef Google scholar
[18]
Van Lint J. Introduction to Coding Theory. Springer Verlag, 1999
CrossRef Google scholar
[19]
Rizzo L. Effective erasure codes for reliable computer communication protocols. ACMSIGCOMM Computer Communication Review, 1997, 27(2): 24−36
CrossRef Google scholar
[20]
Cipra B. The ubiquitous reed-solomon codes. SIAM News, 1993, 26(1): 1993
[21]
Pannetrat A, Molva R. Efficient multicast packet authentication. In: Proceedings of Network and Distributed System Security Symposium. 2003
[22]
Cola d T, Ernst H, Marchese M. Performance analysis of ccsds file delivery protocol and erasure coding techniques in deep space environments. Computer Networks, 2007, 51(14): 4032−4049
CrossRef Google scholar
[23]
Bisio I, Marchese M, Cola d T. Congestion aware routing strategies for DTN-based interplanetary networks. In: Proceedings of 2008 IEEE Global Telecommunications Conference. 2008, 1−5
[24]
Cola d T, Marchese M. Joint use of custody transfer and erasure codes in DTN space networks: benefits and shortcomings. In: Proceedings of 2010 IEEE Global Telecommunications Conference. 2010, 1−5
[25]
Cola d T, Marchese M. Reliable data delivery over deep space networks: benefits of long erasure codes over arq strategies. IEEE Wireless Communications, 2010, 17(2): 57−65
CrossRef Google scholar
[26]
The Consultative Committee for Space Data Systems. Erasure Correcting Codes for Use in Near Earth and Deep-space Communications. CCSDS 131.5-O-0.2. 2011
[27]
Cola d T, Paolini E, Liva G, Calzolari G P. Reliability options for data communications in the future deep-space missions. Proceedings of the IEEE, 2011, 99(11): 2056−2074
CrossRef Google scholar
[28]
Fürer M. Faster integer multiplication. In: Proceedings of the 39th annual ACM Symposium on Theory of Computing. 2007, 57−66
[29]
Peterson W. Encoding and error-correction procedures for the bosechaudhuri codes. IRE Transactions on Information Theory, 1960, 6(4): 459−470
CrossRef Google scholar
[30]
Chien R. Cyclic decoding procedures for bose-chaudhurihocquenghem codes. IEEE Transactions on Information Theory, 1964, 10(4): 357−363
CrossRef Google scholar
[31]
Kate A, Zaverucha G, Hengartner U. Anonymity and security in delay tolerant networks. In: Proceeding of the 3rd Security and Privacy in Communications Networks and the Workshops, 2007, 504−513
[32]
Gallager R. Low-density parity-check codes. IRE Transactions on Information Theory, 1962, 8(1): 21−28
CrossRef Google scholar
[33]
Birrane E. Streamlined Bundle Security Protocol Specification. IETF draft-irtf-dtnrg-sbsp-00, 2014
[34]
Krifa A, Baraka C, Spyropoulos T. Optimal buffer management policies for delay tolerant networks. In: Proceeding of 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks. 2008, 260−268
CrossRef Google scholar
[35]
Wander A S, Gura N, Eberle H, Gupta V, Shantz S C. Energy analysis of public-key cryptography for wireless sensor networks. In: Proceedings of 3rd IEEE International Conference on Pervasive Computing and Communications. 2005, 324−328
CrossRef Google scholar

RIGHTS & PERMISSIONS

2014 Higher Education Press and Springer-Verlag Berlin Heidelberg
AI Summary AI Mindmap
PDF(316 KB)

Accesses

Citations

Detail

Sections
Recommended

/