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

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

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.