Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols / multiparty computation, prf

Date: received 24 Oct 2006, last revised 3 Nov 2006

Contact author: kristian gjosteen at math ntnu no

Available format(s): PDF | BibTeX Citation

Version: 20061103:184247 (All versions of this report)

Short URL: ia.cr/2006/366

Discussion forum: Show discussion | Start new discussion