Generalized quantum secret sharing

Physical Review A - Atomic, Molecular, and Optical Physics

Volumn 71, Issue 1, 2005, Pages

  Singh, Sudhir Kumar ^a   Srikanth, R ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b RAMAN RESEARCH INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL INFORMATION PROCESSING; CLASSICAL SHARES; CLASSICAL THRESHOLD SCHEME (CTS); QUANTUM SECRET SHARING (QSS);

CORRELATION METHODS; CRYPTOGRAPHY; DATA ACQUISITION; MATHEMATICAL TRANSFORMATIONS; RANDOM PROCESSES; SET THEORY;

QUANTUM THEORY;

EID: 18444362130     PISSN: 10502947     EISSN: 10941622     Source Type: Journal    
DOI: 10.1103/PhysRevA.71.012328     Document Type: Article

References (27)

1. B. Schneier, Applied Cryptography (Wiley, New York, 1996), p. 70.
2. J. Gruska, Foundations of Computing (Thomson Computer Press, London, 1997), p. 504.
3. G. Blakely, in Proc. National Comp. Conf., New York, New York, June 4-7, 1979 (AFIPS Press, Arlington, VA, 1979), Vol. 48, p. 313.
4. A. Shamir, Commun. ACM 22, 612 (1979).
5. J. Benaloh and J. Leichter, Lect. Notes Comput. Sci. 403, 27 (1990).
6. M. Hillery, V. Bužek, and A. Berthiaume, Phys. Rev. A 59, 1829 (1999).
7. A. Karlsson, M. Koashi, and N. Imoto, Phys. Rev. A 59, 162 (1999).
8. R. Cleve, D. Gottesman, and H.-K. Lo, Phys. Rev. Lett. 83, 648 (1999).
9. W. K. Wooters and W. H. Zurek, Nature (London) 299, 802 (1982).
10. H. Imai, J. Mueller-Quade, A. C. A. Nascimento, P. Tuyls, and A. Winter, e-print quant-ph/0311136.
11. S. Calderbank and P. Shor, Phys. Rev. A 54, 1098 (1996).
12. M. Grassl, T. Beth, and T. Pellizzari, Phys. Rev. A 56, 33 (1997).
13. D. Gottesman, e-print quant-ph/9910067.
14. A. Smith, e-print quant-ph/0001087.
15. S. Wiesner, SIGACT News 15, 78 (1983).
16. C. Crépeau, D. Gottesman, and A. Smith, in Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, 2002 (unpublished).
17. A. M. Lance, T. Symul, W. P. Bowen, T. Tyc, B. C. Sanders, and P. K. Lam New J. Phys. 5, 4.1 (2003).
18. A. M. Lance, T. Symul, W. P. Bowen, B. C. Sanders, and P. K. Lam, Phys. Rev. Lett. 92, 177903 (2004).
19. A. C. A. Nascimento, J. Mueller-Quade, and H. Imai, Phys. Rev. A 64, 042311 (2001).
20. A. Herzberg, S. Jarecki, H. Krawszyk, and M. Yung, Lect. Notes Comput. Sci. 963, 339 (1996).
21. A. Beltelspacher, Lecture Notes in Computer Science (Springer-Verlag, Berlin, 1990), pp. 491-496.
22. K. M. Martin, in Cryptography and Coding III, edited by M. J. Gandley (Clarendon Press, Oxford, 1993), pp. 255-264.
23. M. Mosca, A. Tapp, and R. de Wolf, e-print quant-ph/0003101.
24. P. Hayden, D. Leung, P. W. Shor, and A. Winter, e-print quant-ph/0307104.
25. R. M. Karp, Complexity of Computer Computations, in Pro-cedings of the Symposium at IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1972 (Plenum, New York, 1972), pp. 85-103.
26. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP Completeness (W. H. Freeman and Company, San Francisco, 1979).
27. M. Ziman, P. Štelmachovič, V. Bužek, M. Hillery, V. Scarani, and N. Gisin, Phys. Rev. A 65, 042105 (2002).