Barnum, C., Gottesman, D., Smith, A. et al.: Authentication of Quantum Messages. In: Proceedings of 43rd Annual IEEE Symposium on the Foundations of Computer Science, Vancouver, Canada (2002) 449-- 458. 5  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Small Pseudo-Random Families of Matrices: - Derandomizing Approximate Quantum (2004) Self-citation (Smith) (Correct)
No context found.
Howard Barnum, Claude Crepeau, Daniel Gottesman, Adam Smith, Alain Tapp. Authentication of Quantum Messages. FOCS 2002: 449-458.
Approximate Quantum Error-Correcting Codes - Crepeau, Gottesman, Smith (1 citation) Self-citation (Crepeau Gottesman Smith) (Correct)
.... that the concatenated verification protocol rejects if any of the tensor components rejects (i.e. the concatenated verdict qubit is the AND of the individual verdict qubits, identifying with TRUE and with FALSE) Quantum authentication protocols satisfying definition 2 were constructed in [3]. We do not know if the above composibility property follows in general from definition 2, but the protocols constructed in [3] certainly do. This follows because they are constructed from stabilizer purity testing codes (PTCs) which clearly statisfy a corresponding property (if Q k is a ....
.... is the AND of the individual verdict qubits, identifying with TRUE and with FALSE) Quantum authentication protocols satisfying definition 2 were constructed in [3] We do not know if the above composibility property follows in general from definition 2, but the protocols constructed in [3] certainly do. This follows because they are constructed from stabilizer purity testing codes (PTCs) which clearly statisfy a corresponding property (if Q k is a stabilizer PTC with error #, then Q k i is a stabilizer PTC with error n#) 3 Definition of approximate QECC (AQECC) At an ....
[Article contains additional citation context not shown here]
H. Barnum, C. Crepeau, D. Gottesman, A. Tapp, and A. Smith. Authentication of quantum messages. In proceedings of The 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'02), November 16 - 19, 2002.
Detectable Byzantine Agreement Secure Against Faulty.. - Fitzi, Gottesman.. (2002) Self-citation (Gottesman Smith) (Correct)
....on top of this model by using a quantum key distribution protocol (e.g. BennettBrassard [3] This requires adding two rounds at the beginning of the protocol. For noiseless quantum channels, agreeing on a key of bits requires sending O(k log ) qubits and O(k log ) classical bits [1]. Note that the key distribution protocol may fail if the adversary intervenes, but in such a case the concerned players can set their grades to 0 in the later agreement protocol and all honest players will abort. All in all, this yields protocols with similar complexity to those of the previous ....
....is required only in the very rst round of the computation, during which (possibly corrupted) EPR pairs are exchanged. Any further quantum transmissions can be done using quantum teleportation. Authentication of the initial EPR transmissions can be done with the protocols of Barnum et al. [1]. Theorem 4. There is a protocol which achieves detectable precomputation for b future broadcasts among n players for model Mq tolerating any number t n of corrupted players. The protocol requires t 5 rounds and O(k0n 5 b0) bits (qubits) of communication, where k0 = k log(b0n) and b0 = b ....
H. Barnum, C. Crepeau, D. Gottesman, A. Smith, and A. Tapp. Authentication of quantum messages. Manuscript, 2001.
Secure Direct Communication Using Quantum.. - Lu, Ma, Feng (2004) (Correct)
No context found.
Barnum, C., Gottesman, D., Smith, A. et al.: Authentication of Quantum Messages. In: Proceedings of 43rd Annual IEEE Symposium on the Foundations of Computer Science, Vancouver, Canada (2002) 449-- 458. 5
Multi-party Quantum Computation - Smith (2001) (Correct)
No context found.
Howard Barnum, Claude Crepeau, Daniel Gottesman, Alain Tapp, and Adam Smith. Authentication of quantum messages. Manuscript, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC