Anonymous transmission in a noisy quantum network using the W state: Difference between revisions
Jump to navigation
Jump to search
(Created page with "<!-- This is a comment. You can erase them or write below --> <!-- Intro: brief description of the protocol --> <!--Tags: related pages or category --> The protocol allows a...") |
No edit summary |
||
| Line 8: | Line 8: | ||
==Assumptions== | ==Assumptions== | ||
<!-- It describes the setting in which the protocol will be successful. --> | <!-- It describes the setting in which the protocol will be successful. --> | ||
The protocol relies on a set of classical subroutines (collision detection, receiver notification, veto and logical OR). Their proposed implementation [[Anonymous transmission in a noisy quantum network using the W state#References|[1] ]] has been shown to be information-theoretically secure in the classical regime, even with an arbitrary number of corrupted participants, assuming the parties share pairwise authenticated private channels and a broadcast channel. | The protocol relies on a set of classical subroutines (collision detection, receiver notification, veto and logical OR). Their proposed implementation [[Anonymous transmission in a noisy quantum network using the W state#References|[1]]] has been shown to be information-theoretically secure in the classical regime, even with an arbitrary number of corrupted participants, assuming the parties share pairwise authenticated private channels and a broadcast channel. | ||
The protocol assumes that the implementations listed above remain secure even in the presence of a quantum adversary. | The protocol assumes that the implementations listed above remain secure even in the presence of a quantum adversary. | ||
| Line 32: | Line 32: | ||
==References== | ==References== | ||
# A. Broadbent and A. Tapp, inAdvances in Cryptology– ASIACRYPT 2007, edited by K. Kurosawa (Springer Berlin Heidelberg, Berlin, Heidelberg, 2007) pp. 410–426. | #A. Broadbent and A. Tapp, inAdvances in Cryptology– ASIACRYPT 2007, edited by K. Kurosawa (Springer Berlin Heidelberg, Berlin, Heidelberg, 2007) pp. 410–426. | ||
Revision as of 08:24, 12 November 2021
The protocol allows a sender to transmit an arbitrary quantum state to a receiver in an anonymous way and uses the -partite state as a quantum resource.
Assumptions
The protocol relies on a set of classical subroutines (collision detection, receiver notification, veto and logical OR). Their proposed implementation [1] has been shown to be information-theoretically secure in the classical regime, even with an arbitrary number of corrupted participants, assuming the parties share pairwise authenticated private channels and a broadcast channel.
The protocol assumes that the implementations listed above remain secure even in the presence of a quantum adversary.
Outline
Notation
Knowledge Graph
Properties
Protocol Description
Further Information
References
- A. Broadbent and A. Tapp, inAdvances in Cryptology– ASIACRYPT 2007, edited by K. Kurosawa (Springer Berlin Heidelberg, Berlin, Heidelberg, 2007) pp. 410–426.