Universally composable quantum multi-party computation

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

Volumn 6110 LNCS, Issue , 2010, Pages 486-505

  Unruh, Dominique ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPOSITIONALITY; MULTIPARTY COMPUTATION; OBLIVIOUS TRANSFER PROTOCOLS; SECURE COMPOSITION; SECURE PROTOCOLS; SECURITY DEFINITIONS; UNIVERSAL COMPOSABILITY; UNIVERSALLY COMPOSABLE;

NETWORK SECURITY; QUANTUM CRYPTOGRAPHY;

NETWORK PROTOCOLS;

EID: 77954644441     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13190-5_25     Document Type: Conference Paper

References (26)

1. Ben-Or, M., Crépeau, C., Gottesman, D., Hassidim, A., Smith, A.: Secure multi-party quantum computation with (only) a strict honest majority. In: FOCS 2006, pp. 249-260. IEEE Computer Society, Los Alamitos (2006)
2. Ben-Or, M., Horodecki, M., Leung, D.W., Mayers, D., Oppenheim, J.: The universal composable security of quantum key distribution. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 386-406. Springer, Heidelberg (2005); Preprint at arXiv:quant-ph/0409078v1
3. Ben-Or, M., Mayers, D.: General security definition and composability for quantum & classical protocols. arXiv:quant-ph/0409062v2 (September 2004)
4. Bennett, C.H., Brassard, G.: Quantum cryptography: Public-key distribution and coin tossing. In: IEEE International Conference on Computers, Systems and Signal Processing 1984, pp. 175-179. IEEE Computer Society, Los Alamitos (1984)
5. Bennett, C.H., Brassard, G., Crépeau, C., Skubiszewska, M.-H.: Practical quantum oblivious transfer. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 351-366. Springer, Heidelberg (1992)
6. Brassard, G., Crépeau, C., Jozsa, R., Langlois, D.: A quantum bit commitment scheme provably unbreakable by both parties. In: FOCS 1993, Los Alamitos, CA, USA, pp. 362-371. IEEE Computer Society, Los Alamitos (1993)
7. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS 2001, pp. 136-145. IEEE Computer Society, Los Alamitos (2001); Full and revised version is IACR ePrint 2000/067
8. Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19-40. Springer, Heidelberg (2001); Full version is IACR ePrint 2001/055
9. Damgård, I., Fehr, S., Lunemann, C., Salvail, L., Schaffner, C.: Improving the security of quantum protocols. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 408-427. Springer, Heidelberg (2009)
10. Damgård, I., Fehr, S., Salvail, L., Schaffner, C.: Cryptography in the bounded quantum-storage model. In: FOCS 2005, pp. 449-458 (2005); Full version is arXiv:quant-ph/0508222v2
11. 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)
12. Hofheinz, D., Müller-Quade, J.: A paradox of quantum universal composability. In: 4th European QIPC Workshop, poster (2003), http://www.quiprocone.org/Hot%20Topics%20posters/muellerquade-poster.pdf
13. Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer - efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572-591. Springer, Heidelberg (2008)
14. Kent, A.: Unconditionally secure bit commitment. PRL 83(7), 1447-1450 (1999)
15. Kilian, J.: Founding cryptography on oblivious transfer. In: STOC 1988, pp. 20-31. ACM Press, New York (1988)
16. Mayers, D.: Unconditionally Secure Quantum Bit Commitment is Impossible. Physical Review Letters 78(17), 3414-3417 (1997); Preprint at arXiv:quantph/9605044v2
17. Müller-Quade, J., Unruh, D.: Long-term security and universal composability. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 41-60. Springer, Heidelberg (2007)
18. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
19. Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: 22nd IEEE Symposium on Security & Privacy, pp. 184-200 (2001) (Pubitemid 32882636)
20. Unruh, D.: Simulatable security for quantum protocols (September 2004), arXiv:quant-ph/0409125v2
21. Unruh, D.: Universally composable quantum multi-party computation (October 2009), arXiv:0910.2912 [quant-ph], Full version of this paper
22. van de Graaf, J.: Towards a formal definition of security for quantum protocols. PhD thesis, Départment d'informatique et de r.o., Université de Montréal (1998), http://www.cs.mcgill.ca/~crepeau/ PS/these-jeroen.ps
23. Watrous, J.: Zero-knowledge against quantum attacks. In: STOC 2006, pp. 296-305. ACM, New York (2006)
24. Wehner, S.,Wullschleger, J.: Composable security in the bounded-quantum-storage model. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 604-615. Springer, Heidelberg (2008); Full version is arXiv:0709.0492v1 [quant-ph]
25. Wiesner, S.: Conjugate coding. SIGACT News 15(1), 78-88 (1983) (manuscript written ca. 1970)
26. Yao, A.C.-C.: Security of quantum protocols against coherent measurements. In: STOC 1995, pp. 67-75. ACM, New York (1995)