Universally composable multiparty computation with partially isolated parties

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

Volumn 5444 LNCS, Issue , 2009, Pages 315-331

  Damgård, Ivan ^a   Nielsen, Jesper Buus ^a   Wichs, Daniel ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Multiparty computation; Public key infrastructure; Universally composable security

Indexed keywords

ADAPTIVE ADVERSARY; ARBITRARY NUMBER; COMMON REFERENCE STRING; CRYPTOGRAPHIC ASSUMPTIONS; HIGH BANDWIDTH COMMUNICATION; MULTIPARTY COMPUTATION; PHYSICAL ASSUMPTIONS; PUBLIC-KEY INFRASTRUCTURE; TAMPERPROOF; THE STANDARD MODEL; TRUSTED THIRD PARTIES; UNIVERSALLY COMPOSABLE; UNIVERSALLY COMPOSABLE SECURITY;

PUBLIC KEY CRYPTOGRAPHY;

TELECOMMUNICATION SYSTEMS;

EID: 70350625407     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00457-5_19     Document Type: Conference Paper

References (13)

1. Barr, K., Asanovic, K.: Energy aware lossless data compression. In: The International Conference on Mobile Systems - MobiSys, San Francisco, CA, USA, pp. 231-244. ACM Press, New York (2003)
2. Barak, B., Canetti, R., Nielsen, J.B., Pass, R.: Universally composable protocols with relaxed set-up assumptions. In: 45th Annual Symposium on Foundations of Computer Science, Rome, Italy, pp. 186-195. IEEE, Los Alamitos (2004)
3. Barak, B., Goldreich, O., Goldwasser, S., Lindell, Y.: Resettably-Sound Zero-Knowledge and its Applications. In: 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, Nevada, pp. 14-17. IEEE, Los Alamitos (2001)
4. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive 2000/067
5. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, Nevada, pp. 136-145. IEEE, Los Alamitos (2001); Full version in [Can]
6. Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally Composable Security with Global Setup. Cryptology ePrint Archive 2006/042; Published Version in [CDPW07]
7. Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally Composable Security with Global Setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 61-85. Springer, Heidelberg (2007)
8. Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 68-86. Springer, Heidelberg (2003)
9. Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on the Theory of Computing, Montreal, Quebec, Canada, pp. 494-503 (2002)
10. Chandran, N., Goyal, V., Sahai, A.: New Constructions for UC Secure Computation using Tamper-proof Hardware. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 545-562. Springer, Heidelberg (2008)
11. Damgård, I., Nielsen, J.B., Wich, D.: Isolated Proofs of Knowledge and Isolated Zero Knowledge. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 509-526. Springer, Heidelberg (2008); Full version in Cryptology ePrint Archive 2007/331
12. Katz, J.: Universally composable multi-party computation using tamper-proof hardware. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 115-128. Springer, Heidelberg (2007)
13. Moran, T., Segev, G.: David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 527-544. Springer, Heidelberg (2008)