Related papers: Secure Multiplex Coding with a Common Message
Quantum privacy amplification is a central task in quantum cryptography. Given shared randomness, which is initially correlated with a quantum system held by an eavesdropper, the goal is to extract uniform randomness which is decoupled from…
Matrix multiplication is one of the key operations in various engineering applications. Outsourcing large-scale matrix multiplication tasks to multiple distributed servers or cloud is desirable to speed up computation. However, security…
Motivated in part by the problem of secure multicast distributed storage, we analyze secrecy rates for a channel in which two transmitters simultaneously multicast to two receivers in the presence of an eavesdropper. Achievable rates are…
In this paper, we propose a cooperative approach to improve the security of both primary and secondary systems in cognitive radio multicast communications. During their access to the frequency spectrum licensed to the primary users, the…
In this paper, we study the problem of distributed multi-user secret sharing, including a trusted master node, $N\in \mathbb{N}$ storage nodes, and $K$ users, where each user has access to the contents of a subset of storage nodes. Each…
We prove the security of quantum key distribution against the most general attacks which can be performed on the channel, by an eavesdropper who has unlimited computation abilities, and the full power allowed by the rules of classical and…
We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where a common message is transmitted with feedback using either fixed-blocklength codes or variable-length codes. For the fixed-blocklength-code…
A novel private communication framework is proposed where privacy is induced by transmitting over a channel instances of linear inverse problems that are identifiable to the legitimate receiver but unidentifiable to an eavesdropper. The gap…
In this paper, we study the capacity region of the general distributed index coding. In contrast to the traditional centralized index coding where a single server contains all $n$ messages requested by the receivers, in the distributed…
In this paper, we consider the problem of secret key agreement in state-dependent 3-receiver broadcast channels. In the proposed model, there are two legitimate receivers, an eavesdropper and a transmitter where the channel state…
In this paper, we consider the Gaussian multiple-input multiple-output (MIMO) multi-receiver wiretap channel in which a transmitter wants to have confidential communication with an arbitrary number of users in the presence of an external…
Mission-critical communications (MCC) involve all communications between people in charge of the safety of the civil society. MCC have unique requirements that include improved reliability, security and group communication support. In this…
Jolfaei et al. used feedback to create transmit signals that are simultaneously useful for multiple users in a broadcast channel. Later, Georgiadis and Tassiulas studied erasure broadcast channels with feedback, and presented the capacity…
Building upon previous work on the relation between secrecy and channel resolvability, we revisit a secrecy proof for the multiple-access channel (MAC) from the perspective of resolvability. In particular, we refine and extend the proof to…
We study private classical communication over quantum multiple-access channels. For an arbitrary number of transmitters, we derive a regularized expression of the capacity region. In the case of degradable channels, we establish a…
This paper considers secure communication in buffer-aided cooperative wireless networks in the presence of one eavesdropper, which can intercept the data transmission from both the source and relay nodes. A new max-ratio relaying protocol…
In this paper, the individual secrecy of two-way wiretap channel is investigated, where two legitimate users' messages are separately guaranteed secure against an external eavesdropper. For one thing, in some communication scenarios, the…
In this paper, we propose a transmission scheme that achieves information theoretic security, without making assumptions on the eavesdropper's channel. This is achieved by a transmitter that deliberately introduces synchronization errors…
It is a well-known fact that feedback does not increase the capacity of point-to-point memoryless channels, however, its effect in secure communications is not fully understood yet. In this work, an achievable scheme for the wiretap channel…
This study proposes a quantum secret authentication code for protecting the integrity of secret quantum states. Since BB84[1] was first proposed, the eavesdropper detection strategy in almost all quantum cryptographic protocols is based on…