Collaborative Research: CT-T: Cryptographic Techniques for Searching and Processing Encrypted Data

合作研究：CT-T：用于搜索和处理加密数据的密码技术

• 批准号: 0715739
• 负责人: Dan Boneh
• 金额: $ 16万
• 依托单位: Stanford University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2007
• 资助国家: 美国
• 起止时间: 2007-09-01 至 2011-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0715739&HistoricalAwards=false
• 关键词: Collaborative; Research; CT; Cryptographic; Techniques

Proposal Number: 0716389PI: Rafail OstrovskyInstitution: University of California, Los Angeles LeadProposal Number: 0716199PI: Brent WatersInstitution: SRI InternationalSubProposal Number: 0715739PI: Dan BonehInstitution: Stanford UniversitySubProposal Number 0716230PI: Dawn SongInstitution: Carnegie Mellon UniversitySubTitle: Collaborative Research CT-T: Cryptographic Techniques for Searching and Processing Encrypted DataIn this proposal we consider the question of what constitutes identities in cryptography. Typical examples of identities include your name and your social-security number, or your fingerprint/iris-scan, or your address, or your (non-revoked) Public-Key coming from some trusted public-key infrastructure. In many situations, however, where you are defines your identity. For example, we know the role of a bank-teller behind a bullet-proof bank window not because he or she shows us hercredentials but by merely knowing her location. In this proposal, we ask the following question: is it possible to have the "geographical position" of a party take part in defining the set of credentialsshe has? What are the new possibilities in terms of what we can achieve in this setting?First, we propose to consider the central task in this setting, i.e.,securely verifying the position of a device. Despite much work in this area, we have preliminary results that show that in the "vanilla" (i.e., standard) model, the above task (i.e., of securepositioning) is impossible to achieve.We propose to study the proof of position in the bounded storage model (i.e. where we assume some bound on the total memory of the adversary).In this setting, we wish to achieve two tasks: secure positioning, and position-based key exchange. While the question of secure positioning has been asked in the past, no satisfactory answers exist. The second question (of position-based key exchange) has not been asked in the past. We also ask a broader question: whether position-based Secure Multi-Party Computation can be achieved in this setting.

Proposal Number: 0716389PI: Rafail OstrovskyInstitution: University of California, Los Angeles LeadProposal Number: 0716199PI: Brent WatersInstitution: SRI InternationalSubProposal Number: 0715739PI: Dan BonehInstitution: Stanford UniversitySubProposal Number 0716230PI: Dawn SongInstitution: Carnegie Mellon UniversitySubtitle：协作研究CT-T：用于搜索和处理加密数据的加密技术本提案我们考虑了什么构成密码学中身份的问题。身份的典型示例包括您的姓名和社交安全号码，指纹/虹膜扫描，地址，或您（未撤销的）公开键来自一些受信任的公共钥匙基础架构。但是，在许多情况下，您被定义了您的身份。例如，我们知道一位银行窗户后面的银行电信者的角色不是因为他或她向我们展示了梅切尔斯的，而只是知道她的位置。在此提案中，我们提出以下问题：是否有可能使一方的“地理位置”参与定义一组凭证？就我们在​​本环境中可以实现的目标而言，新的可能性是什么？首先，我们建议在此设置中考虑中心任务，即安全验证设备的位置。尽管在这一领域工作了很多，但我们的初步结果表明，在“香草”（即标准）模型中，无法实现上述任务（即安全定位）。我们建议研究有限存储模型中的位置证明证明（即，在此设置的整体内存下，我们都会在此设置上实现两个任务，以实现两个任务。尽管过去曾提出过安全定位的问题，但没有令人满意的答案。过去（基于位置的密钥交换）的第二个问题过去曾被问到。我们还提出了一个更广泛的问题：在这种情况下，是否可以实现基于位置的安全多方计算。