On the power of two-party quantum cryptography

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5912 LNCS, Issue , 2009, Pages 70-87

  Salvail, Louis ^a   Schaffner, Christian ^b   Sotáková, Miroslava ^c  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b CWI   (Netherlands)

^c STONY BROOK UNIVERSITY   (United States)

Author keywords

Oblivious transfer; Quantum information theory; Quantum protocols; Two party primitives

Indexed keywords

IMPOSSIBILITY RESULTS; LOWER BOUNDS; NON-TRIVIAL; OBLIVIOUS TRANSFER; POWER-OF-TWO; QUANTUM INFORMATION THEORY; QUANTUM PROTOCOLS; TRUSTED THIRD PARTIES;

CONTROL THEORY; NETWORK SECURITY; QUANTUM CRYPTOGRAPHY; QUANTUM OPTICS;

INFORMATION THEORY;

EID: 72449167006     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10366-7_5     Document Type: Conference Paper

References (38)

1. Ambainis, A.: personal communication (2005)
2. Ariano, G.M.D., Kretschmann, D., Schlingemann, D., Werner, R.F.: Reexamination of quantum bit commitment: The possible and the impossible. Physical Review A (Atomic, Molecular, and Optical Physics) 76(3), 032328 (2007)
3. Barrett, J., Linden, N., Massar, S., Pironio, S., Popescu, S., Roberts, D.: Nonlocal correlations as an information-theoretic resource. Physical Review A 71, 022101 (2005)
4. Bennett, C.H., Brassard, G.: Quantum cryptography: Public key distribution and coin tossing. In: Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, pp. 175-179 (1984)
5. Berta, M.: Single-shot quantum state merging. Master's thesis, ETH Zurich (2008)
6. Buhrman, H., Christandl, M., Hayden, P., Lo, H.-K.,Wehner, S.: Possibility, impossibility and cheat-sensitivity of quantum bit string commitments. Physical Review A 78, 022316 (2008)
7. Buhrman, H., Christandl, M., Schaffner, C.: Impossibility of two-party secure function evaluation (in preparation, 2009)
8. Chailloux, A., Kerenidis, I.: Optimal quantum strong coin flipping (2009), http://arxiv.org/abs/0904.1511
9. Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy. SIAM J. Discrete Math. 4(1), 36-47 (1991)
10. Colbeck, R.: The impossibility of secure two-party classical computation (August 2007), http://arxiv.org/abs/0708.2843
11. Damgård, I.B., Fehr, S., Salvail, L., Schaffner, C.: Secure identification and QKD in the bounded-quantum-storage model. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 342-359. Springer, Heidelberg (2007)
12. Fehr, S., Schaffner, C.: Composing quantum protocols in a classical environment. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 350-367. Springer, Heidelberg (2009)
13. Fitzi, M., Wolf, S., Wullschleger, J.: Pseudo-signatures, broadcast, and multi-party computation from correlated randomness. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 562-579. Springer, Heidelberg (2004)
14. Holevo, A.S.: Information-theoretical aspects of quantum measurement. Problemy Peredači Informacii 9(2), 31-42 (1973)
15. Imai, H., Müller-Quade, J., Nascimento, A., Winter, A.: Rates for bit commitment and coin tossing from noisy correlation. In: Proceedings of 2004 IEEE International Symposium on Information Theory, p. 47 (June 2004)
16. Jozsa, R., Schlienz, J.: Distinguishability of states and von neumann entropy. Phys. Rev. A 62(1), 012301 (2000)
17. Kent, A.: Promising the impossible: Classical certification in a quantum world (2004), http://arxiv.org/abs/quant-ph/0409029
18. Kitaev, A.: Quantum coin-flipping. presented at QIP 2003. A review of this technique can be found in (2003), http://lightlike.com/~carlosm/publ
19. Klauck, H.: On quantum and approximate privacy. Theory of Computing Systems 37(1), 221-246 (2004); http://arxiv.org/abs/quant-ph/0110038, also in the Proceedings of STACS (2002)
20. Künzler, R., Müller-Quade, J., Raub, D.: Secure computability of functions in the it setting with dishonest majority and applications to long-term security. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 238-255. Springer, Heidelberg (2009)
21. Kushilevitz, E.: Privacy and communication complexity. SIAM J. Discrete Math. 5(2), 273-284 (1992)
22. Lo, H.-K.: Insecurity of quantum secure computations. Physical Review A 56(2), 1154-1162 (1997)
23. Lo, H.-K., Chau, H.F.: Is quantum bit commitment really possible? Physical Review Letters 78(17), 3410-3413 (1997)
24. Mayers, D.: Unconditionally secure quantum bit commitment is impossible. Physical Review Letters 78(17), 3414-3417 (1997)
25. Mochon, C.: Quantum weak coin-flipping with bias of 0.192. In: 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 2-11 (2004)
26. Mochon, C.: A large family of quantum weak coin-flipping protocols. Phys. Rev. A 72, 022341 (2005)
27. Mochon, C.: Quantum weak coin flipping with arbitrarily small bias (2007), http://arxiv.org/abs/0711.4114
28. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
29. Popescu, S., Rohrlich, D.: Quantum nonlocality as an axiom. Foundations of Physics 24(3), 379-385 (1994)
30. Renner, R., Wolf, S.: Simple and tight bounds for information reconciliation and privacy amplification. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 199-216. Springer, Heidelberg (2005)
31. Renner, R., Wolf, S., Wullschleger, J.: The single-serving channel capacity. In: Proceedings of the International Symposium on Information Theory (ISIT). IEEE, Los Alamitos (July 2006), http://arxiv.org/abs/cs.IT/0608018
32. Ruskai, M.B.: Inequalities for quantum entropy: A review with conditions for equality. Journal of Mathematical Physics 43(9), 4358-4375 (2002)
33. Salvail, L., Sotáková, M., Schaffner, C.: On the power of two-party quantum cryptography (2009), http://arxiv.org/abs/0902.4036
34. Spekkens, R.W., Rudolph, T.: Degrees of concealment and bindingness in quantum bit commitment protocols. Phys. Rev. A 65(1), 012310 (2001)
35. Winter, A., Renner, R.: Single-shot state merging (2007) (unpublished note)
36. Wolf, S., Wullschleger, J.: Zero-error information and applications in cryptography. In: IEEE Information Theory Workshop (ITW), San Antonio, Texas (October 2004)
37. Wolf, S., Wullschleger, J.: New monotones and lower bounds in unconditional twoparty computation. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 467-477. Springer, Heidelberg (2005)
38. Wolf, S., Wullschleger, J.: Oblivious transfer and quantum non-locality. In: International Symposium on Information Theory (ISIT 2005), pp. 1745-1748 (2005)