Security Proof forEncryption under
报告人：Prof. Yi Mu
时间：9:30 a.m. on Monday, March 26th, 2018
地点：ROOM F804, New Main Building
Theindistinguishability (IND) security of a public-key cryptosystem can be reducedto a computational hard assumption in the random oracle model, where thesolution to a computational hard problem is hidden in one of the adversary’squeries to the random oracle. It is worth to take a closer look at how an INDsecurity can be based on a computational assumption, since a computationalproblem is believed harder than its corresponding decisional problem. In thistalk, I will present the method of programming security reductions based on acomputational assumption and provide some comprehensive examples to guide theparticipants towards the understanding of this type of security reductions.
Professor Yi Mureceived his PhD from the Australian National University in 1994. He iscurrently a full professor at University of Wollongong, Australia. He was theHead of School of Computer Science and Software Engineering at University ofWollongong (UOW) during 2011-2015. His current research interest includescryptography, information security and quantum cryptography. He has publishedover 450 research papers, including over 180 journal papers and many papers attop-tier cryptography and security conferences such as Crypto, Eurocrypt,Asiacrypt, PKC, FSE, CT-RSA, ESORIS, etc. He has served as program chair andmember of program committee over 200 conferences including ACM CCS, ESORICS,ACISP, AisaCCS, etc. Professor Yi Mu is the editor-in-chief of InternationalJournal of Applied Cryptography and serves as associate editor for severalother international journals. He is a senior member of the IEEE. Furtherinformation about Professor Mu can be found at http://www.uow.edu.au/~ymu.