[Resource Topic] 2006/366: A Latency-Free Election Scheme

Welcome to the resource topic for 2006/366

A Latency-Free Election Scheme

Authors: Kristian Gjøsteen


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.

ePrint: https://eprint.iacr.org/2006/366

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .