Active security in multiparty computation over black-box groups

Desmedt, Yvo, Pieprzyk, Josef, & Steinfeld, Ron (2012) Active security in multiparty computation over black-box groups. Lecture Notes in Computer Science : Security and Cryptography for Networks, 7485, pp. 503-521.

View at publisher


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.

Impact and interest:

1 citations in Scopus
Search Google Scholar™

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

Full-text downloads:

22 since deposited on 03 Apr 2014
6 in the past twelve months

Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.

ID Code: 69687
Item Type: Journal Article
Refereed: Yes
Additional Information: 8th International Conference, SCN 2012, Amalfi, Italy, September 5-7, 2012. Proceedings
Keywords: Multi-Party Computation, General Adversary Structures, Non-Abelian Group, Black-Box, Graph Colouring, Active Security
DOI: 10.1007/978-3-642-32928-9_28
ISSN: 0302-9743
Divisions: Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright 2012 Springer-Verlag Berlin Heidelberg
Deposited On: 03 Apr 2014 01:49
Last Modified: 16 Jul 2014 10:31

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page