Asynchronous multiparty computation: Theory and implementation

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

Volumn 5443, Issue , 2009, Pages 160-179

  Damgård, Ivan ^a   Geisler, Martin ^a   Kroigaard M ^a   Nielsen, Jesper Buus ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; PUBLIC KEY CRYPTOGRAPHY;

ASYNCHRONOUS PROTOCOLS; AUTOMATIC PARALLELIZATION; COMMUNICATION COMPLEXITY; MULTIPARTY COMPUTATION; PREPROCESSING PHASE; PRIMITIVE OPERATIONS; SECURE COMPUTATION; SOFTWARE FRAMEWORKS;

CHROMIUM COMPOUNDS;

EID: 67049134126     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00468-1_10     Document Type: Conference Paper

References (14)

1. Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA. ACM (1988)
2. Beerliova-Trubmiova, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 213-230. Springer, Heidelberg (2008)
3. Beerliova-Trubmiova, Z., Hirt, M., Nielsen, J.B.: Almost-asynchronous multi-party computation with faulty minority (manuscript, 2008)
4. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non- cryptographic fault-tolerant distributed computation. In: STOC [1], pp. 1-10
5. Bogetoft, P., Christensen, D.L., Damgard, I., Geisler, M., Jakobsen, T., Kr0igaard, M., Nielsen, J.D., Nielsen, J.B., Nielsen, K., Pagter, J., Schwartzbach, M., Toft, T.: Multiparty computation goes live. Cryptology ePrint Archive, Report 2008/068 (2008), http://eprint.iacr.org/
6. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, pp. 136-145. IEEE, Los Alamitos (2001)
7. Chaum, D., Crepeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: STOC [1], pp. 11-19 (1988)
8. Cramer, R., Damgard, I.B., Ishai, Y.: Share conversion, pseudorandom secret- sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 342-362. Springer, Heidelberg (2005)
9. Cramer, R., Damgard, I.B., Ishai, Y.: Share conversion, pseudorandom secret- sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 342-362. Springer, Heidelberg (2005)
10. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game - a completeness theorem for protocols with honest majority. In: STOC, pp. 218-229. ACM, New York (1987)
11. Hirt, M., Maurer, U.M.: Robustness for free in unconditional multi-party computation. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 101-118. Springer, Heidelberg (2001)
12. Hirt, M., Nielsen, J.B., Przydatek, B.: Asynchronous multi-party computation with quadratic communication. In: Aceto, L., Damgard, I., Goldberg, L.A., Halldorsson, M.M., Ingolfsdottir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 473-485. Springer, Heidelberg (2008)
13. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223-238. Springer, Heidelberg (1999)
14. Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612-613 1979)