Graph coloring applied to secure computation in non-Abelian groups

Desmedt, Yvo, Pieprzyk, Josef, Steinfeld, Ron, Sun, Xiaoming, Tartary, Chrisophe, Wang, Huaxiong, & Yao, Andrew Chi-Chih (2012) Graph coloring applied to secure computation in non-Abelian groups. Journal of Cryptology, 25(4), pp. 557-600.

View at publisher

Abstract

We study the natural problem of secure n-party computation (in the computationally unbounded attack model) of circuits over an arbitrary finite non-Abelian group (G,⋅), which we call G-circuits. Besides its intrinsic interest, this problem is also motivating by a completeness result of Barrington, stating that such protocols can be applied for general secure computation of arbitrary functions. For flexibility, we are interested in protocols which only require black-box access to the group G (i.e. the only computations performed by players in the protocol are a group operation, a group inverse, or sampling a uniformly random group element). Our investigations focus on the passive adversarial model, where up to t of the n participating parties are corrupted.

Impact and interest:

3 citations in Scopus
Search Google Scholar™
2 citations in Web of Science®

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.

ID Code: 69328
Item Type: Journal Article
Refereed: Yes
Keywords: Multiparty computation, Graph coloring, Non-Abelian group, Black-box operations, Planar graph, Percolation theory, Word problem
DOI: 10.1007/s00145-011-9104-3
ISSN: 1432-1378
Divisions: Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright 2011 International Association for Cryptologic Research
Deposited On: 27 Mar 2014 00:21
Last Modified: 31 Mar 2014 00:45

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page