CT-ISG: Practice-Oriented Provable-Security for Emerging Cryptographic Applications

CT-ISG：新兴密码应用程序的面向实践的可证明安全性

• 批准号: 0524765
• 负责人: Mihir Bellare
• 金额: --
• 依托单位: University of California-San Diego
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2005
• 资助国家: 美国
• 起止时间: 2005-09-01 至 2009-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0524765&HistoricalAwards=false
• 关键词: CT; ISG; Practice; Oriented; Provable

Proposal Number: NSF 0524765TITLE: CT-ISG: Practice-Oriented Provable-Security for Emerging Cryptographic ApplicationsPI: Mihir BellarePractice-oriented provable-security, as developed in the nineties, has been successful at delivering cryptography that is both practical and backed by provable-security guarantees. Several mechanisms designed via this approach, such as HMAC and OAEP, are now widely deployed and standardized. (Eg. HMAC is in Internet security protocols SSL and SSH.) The approach has so far however mostly concentrated on the problems of basic communication. This research moves the approach to higher level protocols; it scales the approach to the next level. The work pinpoints various kinds of practical issues peculiar to high-level protocols and addresses them.Since the fee a server can command for advertising placed on its web site is a function of the number of visits it receives, there is incentive to inflate the count, meaning claim or generate fake visits. This research aims to design accurate and flexible metering schemes to prevent this fraud. It also aims to find more practical means for public-key based broadcast encryption, in particular reducing the burden imposed on the public-key infrastructure by current solutions. It also aims to reduce the occurrence of false positives in current methods for encryption with keyword search, which permits a gateway to route email to different places based on an encrypted keyword. Finally, it aims to improve the efficiency of identity-based cryptography.

提案编号：NSF 0524765 标题：CT-ISG：新兴加密应用程序的面向实践的可证明安全性 PI：Mihir Bellare 面向实践的可证明安全性，如九十年代开发的那样，已成功地提供了既实用又受可证明安全性保证支持的密码学。通过这种方法设计的几种机制（例如 HMAC 和 OAEP）现已得到广泛部署和标准化。 （例如，HMAC 存在于互联网安全协议 SSL 和 SSH 中。）然而，到目前为止，该方法主要集中在基本通信问题上。 这项研究将方法转向更高级别的协议；它将方法提升到一个新的水平。这项工作指出了高级协议特有的各种实际问题并解决了这些问题。由于服务器可以为其网站上放置的广告收取的费用是其接收的访问次数的函数，因此存在夸大计数的动机，这意味着声称或生成虚假访问。本研究旨在设计准确且灵活的计量方案来防止这种欺诈行为。它还旨在为基于公钥的广播加密找到更实用的方法，特别是减轻当前解决方案对公钥基础设施造成的负担。它还旨在减少当前使用关键字搜索进行加密的方法中误报的发生，这允许网关根据加密的关键字将电子邮件路由到不同的地方。最后，它的目标是提高基于身份的密码学的效率。