Related papers: Secure Groupcast with Shared Keys
We consider a secure communication over a two-user Gaussian interference channel, where each transmitter sends a confidential message to its legitimate receiver. For this setting, we identify a regime where the simple scheme of using…
This paper considers precoding for multi-group multicasting with a common message. The multiple antenna base station communicates with $K$ clusters, each with $L$ users. There is a common message destined to all users and a private…
We study the hierarchical secure aggregation problem with groupwise keys. The problem consists of an aggregation server, $U$ relays, and $UV$ users, where each relay serves $V$ disjoint users, and each subset of $G$ users shares an…
A central goal in information theory and cryptography is finding simple characterizations of optimal communication rates subject to various restrictions and security requirements. Ideally, the optimal key rate for a quantum key distribution…
We investigate the $K$-user many-to-one interference channel with confidential messages in which the $K$th user experiences interference from all other $K-1$ users, and is at the same time treated as an eavesdropper to all the messages of…
Previous work showed that the X network with M transmitters, N receivers has MN/(M+N-1) degrees of freedom. In this work we study the degrees of freedom of the X network with secrecy constraints, i.e. the X network where some/all messages…
The coded caching scheme proposed by Maddah-Ali and Niesen considers the delivery of files in a given content library to users through a deterministic error-free network where a common multicast message is sent to all users at a fixed rate,…
Broadcast encryption allows the sender to securely distribute his/her secret to a dynamically changing group of users over a broadcast channel. In this paper, we just consider a simple broadcast communication task in quantum scenario, which…
Continuous-variable quantum key distribution holds the potential to generate high secret key rates, making it a prime candidate for high-rate metropolitan quantum network applications. However, despite these promising opportunities, the…
Future global quantum communication networks, or quantum Internet, will realize high-rate secure communication and entanglement distribution for large-scale users over long distances. Continuous variable (CV) quantum key distribution (QKD)…
Multiple groupcasting over the broadcast channel (BC) is studied. In particular, an inner bound is obtained for the $K$-receiver discrete memoryless (DM) BC for the diamond message set which consists of four groupcast messages: one desired…
In the secure group communication, data is transmitted in such a way that only the group members are able to receive the messages. The main problem in the solution using symmetric key is heavy re-keying cost. To reduce re-keying cost tree…
Quantum networks will provide multi-node entanglement over long distances to enable secure communication on a global scale. Traditional quantum communication protocols consume pair-wise entanglement, which is sub-optimal for distributed…
In $(t, n)$-threshold secret sharing, a secret $S$ is distributed among $n$ participants such that any subset of size $t$ can recover $S$, while any subset of size $t-1$ or fewer learns nothing about it. For information-theoretic secret…
Continuous-variable quantum key distribution holds the potential to generate high secret key rates, making it a prime candidate for high-rate metropolitan quantum network applications. However, despite these promising opportunities, the…
A general inner bound is given for the discrete memoryless broadcast channel with an arbitrary number of users and general message sets, a setting that accounts for the most general form of concurrent groupcasting, with messages intended…
We consider the problem of secure key distribution among $n$ trustful agents: the goal is to distribute an identical random bit-string among the $n$ agents over a noisy channel such that eavesdroppers learn little about it. We study the…
Using quantum key distribution (QKD) protocols, a secret key is created between two distant users (transmitter and receiver) at a particular key rate. Quantum technology can facilitate secure communication for cryptographic applications,…
Quantum key distribution (QKD) enables secure communication by harnessing the fundamental principles of quantum physics, which inherently guarantee information-theoretic security and intrinsic resistance to quantum computing attacks.…
In quantum key distribution implementations, each session is typically chosen long enough so that the secret key rate approaches its asymptotic limit. However, this choice may be constrained by the physical scenario, as in the perspective…