Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0710.2487 · Quantum Information Processing

Quantum Shared Broadcasting

Vittorio Giovannetti, Alexander Semenovich Holevo

Published Apr 4, 2008• 8 citations
arXivHTMLPDF
DOI
10.1007/s11128-008-0073-x

Related papers

Secret Sharing Over a Two Receiver Classical-Quantum Broadcast Channel

Truman Welling, Rémi A. Chou, Aylin Yener

This work considers a secret sharing problem where the dealer uses a classical-quantum channel to divide and distribute shares to two users by encoding the secret so that the channel observation of each user is their share. The channel observations of a single user contains very little information about the secret, but the two users together can recover the secret. We derive a one-shot and an asymptotic achievability result for secret sharing over a quantum broadcast channel. Additionally, our achievability results coincide with the secret sharing capacity for the classical broadcast channel.

IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•1 citation

Quantum Secret Sharing

Ri‐Gui Zhou, Xiaoxue Zhang, Lin-Tao Du

Springer eBooks•Jan 1, 2024•3 citations

Quantum broadcast communication

Jian Wang, Quan Zhang, Chaojing Tang

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 take account of a simple broadcast communication task in quantum scenario, in which the central party broadcasts his secret to multi-receiver via quantum channel. We present three quantum broadcast communication schemes. The first scheme utilizes entanglement swapping and Greenberger–Horne–Zeilinger state to fulfil a task that the central party broadcasts the secret to a group of receivers who share a group key with him. In the second scheme, based on dense coding, the central party broadcasts the secret to multi-receiver, each of which shares an authentication key with him. The third scheme is a quantum broadcast communication scheme with quantum encryption, in which the central party can broadcast the secret to any subset of the legal receivers.

arXiv:quant-ph/0604179•Chinese Physics•Jul 1, 2007•19 citations

Quantum State Sharing

Timothy C. Ralph, Thomas Symul, Ping Koy Lam +3 more

Optical science and engineering•Nov 14, 2005•0 citations

Quantum secret sharing

김상겸

•Jan 1, 2000•0 citations

Secret Sharing with Monotone Access Structures over Classical-Quantum Broadcast Channels

Truman Welling, Rémi A. Chou, Aylin Yener

We consider a secret sharing setting with a monotone access structure involving a control node and L users, connected via a classical–quantum broadcast channel whose input is controlled by the control node, referred to as the dealer. Unlike traditional secret sharing settings, where the dealer fully controls the shares given to each user, in our model, the dealer encodes the secret for transmission over the broadcast channel. This means that the shares received by users are perturbed by the channel and are not fully controlled by the dealer. Our main results are achievable one-shot secret sharing rates, as well as converse bounds for arbitrary monotone access structures. We further derive second-order and asymptotic achievable rates for arbitrary monotone access structures.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2026•0 citations
This work considers a secret sharing problem where the dealer uses a classical-quantum channel to divide and distribute shares to two users by encoding the secret so that the channel observation of each user is their share. The channel observations of a single user contains very little information about the secret, but the two users together can recover the secret. We derive a one-shot and an asymptotic achievability result for secret sharing over a quantum broadcast channel. Additionally, our achievability results coincide with the secret sharing capacity for the classical broadcast channel.
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 take account of a simple broadcast communication task in quantum scenario, in which the central party broadcasts his secret to multi-receiver via quantum channel. We present three quantum broadcast communication schemes. The first scheme utilizes entanglement swapping and Greenberger–Horne–Zeilinger state to fulfil a task that the central party broadcasts the secret to a group of receivers who share a group key with him. In the second scheme, based on dense coding, the central party broadcasts the secret to multi-receiver, each of which shares an authentication key with him. The third scheme is a quantum broadcast communication scheme with quantum encryption, in which the central party can broadcast the secret to any subset of the legal receivers.
We consider a secret sharing setting with a monotone access structure involving a control node and L users, connected via a classical–quantum broadcast channel whose input is controlled by the control node, referred to as the dealer. Unlike traditional secret sharing settings, where the dealer fully controls the shares given to each user, in our model, the dealer encodes the secret for transmission over the broadcast channel. This means that the shares received by users are perturbed by the channel and are not fully controlled by the dealer. Our main results are achievable one-shot secret sharing rates, as well as converse bounds for arbitrary monotone access structures. We further derive second-order and asymptotic achievable rates for arbitrary monotone access structures.