Coin flipping by telephone a protocol for solving impossible problems

Author:

Blum Manuel1

Affiliation:

1. University of California at Berkeley

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.

Publisher

Association for Computing Machinery (ACM)

Reference13 articles.

1. {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).

2. {B'81} M. Blum "How to Exchange (Secret) Keys " to appear. {B'81} M. Blum "How to Exchange (Secret) Keys " to appear.

3. {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.

4. {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.

5. Privacy and authentication: An introduction to cryptography

Cited by 177 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Distributed Quantum Computing – Classical and Quantum;From Distributed Quantum Computing to Quantum Internet Computing;2023-12

2. Bicorn: An Optimistically Efficient Distributed Randomness Beacon;Financial Cryptography and Data Security;2023-12-01

3. Interactive Proofs For Differentially Private Counting;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15

4. Secure Sampling for Approximate Multi-party Query Processing;Proceedings of the ACM on Management of Data;2023-11-13

5. Contract Signing;Encyclopedia of Cryptography, Security and Privacy;2023-11-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3