Results 1  10
of
124
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness ∗
, 2013
"... It is well known that it is impossible for two parties to toss a coin fairly (Cleve, STOC 1986). This result implies that it is impossible to securely compute with fairness any function that can be used to toss a coin fairly. In this paper, we focus on the class of deterministic Boolean functions wi ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
It is well known that it is impossible for two parties to toss a coin fairly (Cleve, STOC 1986). This result implies that it is impossible to securely compute with fairness any function that can be used to toss a coin fairly. In this paper, we focus on the class of deterministic Boolean functions
An Optimally Fair Coin Toss
"... We address one of the foundational problems in cryptography: the bias of coinflipping protocols. Coinflipping protocols allow mutually distrustful parties to generate a common unbiased random bit, guaranteeing that even if one of the parties is malicious, it cannot significantly bias the output of ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
We address one of the foundational problems in cryptography: the bias of coinflipping protocols. Coinflipping protocols allow mutually distrustful parties to generate a common unbiased random bit, guaranteeing that even if one of the parties is malicious, it cannot significantly bias the output
Decisions by coin toss: Inappropriate but fair
 Judgement and Decision Making
, 2010
"... In many situations of indeterminacy, where people agree that no decisive arguments favor one alternative to another, they are still strongly opposed to resolving the dilemma by a coin toss. The robustness of this judgmentdecision discrepancy is demonstrated in several experiments, where factors lik ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
like the importance of consequences, similarity of alternatives, conflicts of opinion, outcome certainty, type of randomizer, and fairness considerations are systematically explored. Coin toss is particularly inappropriate in cases of life and death, even when participants agree that the protagonists
Understanding CoinTossing
"... JAROSLAW STRZALKO, JULIUSZ GRABSKI, ANDRZEJ STEFANSKI, PRZEMYSLAW PERLIKOWSKI AND TOMASZ KAPITANIAK I I t is commonly known that a toss of a fair coin is a random event and this statement is fundamental in the classical probability theory Here, we show that headstails basin boundaries are smooth, ..."
Abstract
 Add to MetaCart
JAROSLAW STRZALKO, JULIUSZ GRABSKI, ANDRZEJ STEFANSKI, PRZEMYSLAW PERLIKOWSKI AND TOMASZ KAPITANIAK I I t is commonly known that a toss of a fair coin is a random event and this statement is fundamental in the classical probability theory Here, we show that headstails basin boundaries are smooth
On the BlackBox Complexity of OptimallyFair Coin Tossing
"... Abstract. A fair twoparty coin tossing protocol is one in which both parties output the same bit that is almost uniformly distributed (i.e., it equals 0 and 1 with probability that is at most negligibly far from one half). It is well known that it is impossible to achieve fair coin tossing even in ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
Abstract. A fair twoparty coin tossing protocol is one in which both parties output the same bit that is almost uniformly distributed (i.e., it equals 0 and 1 with probability that is at most negligibly far from one half). It is well known that it is impossible to achieve fair coin tossing even
FIBONACCI NUMBERS IN COIN TOSSING SEQUENCES
"... The Fibonacci numbers and their generating function appear in a natural way in the problem of computing the expected number [2] of tosses of a fair coin until two consecutive heads appear. The problem of finding the expected number of tosses of a pcoin until k consecutive heads appear leads to clas ..."
Abstract
 Add to MetaCart
The Fibonacci numbers and their generating function appear in a natural way in the problem of computing the expected number [2] of tosses of a fair coin until two consecutive heads appear. The problem of finding the expected number of tosses of a pcoin until k consecutive heads appear leads
The Quantum Coin Toss  Testing Microphysical Undecidability
, 1990
"... A critical review of randomness criteria shows that nogo theorems severely restrict the validity of actual "proofs" of undecidability. It is suggested to test microphysical undecidability by physical processes with low extrinsic complexity, such as polarized laser light. The publication a ..."
Abstract

Cited by 23 (19 self)
 Add to MetaCart
and distribution of a sequence of pointer readings generated by such methods is proposed. Unlike any pseudorandom sequence generated by finite deterministic automata, the postulate of microscopic randomness implies that this sequence can be safely applied for all purposes requireing stochasticity and high
A Phase Transition in Random Coin Tossing
 Ann. Probab
, 2000
"... this paper is organized as follows. In Section 2, we provide definitions and introduce notation. In Section 3, we prove a useful general zeroone law, to show that singularity and absolute continuity of the measures are the only possibilities. In Section 4, Theorem 1.1(i) is proved, while Theorem 1. ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
be realized as the indicator of return times of a Markov chain to its initial state. (Take, for example, the chain whose value at epoch n is the time until the next renewal, and Random Coin Tossing 7 consider returns to 0.) Thus we can move freely between these points of view. For...
On Fair Exchange, Fair Coins and Fair Sampling ∗
"... We study various classical secure computation problems in the context of fairness, and relate them with each other. We also systematically study fair sampling problems (i.e., inputless functionalities) and discover three levels of complexity for them. Our results include the following: • Fair exchan ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
exchange cannot be securely reduced to the problem of fair cointossing by an rround protocol, except with an error that is Ω ( 1 r). • Finite fair sampling problems with rational probabilities can all be reduced to fair cointossing and unfair 2party computation (or equivalently, under computational
Results 1  10
of
124