Understanding Fairness in Secure Two-Party and Multi-Party Computation

了解安全两方和多方计算中的公平性

• 批准号: 0830464
• 负责人: Jonathan Katz
• 金额: $ 27.78万
• 依托单位: University of Maryland, College Park
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2008
• 资助国家: 美国
• 起止时间: 2008-09-01 至 2013-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0830464&HistoricalAwards=false
• 关键词: Understanding; Fairness; Secure; Two; Party

In the setting of secure computation, a set of mutually distrusting parties wish to compute some function of their inputs while preserving security properties such as privacy, correctness, etc. One important property is fairness, which roughly means that if anyone learns the result of the computation, then everyone does.It has been known since the mid-1980s that complete fairness is impossible, in general, without a strict majority of honest parties. For over 20 years, the accepted folklore has been that nothing non-trivial can be computed with complete fairness without an honest majority. Recent work of the PI and others shows that this folklore is false, and demonstrates that the question of fairness in secure computation is wide open.This project seeks to expand the initial feasibility results (or prove corresponding impossibility results) and to develop a better understanding of fairness in cryptographic protocols more generally. This includes work on partial fairness, as well as exploring rationality as a means of obtaining fairness. The educational component of this project will focus on graduate student education and outreach efforts to the broader research community.

在安全计算的环境中，一组相互不信任的各方希望计算他们输入的某个函数，同时保持安全属性，如隐私，正确性等。一个重要的属性是公平性，这大致意味着如果任何人知道计算结果，那么每个人都知道。自20世纪80年代中期以来，人们已经知道完全公平是不可能的，一般来说，如果没有绝对多数的诚实政党20多年来，公认的民间传说一直是，没有诚实的大多数，任何重要的东西都不能完全公平地计算。PI和其他人最近的工作表明，这种民间传说是错误的，并表明，在安全计算的公平性问题是广泛开放的。这个项目旨在扩大最初的可行性结果（或证明相应的不可能性结果），并发展更好地理解更普遍的加密协议的公平性。这包括部分公平的工作，以及探索合理性作为获得公平的手段。该项目的教育部分将侧重于研究生教育和与更广泛的研究界的外联工作。