Computational Hardness of Collective Coin-Tossing Protocols

Computational Hardness of Collective Coin-Tossing Protocols

Ben-Or and Linial, in a seminal work, introduced the full information model to study collective coin-tossing protocols. Collective coin-tossing is an elegant functionality providing uncluttered access to the primary bottlenecks to achieve security in a specific adversarial model. Additionally, the r...

Full description

Bibliographic Details
Main Author: Hemanta K. Maji
Format: Article
Language:English
Published: MDPI AG 2020-12-01
Series:Entropy
Subjects:
collective coin-tossing
full information model
optimal coin-tossing protocols
isoperimetric inequalities
relativized separation
black-box separation
Online Access:https://www.mdpi.com/1099-4300/23/1/44

Internet

https://www.mdpi.com/1099-4300/23/1/44

Similar Items