异步公共子集：最优复杂度与后量子安全
主讲人：Qiang Tang 副教授 悉尼大学
讲座时间：6月23日（周二）14:30-16:00
讲座地点：电子科技大学清水河校区 品学楼B108
主讲人简介：Qiang Tang is an Associate Professor at the University
of Sydney and a Theme Lead of the ARC Centre of Excellence MathQuEST. His research
spans applied and theoretical cryptography and distributed protocols, with work
appearing in flagship venues across cryptography, security, and distributed
computing, and receiving multiple best/distinguished paper awards.
讲座内容：Asynchronous common subset (ACS) is a fundamental
primitive underlying asynchronous consensus, and secure multiparty computation.
In this talk, I will present two major progress on ACS. The first resolves a
long-standing open problem by achieving optimal complexity, showing that the
*efficiency barrier* for ACS can be overcome using cryptographic tools. The second
goes one step further, and constructs near optimal ACS using only hash
functions, and thereby obtaining post-quantum security and more. We will also
discuss remaining major open problems.
