Multi-Collision Resistance: A Paradigm for Keyless Hash Functions

STOC '18: Symposium on Theory of Computing Los Angeles CA USA June, 2018, pp. 671-684, 2018.

被引用34|引用|浏览81|DOI:https://doi.org/10.1145/3188745.3188870
EI
其它链接dblp.uni-trier.de|academic.microsoft.com|dl.acm.org

摘要

We introduce a new notion of multi-collision resistance for keyless hash functions. This is a natural relaxation of collision resistance where it is hard to find multiple inputs with the same hash in the following sense. The number of colliding inputs that a polynomial-time non-uniform adversary can find is not much larger than its advice...更多

代码

数据

您的评分 :
0

 

标签
评论