Quantum entanglement, non-locality and secure computation

First International Conference on Quantum, Nano, and Micro Technologies, ICQNM 2007

Volumn , Issue , 2007, Pages 15-20

  Chou, Yao Hsin ^a,b   Tsait, I Ming ^b   Fahn, Chin Shyurng ^a   Horng, Shi Jinn ^a   Kuo, Sy Yen ^a,b  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL EFFICIENCY; NETWORK SECURITY; QUANTUM COMPUTERS;

COMPUTATION ALGORITHMS; MATHEMATIC CONJECTURE; NON-LOCAL MACHINES; QUANTUM ENTANGLEMENT;

QUANTUM CRYPTOGRAPHY;

EID: 34547201577     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICQNM.2007.17     Document Type: Conference Paper

References (15)

1. Bell, J. (1964). On the einstein-podolsky-rosen paradox. In Physics, volume 1, pages 195-200, Long Island City, NY.
2. Bennett, C. and Brassard, G. (1984). Quantum cryptography: Publickey distribution and coin tossing. In Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, pages 175-179, Bangalore, India.
3. Bennett, C., Brassard, G., Crepeau, C., Jozsa, R., Peres, A., and Wootters., W. (1993). Teleporting an unknown quantum state via dual classical and epr channels. In Physical Review Letters, volume 70, pages 1895-1899.
4. Chou, Y.-H., Tsai, L-M., and Kuo, S.-Y. (2006). Quantum entanglement and its applications on secure computation. In Proceedings of 6th IEEE Conference on Nanotechnology, Cincinnati, Ohio.
5. Clauser, J., Home, M., Shimony, A., and Holt, R. (1969). Proposed experiment to test local hidden-variable theories. In Physical Review Letters, volume 23, pages 880-884.
6. Even, S., Goldreich, O., and Lempel, A. (1985). A randomized protocol for signing contracts. In Communications of the ACM, volume 28.
7. Gertner, Y., Kannan, S., Malkin, T., Reingold, O., and Viswanathan, M. (2000). The relationship between public key encryption and oblivious transfer. In Proceedings of 41st Annual Symposium on Foundations of Computer Science, pages 325-335.
8. Goldreich, O., Micali, S., and Wigderson, A. (1987). How to play any mental game. In Proceedings of the nineteenth annual ACM conference on Theory of computing, pages 218-229, New York, New York.
9. Mayers, D. and Salvan, L. (1994). Quantum oblivious transfer is secure against all individual measurements. In PhysComp'94, Proceedings of Wortehop on Physics and Computation, pages 69-77.
10. Popescu, S. and Rohrlich, D. (1997). Open questions and possible solutions. In Proceedings of Causality and Locality in Modern Physics and Astronomy, A Symposium to Honor Jean-Pierre Vigier, Toronto.
11. Rabin, M. (1981). How to exchange secrets by oblivious transfer. Technical Memo TR-81, Aiken Computation Laboratory, Harvard University.
12. Shor, P (1994). Algorithms for quantum computation: Discrete logarithms and factoring. In Proceedings of 35nd Annual Symposium on Foundations of Computer Science, pages 124-134. IEEE Computer Society Press.
13. Wolf, S. (2000). Reducing oblivious string transfer to universal oblivious transfer. In Proceedings of International Symposium on Information Theory, page 465, Sorrento, Italy.
14. Wolf, S. and Wullschleger, J. (2005). Oblivious transfer and quantum non-locality. In ISIT'05, Proceedings of International Symposium on Information Theory, pages 1745-1748.
15. Yao, A. (1982). Protocols for secure computations. In Proceedings of Twenty-third IEEE Symposium on Foundations of Computer Science, pages 160-164, Chicago, Illinois.