Active security in multiparty computation over black-box groups

Yvo Desmedt*, Josef Pieprzyk, Ron Steinfeld

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)

Abstract

Most previous work on unconditionally secure multiparty computation has focused on computing over a finite field (or ring). Multiparty computation over other algebraic structures has not received much attention, but is an interesting topic whose study may provide new and improved tools for certain applications. At CRYPTO 2007, Desmedt et al introduced a construction for a passive-secure multiparty multiplication protocol for black-box groups, reducing it to a certain graph coloring problem, leaving as an open problem to achieve security against active attacks. We present the first n-party protocol for unconditionally secure multiparty computation over a black-box group which is secure under an active attack model, tolerating any adversary structure Δ satisfying the Q 3 property (in which no union of three subsets from Δ covers the whole player set), which is known to be necessary for achieving security in the active setting. Our protocol uses Maurer's Verifiable Secret Sharing (VSS) but preserves the essential simplicity of the graph-based approach of Desmedt et al, which avoids each shareholder having to rerun the full VSS protocol after each local computation. A corollary of our result is a new active-secure protocol for general multiparty computation of an arbitrary Boolean circuit.

Original languageEnglish
Title of host publicationSecurity and Cryptography for Networks - 8th International Conference, SCN 2012, Proceedings
EditorsIvan Visconti, Roberto De Prisco
Place of PublicationBerlin
PublisherSpringer, Springer Nature
Pages503-521
Number of pages19
ISBN (Electronic)9783642329289
ISBN (Print)9783642329272
DOIs
Publication statusPublished - 2012
Event8th International Conference on Security and Cryptography for Networks, SCN 2012 - Amalfi, Italy
Duration: 5 Sep 20127 Sep 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7485 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other8th International Conference on Security and Cryptography for Networks, SCN 2012
CountryItaly
CityAmalfi
Period5/09/127/09/12

    Fingerprint

Cite this

Desmedt, Y., Pieprzyk, J., & Steinfeld, R. (2012). Active security in multiparty computation over black-box groups. In I. Visconti, & R. De Prisco (Eds.), Security and Cryptography for Networks - 8th International Conference, SCN 2012, Proceedings (pp. 503-521). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7485 LNCS). Berlin: Springer, Springer Nature. https://doi.org/10.1007/978-3-642-32928-9_28