Scalable multiparty computation with nearly optimal work and resilience

Ivan Damgard; Y. Ishai; M. Kroigaard; J.B. Nielsen; A. Smith

doi:10.1007/978-3-540-85174-5_14

Scalable multiparty computation with nearly optimal work and resilience

Ivan Damgard, Y. Ishai, M. Kroigaard, J.B. Nielsen, A. Smith

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

82 Citations (Scopus)

1 Downloads (Pure)

Abstract

We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmically with n (ignoring an additive term that depends on n but not on the complexity of f). Moreover, the protocol is also nearly optimal in terms of resilience, providing computational security against an active, adaptive adversary corrupting a (1/2¿-¿e) fraction of the players, for an arbitrary e>¿0.

Original language	English
Title of host publication	Proceedings of the 28th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO 2008), 17-21 August 2008, Santa Barbara CA, USA
Editors	D. Wagner
Place of Publication	Berlin
Publisher	Springer
Pages	241-261
ISBN (Print)	978-3-540-85173-8
DOIs	https://doi.org/10.1007/978-3-540-85174-5_14
Publication status	Published - 2008

Publication series

Name	Lecture Notes in Computer Science
Volume	5157
ISSN (Print)	0302-9743

Access to Document

10.1007/978-3-540-85174-5_14

Cite this

Damgard, I., Ishai, Y., Kroigaard, M., Nielsen, J. B., & Smith, A. (2008). Scalable multiparty computation with nearly optimal work and resilience. In D. Wagner (Ed.), Proceedings of the 28th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO 2008), 17-21 August 2008, Santa Barbara CA, USA (pp. 241-261). (Lecture Notes in Computer Science; Vol. 5157). Springer. https://doi.org/10.1007/978-3-540-85174-5_14

@inproceedings{27c913fa6dfb40a6b8a1e4a2f9b3729b,

title = "Scalable multiparty computation with nearly optimal work and resilience",

abstract = "We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmically with n (ignoring an additive term that depends on n but not on the complexity of f). Moreover, the protocol is also nearly optimal in terms of resilience, providing computational security against an active, adaptive adversary corrupting a (1/2¿-¿e) fraction of the players, for an arbitrary e>¿0.",

author = "Ivan Damgard and Y. Ishai and M. Kroigaard and J.B. Nielsen and A. Smith",

year = "2008",

doi = "10.1007/978-3-540-85174-5_14",

language = "English",

isbn = "978-3-540-85173-8",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "241--261",

editor = "D. Wagner",

booktitle = "Proceedings of the 28th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO 2008), 17-21 August 2008, Santa Barbara CA, USA",

address = "Germany",

}

Damgard, I, Ishai, Y, Kroigaard, M, Nielsen, JB & Smith, A 2008, Scalable multiparty computation with nearly optimal work and resilience. in D Wagner (ed.), Proceedings of the 28th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO 2008), 17-21 August 2008, Santa Barbara CA, USA. Lecture Notes in Computer Science, vol. 5157, Springer, Berlin, pp. 241-261. https://doi.org/10.1007/978-3-540-85174-5_14

Scalable multiparty computation with nearly optimal work and resilience. / Damgard, Ivan; Ishai, Y.; Kroigaard, M. et al.
Proceedings of the 28th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO 2008), 17-21 August 2008, Santa Barbara CA, USA. ed. / D. Wagner. Berlin: Springer, 2008. p. 241-261 (Lecture Notes in Computer Science; Vol. 5157).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Scalable multiparty computation with nearly optimal work and resilience

AU - Damgard, Ivan

AU - Ishai, Y.

AU - Kroigaard, M.

AU - Nielsen, J.B.

AU - Smith, A.

PY - 2008

Y1 - 2008

N2 - We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmically with n (ignoring an additive term that depends on n but not on the complexity of f). Moreover, the protocol is also nearly optimal in terms of resilience, providing computational security against an active, adaptive adversary corrupting a (1/2¿-¿e) fraction of the players, for an arbitrary e>¿0.

AB - We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmically with n (ignoring an additive term that depends on n but not on the complexity of f). Moreover, the protocol is also nearly optimal in terms of resilience, providing computational security against an active, adaptive adversary corrupting a (1/2¿-¿e) fraction of the players, for an arbitrary e>¿0.

U2 - 10.1007/978-3-540-85174-5_14

DO - 10.1007/978-3-540-85174-5_14

M3 - Conference contribution

SN - 978-3-540-85173-8

T3 - Lecture Notes in Computer Science

SP - 241

EP - 261

BT - Proceedings of the 28th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO 2008), 17-21 August 2008, Santa Barbara CA, USA

A2 - Wagner, D.

PB - Springer

CY - Berlin

ER -

Damgard I, Ishai Y, Kroigaard M, Nielsen JB, Smith A. Scalable multiparty computation with nearly optimal work and resilience. In Wagner D, editor, Proceedings of the 28th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO 2008), 17-21 August 2008, Santa Barbara CA, USA. Berlin: Springer. 2008. p. 241-261. (Lecture Notes in Computer Science). doi: 10.1007/978-3-540-85174-5_14

Scalable multiparty computation with nearly optimal work and resilience

Abstract

Publication series

Access to Document

Fingerprint

Cite this