Impossibility Results for Indifferentiability with Resets.

IACR Cryptology ePrint Archive(2013)

引用 26|浏览32
暂无评分
摘要
The indifferentiability framework of Maurer, Renner, and Holenstein (MRH) has gained immense popularity in recent years and has proved to be a powerful way to argue security of cryptosystems that enjoy proofs in the random oracle model. Recently, however, Ristenpart, Shacham, and Shrimpton (RSS) showed that the composition theorem of MRH has a more limited scope than originally thought, and that extending its scope required the introduction of resetindifferentiability, a notion which no practical domain extenders satisfy with respect to random
更多
查看译文
关键词
hash functions,random oracle
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要