Approximate quantum error-correcting codes and secret sharing schemes

Lecture Notes in Computer Science

Volumn 3494, Issue , 2005, Pages 285-301

  Crépeau, Claude ^a   Gottesman, Daniel ^b   Smith, Adam ^c  

^a MCGILL UNIVERSITY   (Canada)

^b PERIMETER INSTITUTE FOR THEORETICAL PHYSICS   (Canada)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; ERROR CORRECTION; INFORMATION RETRIEVAL; MATHEMATICAL MODELS; NETWORK PROTOCOLS; QUANTUM CRYPTOGRAPHY; SECURITY OF DATA;

ERROR-CORRECTING CODES; QUANTUM MODELS; SECRET SHARING SCHEMES; VERIFIABLE QUANTUM SECRET SHARING (VQSS);

CODES (SYMBOLS);

EID: 24944469931     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11426639_17     Document Type: Conference Paper

References (25)

1. D. Aharonov and M. Ben-Or. Fault tolerant quantum computation with constant error rate. Preliminary version in Proc. 29th ACM Symp. on Theory of Computing, 1997. Submitted to SIAM J. Comp., June 1999.
2. H. Barnum, C. Crépeau, 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 Vancouver, BC, Canada, pages 449-458.
3. Also Quantum Physics, abstract quant-ph/0205128, 22 pages, May 2002.
4. H. Barnum, E. Knill and M. A. Nielsen, "On Quantum Fidelities and Channel Capacities," quant-ph/980901, IEEE Trans.Info.Theor. 46 (2000) 1317-1329.
5. C.H. Bennett, G. Brassard, S. Popescu, B. Schumacher, J.A. Smolin, and W. K. Wootters, "Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels.", Phys. Rev. Lett. 76 (1996) 722-725, Quantum Physics, abstract quant-ph/9511027.
6. S. Cabello, C. Padró, G. Saéz. Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. Designs, Codes and Cryptography, 25(2): 175-188 (2002).
7. Richard Cleve, Daniel Gottesman, Hoi-Kwong Lo. How to share a quantum secret. Phys.Rev.Lett. 83, p. 648-651, 1999.
8. R. Cramer, I. Damgård, S. Dziembowski, M. Hirt and T. Rabin. Efficient Multiparty Computations Secure Against an Adaptive Adversary In Advances in Cryptology - EUROCRYPT 1999.
9. R. Cramer, I. Damgård, S. Fehr. On the Cost of Reconstructing a Secret. In Advances in Cryptology - CRYPTO 2001.
10. C. Crépeau, D. Gottesman, and A. Smith. Secure multi-party quantum computation. In Proceedings of 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada. ACM, 2002, pages 643-652.
11. P. Gemmell and M. Naor. Codes for interactive authentication. In D. R. Stinson, editor, CRYPTO, volume 773 of Lecture Notes in Computer Science, pages 355-367. Springer, 1994.
12. D. Gottesman, "An Introduction to Quantum Error Correction.", Quantum Physics, abstract quant-ph/0004072, 15 pages, talk given at AMS Short Course on Quantum Computation.
13. P. Hayden, D. Leung, D. Mayers. Universally composable quantum authentication. In preparation.
14. P. Hayden, D. Leung, A. Winter and P. Shor. Randomizing quantum states: Constructions and applications. Commun. Math. Phys. 250(2): 371-391, 2004.
15. Hoi-Kwong Lo and H. F. Chau. Unconditional security of quantum key distribution over arbitrarily long distances. Science, 283(5410) :2050 -2056, 26 March 1999.
16. D. W. Leung, M. A. Nielsen, I. L. Chuang, and Y. Yamamoto. Approximate quantum error correction can lead to better codes. Phys.Rev. A56 (1997) 2567-2573, quant-ph/9704002.
17. R. J. McEliece and D. Sarwate. On sharing secrets and Reed-Solomon codes. Comm. ACM24, 1981, 583-584.
18. M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
19. J. Oppenheim and M. Horodecki. How to reuse a one-time pad and other notes on authentication, encryption and protection of quantum information. E-print quant-ph/0306161.
20. T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In Proc. of STOC 1989, p. 73-85.
21. A. Shamir. How to share a secret. Communications of the ACM, 22:612-613, 1979.
22. B. Schumacher, M. D. Westmorland Approximate quantum error correction. E-print quant-ph/0112106, 2001.
23. A. Smith. Quantum secret sharing for general access structures. E-print quant-ph/0001087, 2000.
24. K. Srinathan, Arvind Narayanan and C. Pandu Rangan: Optimal Perfectly Secure Message Transmission. Advances in Cryptology - CRYPTO 2004.
25. W.K. Wootters and W.H. Zurek, "A single quantum cannot be cloned", Nature 299, 802, 1982.