Graph coloring applied to secure computation in non-Abelian groups

• Main Authors: Yao, Andrew Chi-Chih, Wang, Huaxiong, Desmedt, Yvo, Pieprzyk, Josef, Steinfeld, Ron, Sun, Xiaoming, Tartary, Christophe
• Other Authors: School of Physical and Mathematical Sciences
• Format: Article
• Language: English
• Published: 2013
• Subjects: DRNTU::Science
• Online Access: https://hdl.handle.net/10356/97034; http://hdl.handle.net/10220/11624
• Institution: Nanyang Technological University

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, s...