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...
Main Author: | Hemanta K. Maji |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-12-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/23/1/44 |
Similar Items
-
Decisions by coin toss: Inappropriate but fair
by: Gideon Keren, et al.
Published: (2010-04-01) -
Decisions by coin toss
by: Gideon Keren, et al.
Published: (2010-04-01) -
Quantum Tapsilou—A Quantum Game Inspired by the Traditional Greek Coin Tossing Game Tapsilou
by: Kalliopi Kastampolidou, et al.
Published: (2023-11-01) -
Unconditionally secure quantum coin flipping
by: Guang Ping He
Published: (2023-05-01) -
Measurement-induced focusing and the magnitude of loss aversion: The difference between comparing gains to losses and losses to gains
by: Fieke Harinck, et al.
Published: (2012-07-01)