Output details
11 - Computer Science and Informatics
University of East London
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
<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.