东华大学杨庆隆教授学术报告 11月16日下午
发布时间: 2018-11-07 访问次数: 123

报告题目【秘密共享扩展到秘密图像共享的关键问题】
时间:2018年11月16日(星期五)15:00

地点:旗山校区理工北楼601报告厅
主讲:东华大学教授,杨庆隆
主办:数学与信息学院, 福建省网络安全与密码技术重点实验室
参加对象:数信学院感兴趣的教师和研究生


报告人简介:Professor Ching-Nung Yang (杨庆隆) obtained his Ph. D. degree in Electrical Engineering from National Cheng Kung University. His B.S. and M.S. degrees, both were awarded in Department of Telecommunication Engineering from National Chiao Tung University. Dr. Yang served in National Dong Hwa University since 1999. His current title is Professor in Department of Computer Science and Information Engineering. He had been Visiting Professor to University of Missouri Kansas City, University of Milan, and University of Tokyo. He is currently a Fellow of IET (IEE) and an IEEE senior member. Professor Yang has done extensive researches on visual cryptography and secret image sharing, and is the chief scientist in both areas. In fact, a very important innovation of visual cryptography, the probabilistic visual cryptography, was firstly proposed by Professor Yang. His areas of interest include error correcting code, multimedia security, cryptography, and information security. He has authored two books and has published over 200 (including more than 100 SCI-indexed papers) professional research papers in the areas of information security and coding theory. In the meantime, he has served/is serving in international academic organizations. He serves as technical reviewers for over 40 major scientific journals in the areas of his expertise, and serves as editorial boards and editors of special issues for some journals. Also, he was invited as chairs, keynote speakers, and members of program committees for various international conferences. He is the recipient of the 2000, 2006, 2010, 2012, and 2014 Fine Advising Award in the Thesis of Master/PhD of Science awarded by Institute of Information & Computer Machinery( http://sna.csie.ndhu.edu.tw/~cnyang/PDF/james_resume.pdf


报告摘要:Shamir的秘密共享是将秘密分享成n个子秘密,并且可以从任何k个子秘密恢复原始的秘密。但是,不能从(k-1)或更少的子秘密获得任何秘密相关信息。将秘密共享扩展到分享数字图像,就是所谓的秘密图像共享。它的子秘密与原始秘密都是数字图像。 (k, n)秘密图像共享是结合了密码学的秘密共享技术,和数字图像处理方法的重要研究领域。具有特定功能的各种方案提供了多样性的应用。例如,具备认证功能、具备渐进式解密、具有意义的子影像、可共享多个秘密图像等秘密图像共享方案。还有,研究特殊规定的门槛组合,例如,(t, s, k, n)秘密图像共享与(t, k, n)秘密图像共享等。
   这个报告除了介绍秘密图像共享的最新技术,算法,解决方案和应用。主要是说明将秘密共享扩展到秘密图像共享时所需考虑的关键问题: (1) 随机秘密与有意义的秘密(视觉图像)(2) 在多项式哪里嵌入秘密? 常数项,或所有系数 (3) 有限域的选择 (4) 子影像内容,随机或有意义。在这个讲座中,会详细解释这几个关键问题,让大家能对设计、研究秘密图像共享有更深入的了解。