Output details
11 - Computer Science and Informatics
University of East London
Output title
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
Type
E - Conference contribution
Name of conference/published proceedings
Springer Berlin Heidelberg
Volume number
5350
Issue number
-
First page of article
37
ISSN of proceedings
1611-3349
Year of publication
2008
URL
-
Number of additional authors
2
Additional information
<18> Multiparty computation is an area with various applications (e.g. electronic auctions and e-cash). We extend the results by Desmedt et al. (2007) related to the n-product function. First, we show how to construct probabilistic protocols for an optimal security level in polynomial time, using percolation theory to analyze the properties of the coloring and underlying planar graph structures. This appears to be the first use of this theory in the area of multiparty computation and one of the first uses in cryptography. Second, we obtain the first deterministic algorithm for securely computing the n-product functionality against passive adversaries.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
3
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
