Results 1  10
of
46
Relativistic quantum protocols: “Bit Commitment ” and “Coin Tossing”
, 2000
"... The relativistic quantum protocols realizing the bit commitment and distant coin tossing schemes are proposed. The protocols are based on the fact that the nonstationary orthogonal extended quantum states cannot be reliably distinguished if they are not fully accessible for the measurement. As the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The relativistic quantum protocols realizing the bit commitment and distant coin tossing schemes are proposed. The protocols are based on the fact that the nonstationary orthogonal extended quantum states cannot be reliably distinguished if they are not fully accessible for the measurement
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
with finite domain, and we ask for which functions in this class is it possible to informationtheoretically toss an unbiased coin, given a protocol for securely computing the function with fairness. We provide a complete characterization of the functions in this class that imply and do not imply fair coin
FIXED POINTS, PERIODIC POINTS, AND COINTOSSING SEQUENCES FOR MAPPINGS DEFINED
, 2004
"... We propose, in the general setting of topological spaces, a definition of twodimensional oriented cell and consider maps which possess a property of stretching along the paths with respect to oriented cells. For these maps, we prove some theorems on the existence of fixed points, periodic points, a ..."
Abstract
 Add to MetaCart
, and sequences of iterates which are chaotic in a suitable manner. Our results, motivated by the study of the Poincare ́ map associated to some nonlinear Hill’s equations, extend and improve some recent work. The proofs are elementary in the sense that only wellknown properties of planar sets and maps and a
PhysComp96 Extended abstract
, 1996
"... Why quantum bit commitment and quantum coin tossing are impossible? ∗ ..."
Secure and efficient asynchronous broadcast protocols (Extended Abstract)
 Advances in Cryptology: CRYPTO 2001
, 2001
"... Broadcast protocols are a fundamental building block for implementing replication in faulttolerant distributed systems. This paper addresses secure service replication in an asynchronous environment with a static set of servers, where a malicious adversary may corrupt up to a threshold of servers ..."
Abstract

Cited by 71 (20 self)
 Add to MetaCart
messages. Our protocols use threshold cryptography for signatures, encryption, and cointossing.
Symmetry Breaking for Suffix Tree Construction (Extended Abstract)
"... There are several serial algorithms for suffix tree construction which run in linear time, but the number of operations in the only parallel algorithm available, due to Apostolico, Iliopoulos, Landau, Schieber and Vishkin, is proportional to n log n. The algorithm is based on labeling substrings, s ..."
Abstract

Cited by 27 (4 self)
 Add to MetaCart
, similar to a classical serial algorithm, with the same operations bound, by Karp, Miller and Rosenberg. We show how to break symmetries that occur in the process of assigning labels using the Deterministic Coin Tossing (DCT) technique, and thereby reduce the number of labeled substrings to linear. We give
Randomized SelfStabilizing Leader Election (Extended Abstract)
"... We present a new algorithm for the problem of leader election in a unidirectional ring of processors. The processors are uniform, i.e. they execute the same program and they do not use unique process identifiers. A processor can toss a coin to break symmetry in the ring. Because our solution is ..."
Abstract
 Add to MetaCart
We present a new algorithm for the problem of leader election in a unidirectional ring of processors. The processors are uniform, i.e. they execute the same program and they do not use unique process identifiers. A processor can toss a coin to break symmetry in the ring. Because our solution
Fairness and Cheating
, 2010
"... Abstract: We present evidence from a laboratory experiment showing that individuals who believe they were treated unfairly in an interaction with another person are more likely to cheat in a subsequent unrelated game. Specifically, subjects first participated in a dictator game. They then flipped a ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
coin in private and reported the outcome. Subjects could increase their total payoff by cheating, i.e., lying about the outcome of the coin toss. We found that subjects were more likely to cheat in reporting the outcome of the coin flip when: 1) they received either nothing or a very small transfer
GROWTH RATE FOR THE EXPECTED VALUE OF A GENERALIZED RANDOM FIBONACCI SEQUENCE
, 804
"... A random Fibonacci sequence is defined by the relation gn = gn−1 ± gn−2, where the ± sign is chosen by tossing a balanced coin for each n. We generalize these sequences to the case when the coin is unbalanced (denoting by p the probability of a +), and the recurrence relation is of the form gn =  ..."
Abstract
 Add to MetaCart
A random Fibonacci sequence is defined by the relation gn = gn−1 ± gn−2, where the ± sign is chosen by tossing a balanced coin for each n. We generalize these sequences to the case when the coin is unbalanced (denoting by p the probability of a +), and the recurrence relation is of the form gn
An extreme value theory for long head runs
, 1984
"... Summary. For an infinite sequence of independent coin tosses with P(Heads)=pE(O, l), the longest run of consecutive heads in the first n tosses is a natural object of study. We show that the probabilistic behavior of the length of the longest pure head run is closely approximated by that of the grea ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Summary. For an infinite sequence of independent coin tosses with P(Heads)=pE(O, l), the longest run of consecutive heads in the first n tosses is a natural object of study. We show that the probabilistic behavior of the length of the longest pure head run is closely approximated
Results 1  10
of
46