CT-ISG: New Security Properties for Hash and Trapdoor Functions

该项目的目的是研究散列和陷门函数的性质，这些函数是由实际应用激发的，并且被随机预言机隐含地持有，或者在理想的随机预言机模型中易于实现。但是，没有很好地定义和/或不知道在标准模型中是可实现的。特别是，该研究研究了不可延展的哈希函数和隐藏部分信息的（可能是陷阱门）函数。该项目研究了这些原语的新的适当的安全概念，并寻求可能满足安全定义的结构。所提出的研究结果将有助于理解标准和随机预言模型之间的差距，并给予更多的信心，在安全的实际计划。考虑到NIST正在进行的加密哈希算法竞赛，研究新的安全属性是及时的。该项目的一个组成部分是现代密码学各个方面的持续质量教育。

The project aims at studying properties of hash and trapdoor functions that are motivated by practical applications and are implicitly held by the random oracles or easy to realize in the idealistic random oracle model. But, are not well-defined and/or not known to be realizable in the standard model. In particular, the research studies non-malleable hash functions and (possiblytrapdoor) functions that hide partial information. The project investigates the new appropriate notions of security for these primitives and seeks constructions that probably meet the security definitions. The outcome of the proposed research should help understanding of the gap between the standard and the random oracle model, and give more confidence in security of the practical schemes. Studying new security properties is timely, given NIST's ongoing cryptographic hash algorithm competition. An integral part of the project is continuing quality education on all aspects of modern cryptography.