Security aspects of confidential network coding

Pfennig, Stefan; Franz, Elke

doi:10.1109/icc.2017.7996934

Cited by 4 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Invertibility of A ensures that the matrix of linear combinations can be decoded. This invertibility depends both on the size of A (given by G) and on the size of the finite field q [24]. The probability p inv (G, q) that A can be inverted is given by [25]…”

Section: Network Coded Transmissionmentioning

confidence: 99%

“…According to Table I in [24], the field GF (2 4 ) already achieves an inverting probability of 0.93384 for a matrix of size 2 × 2 as considered here. Besides, only the sender selects encoding coefficients so that the invertibility of the resulting matrix can be easily checked.…”

Section: Network Coded Transmissionmentioning

confidence: 99%

“…Hence, the FID or GID must not repeat as long as the same key for the computation of the tag is used to prevent a replay attack. A length of 24 bits allows 2 24 different values for the identifier. Given the payload of 64 bits per flit, a sender can send 128 MiB data using uncoded transmission to the same receiver before the corresponding key needs to be changed.…”

Section: Concept For Communication Protection 41 Possible Approachesmentioning

confidence: 99%

See 2 more Smart Citations

Efficient Communication Protection of Many-Core Systems against Active Attackers

et al. 2021

Self Cite

View full text Add to dashboard Cite

Many-core system-on-chips, together with their established communication infrastructures, Networks-on-Chip (NoC), are growing in complexity, which encourages the integration of third-party components to simplify and accelerate production processes. However, this also adversely exposes the surface for attacks through the injection of hardware Trojans. This work addresses active attacks on NoCs and focuses on the integrity and availability of transmitted data. In particular, we consider the modification and/or dropping of data during transmission as active attacks that might be performed by malicious routers. To mitigate the impact of such active attacks, we propose two lightweight solutions that respect the performance constraints of NoCs. Assuming the presence of symmetric keys, these approaches combine lightweight authentication codes for integrity protection with network coding for increased efficiency and robustness. The proposed solutions prevent undetected modifications and significantly increase availability through a reliable detection of attacks. The efficiency of these solutions is investigated in different scenarios using cycle-accurate simulations and the area overhead is analyzed relative to state-of-the-art many-core system. The results demonstrate that one authentication scheme with network coding protects the integrity of data to a low residual error of 1.36% at 0.2 attack probability with an area overhead of 2.68%. For faster and more flexible evaluation, an analytical approach is developed which is validated against the cycle-accurate simulations. The analytical approach is more than 1000× faster while having a maximum estimation error of 5%. Moreover, the analytical model provides a deeper insight into the system’s behavior. For example, it reveals which factors influence the performance parameters.

show abstract

Section: Network Coded Transmissionmentioning

confidence: 99%

Section: Network Coded Transmissionmentioning

confidence: 99%

Section: Concept For Communication Protection 41 Possible Approachesmentioning

confidence: 99%

See 1 more Smart Citation