Hamid Hanifi
ABSTRACT
An important problem for secure communication is that of achieving jam resistance, without any prior shared secret between the sender and receiver, and without limits on the assumed computational power of the attacker. To date, only one system has been proposed for this, the BBC system, which is based on coding theory using codes derived from arbitrary hash functions. It is unfortunate that only one, narrow solution has been found for this important problem. We now propose a new algorithm for this problem: the HBT algorithm. It is very different from BBC, using codes based on monotone Boolean functions (MBF), rather than hash functions. It is also more general. We show that despite being very different from BBC, the latter can be viewed as a special case of it. In fact, a theorem proves that all such codes are special cases of this new system. We give empirical results suggesting that this new approach is useful, and describe directions for future research.
- Leemon C. III Baird and William L. Bahn. An efficient correlator for implementations of bbc jam resistance. Technical Report USAFA-TR-2009-ACCR-02, U. S. Air Force Academy, Academy Center for Cyberspace Research, Nov 2009.Google Scholar
- Leemon C. III Baird, William L. Bahn, Michael D. Collins, Martin C. Carlisle, and Sean Butler. Keyless jam resistance. In Proceedings of the 8th Annual IEEE SMC Information Assurance Workshop (IAW), pages 143--150, June 20--22 2007.Google ScholarCross Ref
- Jack P. F. Glas. On multiple access interference in a ds/ffh spread spectrum communication system. In In the proc of the Third IEEE International Symposiumon Spread Spectrum Techniquesand Applications, July 1994.Google ScholarCross Ref
- Leemon C. Baird III, William L. Bahn, and Michael D. Collins. Jam-resistant communication without shared secrets through the use of concurrent codes. U. S. Air Force Academy Technical Report, February 2007.Google Scholar
- E. G. Kanterakis. A novel technique for narrowband/broadband interference excision in ds-ss communications. In MILCOM '94, volume 2, pages 628--632, 1994.Google ScholarCross Ref
- W. H. Kautz and R. C. Singleton. Nonrandom binary superimposed codes. IEEE Transactions on Information Theory, pages 363--377, 1964. Google ScholarDigital Library
- L. Li and L. Milstein. Rejection of pulsed cw interference in pn spread-spectrum systemsusing complex adaptive. In IEEE Trans. Commun, 1994.Google Scholar
Index Terms
- A new algorithm for unkeyed jam resistance
Recommendations
Exhaustive attack analysis of BBC with glowworm for unkeyed jam resistance
MILCOM 2015 - 2015 IEEE Military Communications ConferenceAn important problem is to provide jam resistance for wireless networks. This is more difficult in cases such as GPS, where the sender and receiver do not have a shared secret that is unknown to the jammer. Currently, the only known system for such jam ...
A new iterative computer search algorithm for good quasi-twisted codes
As a generalization to cyclic and consta-cyclic codes, quasi-twisted (QT) codes contain many good linear codes. During the last twenty years, a lot of record-breaking codes have been found by computer search for good QT codes. But due to the time ...
A Mutual Authentication Protocol with Resynchronisation Capability for Mobile Satellite Communications
Many peer-to-peer security protocols proposed for wireless communications use one-time shared secrets for authentication purposes. This paper analyses online update mechanisms for one-time shared secrets. A new type of attack against update mechanisms, ...
Comments