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

提案编号：0716389 PI：Rafail Ostrovsky机构：加州大学洛杉矶分校领导提案编号：0716199 PI：布伦特沃特斯机构：SRI国际子提案编号：0715739 PI：Dan Boneh机构：斯坦福大学子提案编号：0716230 PI：Dawn Song机构：卡内基梅隆大学子标题：协作研究CT-T：搜索和处理加密数据的加密技术在这个建议中，我们考虑的问题是什么构成了密码学中的身份。身份的典型示例包括您的姓名和社会安全号码，或您的指纹/虹膜扫描，或您的地址，或来自某些可信公钥基础设施的（未撤销的）公钥。然而，在许多情况下，你在哪里定义了你的身份。例如，我们知道一个银行出纳员在防弹银行窗口后面的角色，不是因为他或她向我们展示了她的证件，而是仅仅知道她的位置。在这一提议中，我们提出了以下问题：是否有可能让一方的“地理位置”参与确定她所拥有的一套证书？在这种情况下，我们可以实现哪些新的可能性？首先，我们建议考虑这一背景下的中心任务，即，安全地验证设备的位置。尽管在这方面做了很多工作，但我们的初步结果表明，在“香草”（即，标准）模型，上述任务（即，的securepositioning）是不可能实现的。我们建议研究有界存储模型中的位置证明（即我们假设对手的总内存上有一定的界限）。在这种设置中，我们希望实现 两个任务：安全定位和基于位置的密钥交换。虽然过去曾提出安全定位的问题，但没有令人满意的答案。第二个问题（基于位置的密钥交换）在过去还没有被问到。我们还提出了一个更广泛的问题：基于位置的安全多方计算是否可以在这种情况下实现。

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.