Counting Method for Multi-party Computation over Non-abelian Groups

In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , xn) := x1

• Type: Conference
• Year: 2008
• Where: CANS
• Authors: Youming Qiao, Christophe Tartary
• Keywords: CANS 2008, Counting Method, Cryptology, Desmedt Et, Random Coloring