Paper 2006/366 Original: eprint.iacr.org/2006/366 ↗
A Latency-Free Election Scheme
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
- Preprint.
- History
- 2006-11-03: last updated
- 2006-11-03: published
- Short URL
- https://ia.cr/2006/366
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}