Collision-Free Hashing from Lattice Problems.
Electronic Colloquium on Computational Complexity(2011)
摘要
In 1995, Ajtai described a construction of one-way functions whose security is equivalent to the difficulty of some well known approximation problems in lattices. We show that essentially the same construction can also be used to obtain collision-free hashing. This paper contains a self-contained proof sketch of Ajtai's result.
更多查看译文
关键词
one-way function,approximation problem,self-contained proof sketch,lattice problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要