SGER: Cryptographic Techniques for Trustworthy Computation in Faulty and Non-Confining Execution Environments

SGER：在错误和非限制执行环境中进行可信计算的密码技术

• 批准号: 0808907
• 负责人: Ronald Rivest
• 金额: --
• 依托单位: Massachusetts Institute of Technology
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2008
• 资助国家: 美国
• 起止时间: 2008-09-15 至 2010-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0808907&HistoricalAwards=false
• 关键词: SGER; Cryptographic; Techniques; Trustworthy; Computation

Proposal Number: 0808907PI: Ronald L RivestInstitution: Massachusetts Institute of TechnologyTitle: SGER: Cryptographic Techniques for Trustworthy Computation in Faulty and Non-Confining Execution EnvironmentsThe objective of this exploratory research is to find methods for conducting secure computation within insecure, imperfect, and possibly malicious environments. To realize this goal, two complementary approaches are being pursued. The first one, inspired by the technique of ?proof carrying code,? is a ?Proof-Carrying Data? framework that can address many of the difficulties with current approaches. In this framework, the system designer prescribe the desired properties of the computation?s output, usually expressing a security or privacy property. Proofs of these properties are attached to the data flowing through the system, and are mutually verified by the system?s components. The second research focus is the investigation of means by which concrete realizations of computation can guarantee security properties despite inevitable risks. The novelty in the method is that the assumptions on which the risks are based are enumeratable, so they can be checked to be sure they that are, ideally, minimal, realistic, and verifiable.

提案编号：0808907PI：Ronald L Rivest机构：麻省理工学院标题：SGER：在错误和非限制执行环境中进行可信计算的密码技术这项探索性研究的目的是找到在不安全、不完美和可能恶意的情况下进行安全计算的方法环境。为了实现这一目标，正在采取两种互补的方法。 第一个，受到“携带代码证明”技术的启发，？是“携带证明的数据”吗？框架可以解决当前方法的许多困难。 在此框架中，系统设计者规定了计算输出的所需属性，通常表示安全或隐私属性。 这些属性的证明附加到流经系统的数据中，并由系统组件相互验证。 第二个研究重点是研究计算的具体实现如何在不可避免的风险下保证安全性。 该方法的新颖之处在于，风险所依据的假设是可枚举的，因此可以检查它们以确保它们在理想情况下是最小的、现实的和可验证的。