当前位置: 66.133.86.54 >> 学术活动 >> 正文
讲座:Combinatorics in Information-Theoretic Cryptograph

主讲人:王华雄

主讲人工作单位:新加坡南洋理工大学

时间2017年12月25日 9:00

地点:科学楼201

主讲人简介:王华雄教授 现为新加坡南洋理工大学数学系主任。1996年在以色列海法大学获得数学博士学位,2001年在澳大利亚卧龙岗大学获得计算机科学博士学位。主要从事密码学、信息安全、组合论、编码理论以及计算机科学等方面的研究。近五年以来,在顶级期刊和国际学术会议上发表学术论文40余篇,例如:Journal of Cryptology, IEEE Transactions on Information Theory, Mathematics of Computation, IEEE Transactions on Parallel and Distributed Systems, Journal of Computer and System Sciences, Crypto, Eurocrypt, Asisacrypt, PKC, FSE, CHES,等等;学术论文在“Google Scholar Citations”他引二千多次。出版专著6册,其中由世界著名出版社CRC出版的《Algebraic Curves in Cryptography》一书是该领域系统研究代数曲线在密码学多个分支应用的第一本专著。担任Designs, Codes and CryptographyJournal of Communications and NetworksInternational Journal of Foundations of Computer Science Journal of Cryptographic Research国际学术期刊的编委;他是20135届亚洲数学大会的特邀报告者及2017年亚洲密码年会特邀报告者。

 

讲座主要内容:

Information-theoretic cryptography is an area that studies cryptographic functionalities whose security does not rely on hardness assumptions from computational intractability of mathematical problems. It covers a wide range of crypto research topics such as one time pad, authentication code, secret sharing schemes, secure multiparty computation, private information retrieval and post-quantum security, just to mention a few. Moreover, many areas in computational cryptography are well known to stem and/or benefit from information-theoretic methods. On the other hand, combinatorics has been playing an active role in cryptography, for example, the hardness of Hamiltonian cycle existence in graph theory is used to design zero-knowledge proof protocols. In this talk, Prof. Wang will focus on the connections between combiantorics and information-theoretic cryptography. After a brief and incomplete overview on their various connections, Prof. Wang will present a few concrete examples to illustrate how combinatorial objects and techniques are applied to the constructions and characterizations of information-theoretic schemes.

 

组织单位:数学与金融学院