QUANTUM COMMUNICATION BETWEEN ANONYMOUS SENDER AND ANONYMOUS RECEIVER IN THE PRESENCE OF STRONG ADVERSARY
| Autor: | Jan Bouda, Josef Sprojcar |
|---|---|
| Rok vydání: | 2011 |
| Předmět: |
Dining cryptographers problem
Physics and Astronomy (miscellaneous) Computer science business.industry 020206 networking & telecommunications Denial-of-service attack Cryptography 0102 computer and information sciences 02 engineering and technology Computer security computer.software_genre 01 natural sciences Information-theoretic security 010201 computation theory & mathematics Universal composability 0202 electrical engineering electronic engineering information engineering Communication source Quantum information business Quantum information science computer |
| Zdroj: | International Journal of Quantum Information. :651-663 |
| ISSN: | 1793-6918 0219-7499 |
| DOI: | 10.1142/s0219749911007691 |
| Popis: | While many scenarios of anonymous communication can be solved by various famous classical techniques including mix nets or dining cryptographers (DC), an abundant amount of anonymous tasks remains open. In this paper, we present a solution to one such task. Our protocol serves as a private communication channel for quantum messages while ensuring that both the sender and the receiver stay anonymous in a set of all parties. Our protocol is a continuation of our previous work on anonymous transmission of quantum information. The protocol does not require trusted parties, and is secure against an active adversary. It can also withstand denial of service attacks. The protocol exhibits an advantage of quantum resources over classical because no classical solution is known (in the same security settings). Entanglement swapping technique is used to create "symmetry" in the protocol, which makes it very transparent and easier to analyze. The security analysis we present is heavily based on our previous work on quantum anonymous communication. The task we implement is also a nice illustration of a cryptographic task where two parties in a multi-party protocol can be dishonest at the same time, but are not cooperating. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|