Theory and Practice of Secure Computation

安全计算理论与实践

基本信息

  • 批准号:
    0728937
  • 负责人:
  • 金额:
    --
  • 依托单位:
  • 依托单位国家:
    美国
  • 项目类别:
    Continuing Grant
  • 财政年份:
    2007
  • 资助国家:
    美国
  • 起止时间:
    2007-09-01 至 2011-08-31
  • 项目状态:
    已结题

项目摘要

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

项目成果

期刊论文数量(0)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ monograph.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ sciAawards.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ conferencePapers.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ patent.updateTime }}

Eric Allender其他文献

NL-printable sets and Nondeterministic Kolmogorov Complexity
NL 可打印集和非确定性柯尔莫哥洛夫复杂度
  • DOI:
    10.1016/s1571-0661(04)80838-7
  • 发表时间:
    2003
  • 期刊:
  • 影响因子:
    0
  • 作者:
    Eric Allender
  • 通讯作者:
    Eric Allender
Uniform derandomization from pathetic lower bounds
从可悲的下限进行统一去随机化
Curiouser and Curiouser: The Link between Incompressibility and Complexity
  • DOI:
    10.1007/978-3-642-30870-3_2
  • 发表时间:
    2012-06
  • 期刊:
  • 影响因子:
    0
  • 作者:
    Eric Allender
  • 通讯作者:
    Eric Allender
Complexity of Regular Functions
常规函数的复杂性
  • DOI:
    10.1007/978-3-319-15579-1_35
  • 发表时间:
    2015
  • 期刊:
  • 影响因子:
    0
  • 作者:
    Eric Allender;Ian Mertz
  • 通讯作者:
    Ian Mertz
New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems
关于电路最小化的(非)难度及相关问题的新见解

Eric Allender的其他文献

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

{{ truncateString('Eric Allender', 18)}}的其他基金

AF: Small: Algebraic Methods in Codes and Computation
AF:小:代码和计算中的代数方法
  • 批准号:
    1909683
  • 财政年份:
    2019
  • 资助金额:
    --
  • 项目类别:
    Standard Grant
AF: Small: Computational Complexity Theory and Circuit Complexity
AF:小:计算复杂性理论和电路复杂性
  • 批准号:
    1909216
  • 财政年份:
    2019
  • 资助金额:
    --
  • 项目类别:
    Standard Grant
AF: Student Travel to Clay Mathematics Institute Complexity Workshop
AF:学生前往克莱数学研究所复杂性研讨会
  • 批准号:
    1809703
  • 财政年份:
    2018
  • 资助金额:
    --
  • 项目类别:
    Standard Grant
EAGER: AF: New approaches to hardness for circuit minimization
EAGER:AF:电路最小化硬度的新方法
  • 批准号:
    1555409
  • 财政年份:
    2015
  • 资助金额:
    --
  • 项目类别:
    Standard Grant
AF: Medium: Collaborative Research: Information Compression in Algorithm Design and Statistical Physics
AF:媒介:协作研究:算法设计和统计物理中的信息压缩
  • 批准号:
    1514164
  • 财政年份:
    2015
  • 资助金额:
    --
  • 项目类别:
    Standard Grant
AF: Medium: Computational Complexity Theory and Circuit Complexity
AF:中:计算复杂性理论和电路复杂性
  • 批准号:
    1064785
  • 财政年份:
    2011
  • 资助金额:
    --
  • 项目类别:
    Standard Grant
Computational Complexity Theory and Circuit Complexity
计算复杂性理论和电路复杂性
  • 批准号:
    0830133
  • 财政年份:
    2008
  • 资助金额:
    --
  • 项目类别:
    Continuing Grant
FRG: Collaborative Research: Algorithmic Randomness
FRG:协作研究:算法随机性
  • 批准号:
    0652582
  • 财政年份:
    2007
  • 资助金额:
    --
  • 项目类别:
    Continuing Grant
Computational Complexity Theory and Circuit Complexity
计算复杂性理论和电路复杂性
  • 批准号:
    0514155
  • 财政年份:
    2005
  • 资助金额:
    --
  • 项目类别:
    Continuing Grant
Computational Complexity Theory and Circuit Complexity
计算复杂性理论和电路复杂性
  • 批准号:
    0104823
  • 财政年份:
    2001
  • 资助金额:
    --
  • 项目类别:
    Standard Grant

相似海外基金

SaTC: CORE: Medium: Collaborative: Theory and Practice of Cryptosystems Secure Against Subversion
SaTC:核心:媒介:协作:密码系统安全防范颠覆的理论与实践
  • 批准号:
    1801470
  • 财政年份:
    2018
  • 资助金额:
    --
  • 项目类别:
    Continuing Grant
SaTC: CORE: Medium: Collaborative: Theory and Practice of Cryptosystems Secure Against Subversion
SaTC:核心:媒介:协作:密码系统安全防范颠覆的理论与实践
  • 批准号:
    1801487
  • 财政年份:
    2018
  • 资助金额:
    --
  • 项目类别:
    Continuing Grant
SaTC: CORE: Medium: Collaborative: Theory and Practice of Cryptosystems Secure Against Subversion
SaTC:核心:媒介:协作:密码系统安全防范颠覆的理论与实践
  • 批准号:
    1801492
  • 财政年份:
    2018
  • 资助金额:
    --
  • 项目类别:
    Continuing Grant
SaTC: CORE: Medium: Collaborative: Theory and Practice of Cryptosystems Secure Against Subversion
SaTC:核心:媒介:协作:密码系统安全防范颠覆的理论与实践
  • 批准号:
    1801479
  • 财政年份:
    2018
  • 资助金额:
    --
  • 项目类别:
    Continuing Grant
Understanding drivers of reduced forest resilience using the Long-Term Soil Productivity test sites: Informing best practice management to secure the mid- and long-term forest industry.
使用长期土壤生产力试验场了解森林恢复力下降的驱动因素:为最佳实践管理提供信息,以确保中长期林业的发展。
  • 批准号:
    444428-2013
  • 财政年份:
    2015
  • 资助金额:
    --
  • 项目类别:
    Alexander Graham Bell Canada Graduate Scholarships - Doctoral
Understanding drivers of reduced forest resilience using the Long-Term Soil Productivity test sites: Informing best practice management to secure the mid- and long-term forest industry.
使用长期土壤生产力试验场了解森林恢复力下降的驱动因素:为最佳实践管理提供信息,以确保中长期林业的发展。
  • 批准号:
    444428-2013
  • 财政年份:
    2014
  • 资助金额:
    --
  • 项目类别:
    Alexander Graham Bell Canada Graduate Scholarships - Doctoral
Understanding drivers of reduced forest resilience using the Long-Term Soil Productivity test sites: Informing best practice management to secure the mid- and long-term forest industry.
使用长期土壤生产力试验场了解森林恢复力下降的驱动因素:为最佳实践管理提供信息,以确保中长期林业的发展。
  • 批准号:
    444428-2013
  • 财政年份:
    2013
  • 资助金额:
    --
  • 项目类别:
    Alexander Graham Bell Canada Graduate Scholarships - Doctoral
Secure web-based intake and tracking tools for CAM research and clinical practice
用于 CAM 研究和临床实践的安全网络摄入和跟踪工具
  • 批准号:
    7912807
  • 财政年份:
    2010
  • 资助金额:
    --
  • 项目类别:
NeTS: Small: Design and Initialization of Secure Wireless Networks: Foundations and Practice
NetS:小型:安全无线网络的设计和初始化:基础和实践
  • 批准号:
    1018464
  • 财政年份:
    2010
  • 资助金额:
    --
  • 项目类别:
    Standard Grant
CAREER: Practice-oriented provably secure information hiding
职业:面向实践的可证明安全的信息隐藏
  • 批准号:
    0546162
  • 财政年份:
    2006
  • 资助金额:
    --
  • 项目类别:
    Continuing Grant
{{ showInfoDetail.title }}

作者:{{ showInfoDetail.author }}

知道了