On pseudolinear codes for correcting adversarial errors

E Ruzomberka, H Nikbakht… - 2023 IEEE 64th …, 2023 - ieeexplore.ieee.org
We consider error-correction coding schemes for adversarial wiretap channels (AWTCs) in
which the channel can a) read a fraction of the codeword bits up to a bound r and b) flip a …

Computationally Efficient Codes for Adversarial Binary-Erasure Channels

S Li, P Krishnan, S Jaggi, M Langberg… - … on Information Theory …, 2023 - ieeexplore.ieee.org
We study communication models for channels with erasures in which the erasure pattern
can be controlled by an adversary with partial knowledge of the transmitted codeword. In …

A model for adversarial wiretap channels and its applications

R Safavi-Naini, P Wang - Journal of information processing, 2015 - jstage.jst.go.jp
In the wiretap model of secure communication, Alice is connected to Bob and Eve by two
noisy channels. Wyner's insight was that the difference in noise between the two channels …

Codes for detection of limited view algebraic tampering

F Lin, R Safavi-Naini, P Wang - International Conference on Information …, 2016 - Springer
Tamper resilient cryptography has recently gained attention, and novel coding solutions
have been proposed. One such solutions is Tamper Detection (TD) codes that are used to …

Information-theoretically secure key agreement over partially corrupted channels

R Safavi-Naini, P Wang - arXiv preprint arXiv:1604.03824, 2016 - arxiv.org
Key agreement is a fundamental cryptographic primitive. It has been proved that key
agreement protocols with security against computationally unbounded adversaries cannot …

Secure Key Agreement over Partially Corrupted Channels

R Safavi-Naini, P Wang - 2018 IEEE International Symposium …, 2018 - ieeexplore.ieee.org
Key agreement (KA) is a fundamental cryptographic primitive. Assuming that Alice and Bob
do not have any prior shared correlation, it has been proved that key agreement with …