{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:44:14Z","timestamp":1742798654697},"reference-count":13,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[1983,1]]},"abstract":"Alice and Bob want to flip a coin by telephone. (They have just divorced, live in different cities, want to decide who gets the car.) Bob would not like to tell Alice HEADS and hear Alice (at the other end of the line) say \"Here goes . . . I'm flipping the coin. . . . You lost!\"Coin-flipping in the SPECIAL way done here has a serious purpose. Indeed, it should prove an INDISPENSABLE TOOL of the protocol designer. Whenever a protocol requires one of two adversaries, say Alice, to pick a sequence of bits at random, and whenever it serves Alice's interests best NOT to pick her sequence of bits at random, then coin-flipping (Bob flipping coins to Alice) as defined here achieves the desired goal:1. It GUARANTEES to Bob that Alice will pick her sequence of bits at random. Her bit is 1 if Bob flips heads to her, O otherwise.2. It GUARANTEES to Alice that Bob will not know WHAT sequence of bits he flipped to her.Coin-flipping has already proved useful in solving a number of problems once thought impossible: mental poker, certified mail, and exchange of secrets. It will certainly prove a useful tool in solving other problems as well.<\/jats:p>","DOI":"10.1145\/1008908.1008911","type":"journal-article","created":{"date-parts":[[2004,10,12]],"date-time":"2004-10-12T15:20:46Z","timestamp":1097594446000},"page":"23-27","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":228,"title":["Coin flipping by telephone a protocol for solving impossible problems"],"prefix":"10.1145","volume":"15","author":[{"given":"Manuel","family":"Blum","sequence":"first","affiliation":[{"name":"University of California at Berkeley"}]}],"member":"320","published-online":{"date-parts":[[1983,1]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Yale U.","author":"Angluin D.","year":"1978","unstructured":"{A'78} D. Angluin , \"The Complexity of Some Problems in Number Theory,\" Lecture Notes available from author, Dept. of Comp. Science , Yale U. ( 1978 ). {A'78} D. Angluin, \"The Complexity of Some Problems in Number Theory,\" Lecture Notes available from author, Dept. of Comp. Science, Yale U. (1978)."},{"key":"e_1_2_1_2_1","unstructured":"{B'81} M. Blum \"How to Exchange (Secret) Keys \" to appear. {B'81} M. Blum \"How to Exchange (Secret) Keys \" to appear."},{"key":"e_1_2_1_3_1","unstructured":"{BM'81} M. Blum and S. Micali \"Coin-Flipping into a Well \" to appear. {BM'81} M. Blum and S. Micali \"Coin-Flipping into a Well \" to appear."},{"key":"e_1_2_1_4_1","unstructured":"{BR'81} M. Blum and M. O. Rabin \"Mail Certification by Randomization \" to appear. {BR'81} M. Blum and M. O. Rabin \"Mail Certification by Randomization \" to appear."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1979.11256"},{"key":"e_1_2_1_6_1","unstructured":"{L'77} W. J. LeVeque \"Fundamentals of Number Theory \" Addison-Wesley Pub. 1977. {L'77} W. J. LeVeque \"Fundamentals of Number Theory \" Addison-Wesley Pub. 1977."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80043-8"},{"key":"e_1_2_1_8_1","unstructured":"{MG'81} S. Micali and S. Goldwasser \"Mental Poker Without Commutative Locks \" to appear. {MG'81} S. Micali and S. Goldwasser \"Mental Poker Without Commutative Locks \" to appear."},{"key":"e_1_2_1_9_1","volume-title":"MIT LCS TM","author":"Rabin M. O.","year":"1979","unstructured":"{R'79} M. O. Rabin , \"Digital Signatures and Public Key Systems as Intractable as Factorization,\" MIT LCS TM 1979 . {R'79} M. O. Rabin, \"Digital Signatures and Public Key Systems as Intractable as Factorization,\" MIT LCS TM 1979."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-314X(80)90084-0"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"e_1_2_1_12_1","volume-title":"Mental Poker,\" in The Mathematical Gardner, ed. D. A. Klarner, pub. by Wadsworth Intrntl","author":"Shamir A.","year":"1981","unstructured":"{SRA'78} A. Shamir , R. L. Rivest , and L. M. Adleman , \" Mental Poker,\" in The Mathematical Gardner, ed. D. A. Klarner, pub. by Wadsworth Intrntl ( 1981 ), 37--43. {SRA'78} A. Shamir, R. L. Rivest, and L. M. Adleman, \"Mental Poker,\" in The Mathematical Gardner, ed. D. A. Klarner, pub. by Wadsworth Intrntl (1981), 37--43."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206006"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1008908.1008911","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T13:39:31Z","timestamp":1672234771000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008908.1008911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,1]]}},"alternative-id":["10.1145\/1008908.1008911"],"URL":"https:\/\/doi.org\/10.1145\/1008908.1008911","relation":{},"ISSN":["0163-5700"],"issn-type":[{"value":"0163-5700","type":"print"}],"subject":[],"published":{"date-parts":[[1983,1]]},"assertion":[{"value":"1983-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}