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 …

The Singleton bound provides a fundamental limit on the maximum possible size of an error-
correcting code of a given length and distance. However, recent work by Zhang et. al.[IEEE …

We define a variation on the well-known problem of private message transmission. This new
problem called private randomness agreement (PRA) gives two participants access to a …

Maximum distance separable (MDS) codes are often considered to have the optimal error
correction capability against malicious adversaries because they achieve the Singleton …

In this paper, we propose a security model to capture active attacks against multipath key
establishment (MPKE) in sensor networks. Our model strengthens previous models to …

We consider the problem of communication over a multi-path network in the presence of a
causal adversary. The limited-view causal adversary is able to, based on the current and …

In a secure message transmission (SMT) scenario, a sender wants to send a message in a
private and reliable way to a receiver. Sender and receiver are connected by n wires, t of …

The main goal of any benchmark is to guide decisions through system ranking, but
surprisingly little research has been focused so far on providing means to gain confidence …

When there exists a malicious attacker in the network, we need to be careful of
eavesdropping and contamination. This problem is crucial for network communication when …

In a given graph with two designated nodes, namely the S ender and the R eceiver, an
adversary can corrupt up to any t nodes (except for S and R) of its choice in an Omission …