- 1、本文档共5页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
1982 749 AC Yao, Protocols for secure computations
Protocols for Secure Computations
(extended abstract)
Andrew C. Yao
University of California Berkeley, California 94720
1 Introduction
Two millionaires wish to know who is richer; however,
they do not want to find out inadvertently any additional
information about each other’s wealth. How can they
carry out such a conversation?
This is a special case of the following general prob-
lem. Suppose m people wish to compute the value of a
function f(x1, x2, x3, . . . , xm), which is an integer-valued
function of m integer variables xi of bounded range. As-
sume initially person Pi knows the value of xi and no
other x’s. Is it possible for them to compute the value of
f , by communicating among themselves, without unduly
giving away any information about the values of their own
variables? The millionaires’ problem corresponds to the
case when m = 2 and f(x1, x2) = 1 if x1 x2, and
0 otherwise. In this paper, we will give precise formu-
lation of this general problem and describe three ways
of solving it by use of one-way functions (i.e., functions
which are easy to evaluate but hard to invert). These
results have applications to secret voting, private query-
ing of database, oblivious negotiation, playing mental
poker, etc. We will also discuss the complexity question
“How many bits need to be exchanged for the computa-
tion”, and describe methods to prevent participants from
cheating. Finally, we study the question “What cannot
be accomplished with one-way functions”.
Before describing these results, we would like to put
this work in perspective by first considering a unified
view of secure computation in the next section.
2 A Unified View of Secure Computation
Since one-way functions were first proposed in 1976
(Diffie and Hellman [1]), they have been used in two
kinds of applications. The first kind is concerned with
the encryption and transmission of messages to make
them unreadable and unalterable for eavesdroppers and
saboteurs [1, 2, 3, 4]. The second kind of applic
您可能关注的文档
- %Krause ICML2010 - Submodular dictionary selection for sparse representation.pdf
- (ISP图的画法可参考)等电点沉淀法回收蛋白的特性.pdf
- (MX-GC控制柜)).pdf
- (ppt) IBM Content Based Copy Detection System for TRECVID 2009.pdf
- (ppt)BEA Weblogic Server8.1 Web Service.pdf
- (Reactive Violet 5R) decolorising native acclimatised bacterial consortia.pdf
- (universal.pdf
- (全6章)HL7 v3基础 Foundation完整版.pdf
- (初三英语测试题二).doc
- (天泉多级泵样本)TDLF-27p.pdf
文档评论(0)