Reed-Solomon codes and multi-path strategies to improve privacy performance over ad hoc networks

This paper presents a privacy protection scheme, suitable for devices limited in CPU and/or in memory capabilities, which not only ensures anonymity and confidentiality but has also a limited impact on end-to-end network performance. Such an approach for anonymous communications, inspired by network coding techniques, benefits from recent improvements in list decoding algorithms for Reed-Solomon codes, and takes advantage of multi-path routing capabilities. The combination of these techniques is adapted for constrained and pervasive environments, such as wireless ad hoc networks, as it decreases the processing complexity of the cryptographic/decoding operations and as it ensures better tolerance to packet losses (due to mobility or to bad quality of the radio channel).