Cargando…
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...
Autor principal: | Maji, Hemanta K. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7824602/ https://www.ncbi.nlm.nih.gov/pubmed/33396773 http://dx.doi.org/10.3390/e23010044 |
Ejemplares similares
-
Randomization: beyond tossing a coin
por: Ferreira, Juliana Carvalho, et al.
Publicado: (2016) -
Coin Tossing Explains the Activity of Opposing Microtubule Motors on Phagosomes
por: Sanghavi, Paulomi, et al.
Publicado: (2018) -
A Consideration of Alternative Sample Spaces Used in Coin-Toss Problems
por: Renelle, Amy, et al.
Publicado: (2022) -
A Toss without a Coin: Information, Discontinuity, and Mathematics in Quantum Theory
por: Plotnitsky, Arkady
Publicado: (2022) -
Of Black Swans and Tossed Coins: Is the Description-Experience Gap in
Risky Choice Limited to Rare Events?
por: Ludvig, Elliot A., et al.
Publicado: (2011)