Sciweavers

Share
CTRSA
2008
Springer

A Latency-Free Election Scheme

9 years 2 days ago
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.
Kristian Gjøsteen
Added 19 Oct 2010
Updated 19 Oct 2010
Type Conference
Year 2008
Where CTRSA
Authors Kristian Gjøsteen
Comments (0)
books