Sufficiently myopic adversaries are blind
We consider a communication problem in which a sender, Alice, wishes to communicate
with a receiver, Bob, over a channel controlled by an adversarial jammer, James, who is …
with a receiver, Bob, over a channel controlled by an adversarial jammer, James, who is …
A model for adversarial wiretap channels
P Wang, R Safavi-Naini - IEEE Transactions on Information …, 2015 - ieeexplore.ieee.org
In the wiretap model of secure communication, Alice is connected to Bob over a noisy
channel that is eavesdropped by Eve. The goal is to provide (asymptotic) reliability and …
channel that is eavesdropped by Eve. The goal is to provide (asymptotic) reliability and …
An efficient code for adversarial wiretap channel
P Wang, R Safavi-Naini - 2014 IEEE Information Theory …, 2014 - ieeexplore.ieee.org
In the (ρ r, ρ w)-adversarial wiretap (AWTP) channel model of [13], a codeword sent over the
communication channel is corrupted by an adversary who observes a fraction ρ r of the …
communication channel is corrupted by an adversary who observes a fraction ρ r of the …
Limited view adversary codes: bounds, constructions and applications
P Wang, R Safavi-Naini - … , ICITS 2015, Lugano, Switzerland, May 2-5 …, 2015 - Springer
Abstract Limited View Adversary Codes (LV codes) provide protection against an adversary
who has partial view of the communication channel and can use this view to corrupt the sent …
who has partial view of the communication channel and can use this view to corrupt the sent …
Adversarial wiretap channel with public discussion
P Wang, R Safavi-Naini - 2015 IEEE Conference on …, 2015 - ieeexplore.ieee.org
Wyner's elegant model of wiretap channel exploits noise in the communication channel to
provide perfect secrecy against a computationally unlimited passive eavesdropper, without …
provide perfect secrecy against a computationally unlimited passive eavesdropper, without …
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 …
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 …
do not have any prior shared correlation, it has been proved that key agreement with …