A Latency-Free Election Scheme

We motivate and describe the problem of finding protocols for multiparty computations that only use a single broadcast round per computation (latency-free computations). We show that solutions exists for one multiparty computation problem, that of elections, and more generally, addition in certain groups. The protocol construction is based on an interesting pseudo-random function family with a novel property.

• Type: Conference
• Year: 2008
• Where: CTRSA
• Authors: Kristian Gjøsteen
• Keywords: Cryptology, CTRSA 2008, Interesting Pseudo-random Function, Multiparty Computation, Multiparty Computation Problem