Related papers: Secure Computation-and-Forward with Linear Codes
Wireless networks with multiple nodes that relay information from a source to a destination are expected to be deployed in many applications. Therefore, understanding their design and performance under practical constraints is important. In…
We study a discrete-memoryless relay network consisting of one source, one destination and N relays, and design a scheme based on partial decode-forward relaying. The source splits its message into one common and N+1 private parts, one…
In this paper, we consider joint network and LDPC coding for practically implementing the denosie-and-forward protocol over bi-directional relaying. the closed-form expressions for computing the log-likelihood ratios of the network-coded…
We suggest two new methodologies for the design of efficient secure protocols, that differ with respect to their underlying computational models. In one methodology we utilize the communication complexity tree (or branching for f and…
This paper considers rateless network error correction codes for reliable multicast in the presence of adversarial errors. Most existing network error correction codes are designed for a given network capacity and maximum number of errors…
We determine the capacity region of the secure multiplex coding with a common message, and evaluate the mutual information and the equivocation rate of a collection of secret messages to the second receiver (eavesdropper), which were not…
While network coding can be an efficient means of information dissemination in networks, it is highly susceptible to "pollution attacks," as the injection of even a single erroneous packet has the potential to corrupt each and every packet…
This paper considers a multi-source multi-relay network, in which relay nodes employ a coding scheme based on random linear network coding on source packets and generate coded packets. If a destination node collects enough coded packets, it…
In this paper, we investigate multi-message authentication to combat adversaries with infinite computational capacity. An authentication framework over a wiretap channel $(W_1,W_2)$ is proposed to achieve information-theoretic security with…
In this paper, we derive information-theoretic performance limits for secure and reliable communications over the general two-user discrete memoryless broadcast channel with side-information at the transmitter. The sender wishes to…
We consider the problem of two transmitters wishing to exchange information through a relay in the middle. The channels between the transmitters and the relay are assumed to be synchronized, average power constrained additive white Gaussian…
An efficient analog network coding transmission protocol is proposed in this letter for a MIMO two way cellular network. Block signal alignment is first proposed to null the inter-user interference for multi-antenna users, which makes the…
Ensuring the correctness of distributed system implementations remains a challenging and largely unaddressed problem. In this paper we present a protocol that can be used to certify the safety of consensus implementations. Our proposed…
Relay-based cooperative communication has become a research focus in recent years because it can achieve diversity gain in wireless networks. In existing works, network coding and two-path relay are adopted to deal with the increase of…
This work considers optimizing LDPC codes in the physical-layer network coded two-way relay channel using noncoherent FSK modulation. The error-rate performance of channel decoding at the relay node during the multiple-access phase was…
We consider a relay network with two relays and a feedback link from the receiver to the sender. To obtain the achievability result, we use compress-and-forward and random binning techniques combined with deterministic binning and…
This paper presents generalized channel coding theorems for a time-slotted distributed communication system where a transmitter-receiver pair is communicating in parallel with other transmitters. Assume that the channel code of each…
We consider a multi-way relay network with an orthogonal uplink and correlated sources, and we characterise reliable communication (in the usual Shannon sense) with a single-letter expression. The characterisation is obtained using a joint…
We propose a novel hybrid universal network-coding cryptosystem (HUNCC) to obtain secure post-quantum cryptography at high communication rates. The secure network-coding scheme we offer is hybrid in the sense that it combines…
We present a capacity-achieving coding scheme for unicast or multicast over lossy packet networks. In the scheme, intermediate nodes perform additional coding yet do not decode nor even wait for a block of packets before sending out coded…