Efficient distributed coin-tossing protocols
Ben-Or and Linial (1985) introduced the full information model for coin-tossing protocols
involving n-processors with unbounded computational power using a common broadcast
channel for all their communications. A bias-X coin-tossing protocol outputs 1 with
probability X; otherwise, it outputs 0 with probability (1-X). A coin-tossing protocol's insecurity
is the maximum change in the output distribution (in the statistical distance) that an
adversary can cause. This work considers an adversary who monitors the protocol's …
involving n-processors with unbounded computational power using a common broadcast
channel for all their communications. A bias-X coin-tossing protocol outputs 1 with
probability X; otherwise, it outputs 0 with probability (1-X). A coin-tossing protocol's insecurity
is the maximum change in the output distribution (in the statistical distance) that an
adversary can cause. This work considers an adversary who monitors the protocol's …
[CITATION][C] On Efficient Distributed Coin-tossing Protocols
Showing the best results for this search. See all results