Skip navigation

Jointly padding for subspace orthogonality against tag pollution

Jointly padding for subspace orthogonality against tag pollution

Yang, Du, Esfahani, Alireza ORCID: 0000-0002-2100-1569, Mantas, Georgios ORCID: 0000-0002-8074-0417 and Rodriguez, Jonathan (2015) Jointly padding for subspace orthogonality against tag pollution. In: 2014 IEEE 19th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD). IEEE, pp. 85-89. ISSN 2378-4865 (Print), 2378-4873 (Online) (doi:https://doi.org/10.1109/CAMAD.2014.7033211)

Full text not available from this repository. (Request a copy)

Abstract

Homomorphic Message Authentication Code (HMAC) is a low-complexity low-delay scheme for pollution detection is a Random Linear Network Coding (RLNC) enabled network. However, HMAC is vulnerable to tag pollution, in which an adversary node merely randomly modifies some MAC tags appended at the end of data packets. Existing tag pollution resistant solutions cause either high computation efforts long delay at relay nodes or substantial communication burden, or additional requirements such as synchronization at all nodes. In this paper, we combine the core ideas of two pollution detection schemes: “padding for orthogonality” and “Null key”, and propose a new pollution detection method by “jointly padding for subspace orthogonality” that is immune to tag pollution, remains low-complexity low-delay, low communication overhead, and no timing requirements.

Item Type: Conference Proceedings
Title of Proceedings: 2014 IEEE 19th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)
Uncontrolled Keywords: random linear network coding (RLNC), homomorphic message authentication code (HMAC), pollution detection, tag pollution
Subjects: T Technology > TA Engineering (General). Civil engineering (General)
Faculty / School / Research Centre / Research Group: Faculty of Engineering & Science
Faculty of Engineering & Science > School of Engineering (ENG)
Last Modified: 30 May 2022 09:30
URI: http://gala.gre.ac.uk/id/eprint/27761

Actions (login required)

View Item View Item