We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Using Non-interactive Proofs to Achieve Independence Efficiently and Securely

Thumbnail Image
Download
Name

MIT-LCS-TM-515.pdf

Size

998.46 KB

Format

Adobe PDF

Checksum (MD5)

571c76f244551b7e39f379b028d8b631

Author(s)
Gennaro, Rosario
Date Issued
November 1994
Series/Report no.
MIT-LCS-TM-515
Abstract
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.