The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Consistent, yet anonymous, Web access with LPWA
Communications of the ACM
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Authentication of Quantum Messages
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Information security and quantum mechanics: security of quantum protocols
Information security and quantum mechanics: security of quantum protocols
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Anonymous Transmission of Quantum Information
ICQNM '07 Proceedings of the First International Conference on Quantum, Nano, and Micro Technologies
Information-theoretic security without an honest majority
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Quantum anonymous transmissions
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Can quantum mechanics help distributed computing?
ACM SIGACT News
Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Novel quantum information solution to copy-protection and secured authentication
International Journal of Internet Technology and Secured Transactions
The quantum cryptographic switch
Quantum Information Processing
| Hi-index | 0.00 |
We present the first protocol for the anonymous transmission of a quantum state that is information-theoretically secure against an active adversary, without any assumption on the number of corrupt participants. The anonymity of the sender and receiver, as well as the privacy of the quantum state, are perfectly protected except with exponentially small probability. Even though a single corrupt participant can cause the protocol to abort, the quantum state can only be destroyed with exponentially small probability: if the protocol succeeds, the state is transferred to the receiver and otherwise it remains in the hands of the sender (provided the receiver is honest).