Citations: Coin flipping by telephone: a protocol for solving impossible problems

33 citations found. Retrieving documents...

Manuel Blum. Coin flipping by telephone a protocol for solving impossible problems. SIGACT News, 15(1):23--27, 1983.

Home/Search Document Not in Database Summary Related Articles Check

This paper is cited in the following contexts:

First 50 documents

Timed Fair Exchange of Standard Signatures (Extended Abstract) - Garay, Pomerance (2003) (Correct)

....block to allow for the exchange of standard signatures, by using the committed hidden values to blind the respective signatures and prove that this is indeed the case. Note that the simpler building block already enables other timed applications, such as collective (two party) coin tossing [Blu81]. 4.1 Fair exchange of hidden values Assume that the two parties, Alice and Bob, have agreed on an integer parameter K. Let T = 2 . For this application, we envision K to be large (in particular, larger than for previous timed applications) e.g. K 80. Further, assume that both parties have ....

M. Blum. Coin flipping by telephone: A protocol for solving impossible problems. In Advances in Cryptology---CRYPTO '81, pages 11--15. ECE Report 82-04, 1982.

Multi-Party Electronic Payments for Mobile Communications - Peirce (2000) (1 citation) (Correct)

....where a signature verification can be computed more efficiently, at the risk of not detecting a forgery. We now examine micropayment schemes using each of these techniques in turn. 3.3.6. 1 Probabilistic Payment Wheeler proposed transactions using bets [Whe96a] where an on line coin flip [Blu82] between the payer and payee is used to decide whether payment is actually made or not. A coin flip can be performed by the vendor choosing a random number R and committing to it using a one way hash function. 58 User Vendor r = h(R) S R Choose random R LSB(S) LSB(R) Choose random S ....

M. Blum. Coin flipping by telephone: a protocol for solving impossible problems. In Advances in Cryptology: A Report on CRYPTO 81, pp. 11-15, ECE Report 82-04, Dept. of Electrical and Computer Engineering, U. C. Santa Barbara, 1982.

A Cryptographic Solution to a Game Theoretic Problem - Dodis, Halevi, Rabin (2000) (6 citations) (Correct)

.... the need for four players; see [6] Of course, if one is willing to use a group of players to simulate the mediator, then the general multiparty computation tools (e.g. 6, 11] can 1 A special case of Correlated Element Selection when a i = b i is just the standard coin flipping problem [7]. However, this is a degenerate case of the problem, since it requires no secrecy. In particular, none of the previous coin flipping protocols seem to extend to solve our problem. also be used, even though the solution of [3] is simpler. Forges [18, 19] extends these results to more general ....

M. Blum. Coin flipping by telephone: A protocol for solving impossible problems. In CRYPTO '81. ECE Report 82-04, ECE Dept., UCSB, 1982.

Verifiable Partial Escrow of Integer Factors - Mao (2000) (Correct)

....0 , s, t at random with the required sizes, parity and relative prime relationship. She then samples if p and q in (7) are prime. The procedure repeats until p and q are found to be prime. For p 0 , q 0 , s, t being odd, both p and q will be congruent to 3 modulo 4, rendering n a Blum integer [4]. It is advisable that p 0 and q 0 be chosen as primes. Then for n of a secure size (at least of 512 bits) p 0 and q 0 will be sufficiently large which results in p and q as the so called strong primes. This follows a desirable moduli setting for integer factoring based cryptosystems. ....

M. Blum. Coin flipping by telephone: a protocol for solving impossible problems. Proceedings of 24th IEEE Computer Conference (CompCon), 1982. pages 133--137.

Fast Monte-Carlo Primality Evidence Shown in the Dark - Mao (2000) (Correct)

....k is a security parameter which controls the error probability of 1 the proof under 2 ;k . This cost reaches the lowest to date in the protocols for proving the two prime product structure of a number in the most general case (i.e. regardless of whether the number in question is a Blum integer [3]# we will discuss Blum integers in a moment) Previous techniques for proving such a structure had a much higher cost for non Blum integers because the error probability for proofs of such integers achieved prior to this work was a function (in k) between e ;k=74 and e ;k=75 whichissignificantly ....

M. Blum. Coin flipping by telephone: a protocol for solving impossible problems, Proceedings of 24th IEEE Computer Conference (CompCon), 1982, pp. 133--137.

A Cryptographic Solution to a Game Theoretic Problem - Dodis, Halevi, Rabin (6 citations) (Correct)

....often. To demonstrate that, we show in Appendix C a very simple protocol to achieve 1 out of n Oblivious Transfer ( n 1 OT) protocol from any secure blindable encryption scheme. 2 1 A special case of Correlated Element Selection when a i = b i is just the standard coin flipping problem [7]. However, this is a degenerate case of the problem, since it requires no secrecy. In particular, none of the previous coin flipping protocols seem to extend to solve our problem. 2 It is known that oblivious transfer is complete for two party secure computation [14, 26] hence blindable ....

M. Blum. Coin flipping by telephone: A protocol for solving impossible problems. In Advances in Cryptology -- CRYPTO '81. ECE Report 82-04, ECE Dept., UCSB, 1982.

Abuse-free Optimistic Contract Signing - Garay, Jakobsson, MacKenzie (1999) (39 citations) (Correct)

....signing is part of the broader problem of fair exchange [10, 16, 28, 33, 2] More specifically, it can be considered fair exchange of digital signatures [3] The different existing approaches to contract signing were already described above. The term contract signing was first introduced in [8]. The first optimistic scheme in the sense defined above was based on the gradual increase of privilege [7] as the computation evolves, the probability of a contract being valid gradually increases from 0 to 1. This solution has several shortcomings, as it requires termination detection by the ....

M. Blum. Coin flipping by telephone: A protocol for solving impossible problems. In CRYPTO'81, pages 11--15. ECE Report 82-04, 1982.

Abuse-free Multi-party Contract Signing - Garay, MacKenzie (1999) (17 citations) (Correct)

....This is the first abuse free optimistic contract signing protocol that has been developed for n 3 parties. We also show a linear lower bound on the number of rounds of any n party optimistic contract signing protocol. 1 Introduction A contract is a non repudiable agreement on a given text [7]. Contract signing is an important part of any business transaction, in particular in settings where participants do not trust each other to some extent already. Thus, the World Wide Web is probably the best example of a setting where contract signing schemes are needed. Still, even though a great ....

....n party optimistic contract signing protocol. Electronic contract signing. Contract signing is part of the broader problem of fair exchange [8, 11, 17, 21, 2] More specifically, it can be considered fair exchange of digital signatures [4] The term contract signing was first introduced in [7]. Early work on electronic contract signing, or more generally, fair exchange of secrets signatures, focused on the gradual release of secrets to obtain simultaneity, 6, 15, 19] see [12] for more recent results) The idea is that if each party alternately releases a small portion of the secret, ....

M. Blum. Coin flipping by telephone: A protocol for solving impossible problems. In CRYPTO 81, pp. 11--15.

Information-Theoretic Conditions for - Two-Party Secure Function (2006) (Correct)

No context found.

Manuel Blum. Coin flipping by telephone a protocol for solving impossible problems. SIGACT News, 15(1):23--27, 1983.

Asymmetric Currency Rounding - Published In Frankel (Correct)