Using Non-interactive Proofs to Achieve Independence Efficiently and Securely
Author(s)
Gennaro, Rosario
DownloadMIT-LCS-TM-515.pdf (998.4Kb)
Metadata
Show full item recordAbstract
Independence or simultaneous broadcast is a fundamental tool to achieve security in fault tolerant distributed computing. It allows n players to commit to independently chosen values. In this paper we present a constant round protocol to perform this task. Previous solutions were 0(log n) rounds. In the process we develop a new and stronger formal definition from this problem.
Date issued
1994-11Series/Report no.
MIT-LCS-TM-515