报告题目：Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction
报告日期及时间：2016年12月09日下午15:00
报告地点： B404
报告人：Prof. Yi Mu
报告人单位：University of Wollongong
报告人简介：Professor Yi Mu received his PhD from the Australian National University in 1994. He is currently a full professor and Director of Centre for Computer and Information Security Research at University of Wollongong, Australia. He was the Head of School of Computer Science and Software Engineering at University of Wollongong during 2011-2015. His current research interest includes cryptography, information security and quantum cryptography. He has published over 400 research papers, including over 160 journal papers and many papers at top-tier cryptography conferences such as Eurocrypt, Asiacrypt, PKC, CT-RSA, FSE, etc. He has served as program chair and member of program committee over 200 conferences including ACM CCS, ESORICS, ACISP, AisaCCS, etc. and is currently a member of the steering committees of AsiaCCS, CANS and ProvSec. Professor Yi Mu is the editor-in-chief of International Journal of Applied Cryptography and serves as associate editor for nine other international journals. He is a senior member of the IEEE. Further information about Professor Yi Mu can be found at http://www.uow.edu.au/~ymu
报告摘要：The indistinguishability security of a public-key cryptosystem can be reduced to a computational hard assumption in the random oracle model, where the solution to a computational hard problem is hidden in one of the adversary’s queries to the random oracle. Usually, there is a finding loss in finding the correct solution from the query set, especially when the decisional variant of the computational problem is also hard. The problem of finding loss must be addressed towards tight(er) reductions under this type. In this talk, I will introduce a universal approach for finding loss, namely Iterated Random Oracle, which can be applied to all computational assumptions. The finding loss in the approach is very small. For queries to the random oracle, the success probability of finding the correct solution from the query set will be as large as 1/64 compared to by a random pick. The security reduction is very tight due to a small finding loss. The transformation does not expand the ciphertext size.
邀请人： 唐明教授，何德彪副教授
