International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

A Latency-Free Election Scheme

Authors:
Kristian Gjøsteen
Download:
URL: http://eprint.iacr.org/2006/366
Search ePrint
Search Google
Abstract: 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.
BibTeX
@misc{eprint-2006-21857,
  title={A Latency-Free Election Scheme},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols / multiparty computation, prf},
  url={http://eprint.iacr.org/2006/366},
  note={ kristian.gjosteen@math.ntnu.no 13455 received 24 Oct 2006, last revised 3 Nov 2006},
  author={Kristian Gjøsteen},
  year=2006
}