Theory and Practice of Secure Computation

安全计算理论与实践

• 批准号: 0728937
• 负责人: Eric Allender
• 金额: --
• 依托单位: Rutgers University New Brunswick
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2007
• 资助国家: 美国
• 起止时间: 2007-09-01 至 2011-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0728937&HistoricalAwards=false
• 关键词: Theory; Practice; Secure; Computation

There is a fundamental tension between our desire to aggregate data for useful purposes and our desire to protect the privacy of individuals. The canonical example is voting, in which we wish to add up votes without revealing any individual votes. Secure computation is a branch of cryptography that mediates and in some cases transforms this tension, allowing us to satisfy these conflicting needs to a far greater level than naively would seem possible. The research is primarily concerned with the basic theory of secure computation, determining under what conditions it is possible to obtain useful information from multiple sources of data while maximally protecting the privacy of this data. It also considers special cases under which secure computation may be particularly efficient and practical. Practical secure computation solutions would be useful for a number of applications, including electronic voting, e-commerce and access control systems.Specific goals of this investigation include:: Classifying the power of general classes of secure computation systems, particularly those with probabilistic output behavior.: Further developing the theory of errorless reductions among secure computation primitives, in which the goals are achieved with certainty as opposed to merely with high probability.: Developing more efficient protocols for voting systems with sophisticated vote-counting mechanisms (e.g., instant runoff voting), and for other preference aggregation problems.: Finding ways to use extant information services as a means for implementing secure computations and as a resource for bridging the gap between abstract protocols and real systems.Level of effort statementWe note that the amount of summer support recommended for the principal investigator has been reduced to one month per year. At the recommended level of support, the principal investigator will make every attempt to meet the original scope of the project, as well as his level of effort.1

我们出于有用目的而汇总数据的愿望与保护个人隐私的愿望之间存在着根本的紧张关系。典型的例子是投票，我们希望在不透露任何个人投票的情况下将选票相加。安全计算是密码学的一个分支，它可以调解并在某些情况下转变这种紧张关系，使我们能够在比天真地认为可能的更高水平上满足这些相互冲突的需求。该研究主要涉及安全计算的基本理论，确定在什么条件下可以从多个数据源获取有用信息，同时最大限度地保护这些数据的隐私。它还考虑了安全计算可能特别有效和实用的特殊情况。实用的安全计算解决方案对于许多应用都很有用，包括电子投票、电子商务和访问控制系统。这项研究的具体目标包括： 对一般类别的安全计算系统的能力进行分类，特别是那些具有概率输出行为的系统.：进一步发展安全计算原语中的无差错约简理论，其中目标是确定性地实现的，而不是仅仅以高概率实现。：为具有复杂计票机制（例如即时径流）的投票系统开发更有效的协议投票），以及其他偏好聚合问题。：寻找使用现有信息服务作为实现安全计算的手段以及作为弥合抽象协议和真实系统之间差距的资源的方法。努力程度声明我们注意到夏季的数量建议对首席研究员的支持已减少至每年一个月。在建议的支持水平上，首席研究员将尽一切努力满足项目的原始范围以及他的努力水平。1