Graph Design for Secure Multiparty Computation over Non-Abelian Groups

Recently, Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. They considered the passive adversary model and they assumed that the parties were only allowed to perform blackbox operations over the finite group G. They showed three results for the n-product function fG(x1, . . . , xn) := x1

• Type: Conference
• Year: 2008
• Where: ASIACRYPT
• Authors: Xiaoming Sun, Andrew Chi-Chih Yao, Christophe Tartary
• Keywords: ASIACRYPT 2008, Cryptology, Passive Adversary Model, Randomized Algorithm, Secure N-party Computation