Paper 2006/366

A Latency-Free Election Scheme

Kristian Gjøsteen

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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
multiparty computationprf
Contact author(s)
kristian gjosteen @ math ntnu no
History
2006-11-03: revised
2006-11-03: received
See all versions
Short URL
https://ia.cr/2006/366
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2006/366,
      author = {Kristian Gjøsteen},
      title = {A Latency-Free Election Scheme},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/366},
      year = {2006},
      url = {https://eprint.iacr.org/2006/366}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.