On the public citation graph

A Robust Noncryptographic Protocol for Collective Coin Flipping

https://doi.org/10.1137/0402020

0 signed · 53 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jcss.2001.1776openalex-snapshot

Perfect Information Leader Election in log*n+O(1) Rounds

inferred← citeshttps://doi.org/10.1007/11818175_25openalex-snapshot

Random Selection with an Adversarial Majority

inferred← citeshttps://doi.org/10.1007/3-540-48224-5_25openalex-snapshot

New Imperfect Random Source with Applications to Coin-Flipping

inferred← citeshttps://doi.org/10.1007/978-3-030-75078-7_27openalex-snapshot

Scalable Leader Election Considering Load Balancing

inferred← citeshttps://doi.org/10.1007/978-3-540-24747-0_9openalex-snapshot

Supporting Privacy in Decentralized Additive Reputation Systems

inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_1openalex-snapshot

Distributed Quantum Computing

inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_1openalex-snapshot

An Optimally Fair Coin Toss

inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_24openalex-snapshot

Rationality in the Full-Information Model

inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_5openalex-snapshot

Distributed Protocols for Leader Election: A Game-Theoretic Perspective

inferred← citeshttps://doi.org/10.1007/bf01299739openalex-snapshot

Fast perfect-information leader-election protocols with linear immunity

inferred← citeshttps://doi.org/10.1007/bf01303199openalex-snapshot

The influence of large coalitions

inferred← citeshttps://doi.org/10.1007/s00145-015-9199-zopenalex-snapshot

An Optimally Fair Coin Toss

inferred← citeshttps://doi.org/10.1007/s00145-025-09561-6openalex-snapshot

Fair Coin Flipping: Tighter Analysis and the Many-Party Case

inferred← citeshttps://doi.org/10.1007/s00453-020-00770-yopenalex-snapshot

High Entropy Random Selection Protocols

inferred← citeshttps://doi.org/10.1007/s00493-020-4147-4openalex-snapshot

A Lower Bound for Adaptively-Secure Collective Coin Flipping Protocols

inferred← citeshttps://doi.org/10.1016/s1574-0005(05)80070-0openalex-snapshot

Chapter 38 Game-theoretic aspects of computing

inferred← citeshttps://doi.org/10.1098/rspa.2021.0203openalex-snapshot

Unconditionally secure relativistic multi-party biased coin flipping and die rolling

inferred← citeshttps://doi.org/10.1103/p84v-1xqvopenalex-snapshot

Quantum cryptography beyond key distribution: Theory and experiment

inferred← citeshttps://doi.org/10.1109/ccc.2004.1313848openalex-snapshot

Multiparty quantum coin flipping

inferred← citeshttps://doi.org/10.1109/ccc.2004.19openalex-snapshot

Multiparty quantum coin flipping

inferred← citeshttps://doi.org/10.1109/focs.2008.73openalex-snapshot

Network Extractor Protocols

inferred← citeshttps://doi.org/10.1109/focs46700.2020.00120openalex-snapshot

A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip

inferred← citeshttps://doi.org/10.1109/fscs.1990.89523openalex-snapshot

Coin-flipping games immune against linear-sized coalitions

inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518000openalex-snapshot

Efficient Distributed Coin-tossing Protocols

inferred← citeshttps://doi.org/10.1109/sfcs.1998.743508openalex-snapshot

Perfect information leader election in log*n+O(1) rounds

inferred← citeshttps://doi.org/10.1109/sffcs.1999.814586openalex-snapshot

Noncryptographic selection protocols

inferred← citeshttps://doi.org/10.1109/sp46215.2023.10179419openalex-snapshot

SoK: Distributed Randomness Beacons

inferred← citeshttps://doi.org/10.1137/0222030openalex-snapshot

Coin-Flipping Games Immune against Linear-Sized Coalitions

inferred← citeshttps://doi.org/10.1137/050641715openalex-snapshot

The Round Complexity of Two-Party Random Selection

inferred← citeshttps://doi.org/10.1137/1.9781611974782.170openalex-snapshot

Fair Coin Flipping: Tighter Analysis and the Many-Party Case

inferred← citeshttps://doi.org/10.1137/15m1009147openalex-snapshot

An Almost-Optimally Fair Three-Party Coin-Flipping Protocol

inferred← citeshttps://doi.org/10.1137/s0097539700376007openalex-snapshot

Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model

inferred← citeshttps://doi.org/10.1137/s0097539796307182openalex-snapshot

Perfect-Information Leader Election with Optimal Resilience

inferred← citeshttps://doi.org/10.1145/1060590.1060641openalex-snapshot

The round complexity of two-party random selection

inferred← citeshttps://doi.org/10.1145/1132516.1132544openalex-snapshot

Fast leader-election protocols with bounded cheaters' edge

inferred← citeshttps://doi.org/10.1145/167088.167164openalex-snapshot

The biased coin problem

inferred← citeshttps://doi.org/10.1145/167088.167258openalex-snapshot

Fast perfection-information leader-election protocol with linear immunity

inferred← citeshttps://doi.org/10.1145/1824777.1824788openalex-snapshot

Fast asynchronous Byzantine agreement and leader election with full information

inferred← citeshttps://doi.org/10.1145/195058.195141openalex-snapshot

Simple and efficient leader election in the full information model

inferred← citeshttps://doi.org/10.1145/237814.237878openalex-snapshot

Randomness-optimal sampling, extractors, and constructive leader election

inferred← citeshttps://doi.org/10.1145/258533.258649openalex-snapshot

Lower bounds for distributed coin-flipping and randomized consensus

inferred← citeshttps://doi.org/10.1145/2591796.2591842openalex-snapshot

An almost-optimally fair three-party coin-flipping protocol

inferred← citeshttps://doi.org/10.1145/278298.278304openalex-snapshot

Lower bounds for distributed coin-flipping and randomized consensus

inferred← citeshttps://doi.org/10.1145/2897518.2897528openalex-snapshot

Explicit two-source extractors and resilient functions

inferred← citeshttps://doi.org/10.1145/301250.301337openalex-snapshot

Lower bounds for leader election and collective coin-flipping in the perfect information model

inferred← citeshttps://doi.org/10.1145/3212734.3212767openalex-snapshot

Fair Leader Election for Rational Agents in Asynchronous Rings and Networks

inferred← citeshttps://doi.org/10.1145/3303712openalex-snapshot

Distributed Protocols for Leader Election

inferred← citeshttps://doi.org/10.1145/3465084.3467484openalex-snapshot

Byzantine Agreement and Leader Election

inferred← citeshttps://doi.org/10.1145/3519935.3520015openalex-snapshot

Byzantine agreement in polynomial time with near-optimal resilience

inferred← citeshttps://doi.org/10.1145/3639454openalex-snapshot

Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection

inferred← citeshttps://doi.org/10.17863/cam.74688openalex-snapshot

Unconditionally secure relativistic multi-party biased coin flipping and die rolling

inferred← citeshttps://doi.org/10.48550/arxiv.2105.00850openalex-snapshot

An Almost-Optimally Fair Three-Party Coin-Flipping Protocol

inferred← citeshttps://doi.org/10.5555/1109557.1109667openalex-snapshot

Scalable leader election

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.