当前位置: 主页 > 专家讲坛 >

Public Key Encryption with Keyword Search against Insider Attack

时间:2015-12-14 11:55点击:
讲座名称 Public Key Encryption with Keyword Search against Insider Attack
讲座时间 2015-12-20 09:00:00
讲座地点 南校区信远楼II 206
讲座人 Yi Mu
讲座人介绍

  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. Prior to joining University of Wollongong, he was a senior lecturer in the Department of Computing, Macquarie University. He also worked in the Department of Computing and IT, University of Western Sydney as a lecturer. He has been with the University of Wollongong since 2003. His current research interest includes cryptography, information security and quantum cryptography. He has published over 380 research papers, including over 140 journal papers. His research has been funded by Australian Research Council and industry. 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 including Information Sciences, The Computer Journal, etc. 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 ciphertext retrieval is of paramount importance for data confidentiality and utilization. Thanks to bilinear-pairing-based cryptography, searching in an encrypted data has become a reality. The most common application of searchable encryption is cloud storage systems, where an honest-but-curious server manages the storage system and is able to find correct text from an encryption without decrypting it. Although the security against outsiders can be achieved, the most challenging task is to resist the so-called insider attack from the untrusted cloud storage server, who can actively guess the encrypted text with high probability. In this talk, the security models of searchable encryption such as secure channel free and insider attack will be discussed. A novel framework to resist inside attacks will be introduced. In addition, a discussion will be presented to show how to reduce the computational cost of searchable encryption with pre-computation.

(责任编辑:学术年会)
------分隔线----------------------------