报告一

报告题目：Oblivious transfer and secure multiparty computation
报告人：    邢朝平  教授  新加坡南洋理工大学
主持人：    李成举
报告时间：2019年1月11 日   周五9:30--10:30  
报告地点：中北校区数学馆201

报告摘要：
In cryptography, an oblivious transfer (OT) protocol is a type of protocol in which a sender transfers one of potentially many pieces of information to a receiver, but remains oblivious as to what piece (if any) has been transferred.
OT is considered one of the critical problems in the field, because of the importance of the applications that can be built based on it. In particular, it is complete for secure multiparty computation: that is, given an implementation of oblivious transfer it is possible to securely evaluate any polynomial time computable function without any additional primitive.
In this talk, we will briefly introduce OT and it’s applications to multiparty computations.

报告人简介：
Chaoping Xing is currently a professor at School of Physical & Mathematical Sciences, Nanyang Technological University. In the May 1990, he got his Ph.D degree in Mathematics from University of Science and Technology of China, Hefei, China. In 2013, he earned the Kloosterman Visiting Chair Professor at Leiden University, The Netherlands. In 2003, he earned the National Science Award (team), Singapore. He was supported by the Hundred Talent Program, China in 2001, and the Alexander von Humboldt Fellow, Germany in 1993.   Currently, his research interests focus on coding theory, cryptography, number theory, algebraic geometry, quasi-Monte Carlo methods. He is the editors of IEEE Trans. on Information Theory, Finite Fields and Their Applications, International Journal of Computer Mathematics. His publications were cited 3600+ times. In the recent five years, he had 17 IEEE-IT journal papers, besides, his research results were published in the top-tier conferences of computer sciences, such as STOC, CRYPTO, SODA.

报告二

报告题目： Explicit construction of optimal locally recoverable codes of distance 5 and 6
报告人：    金玲飞  副教授 复旦大学
主持人：    李成举
报告时间：2019年1月11 日   周五10:30--11:30
报告地点：中北校区数学馆201

报告摘要：
It was shown that the length $n$ of a $q$-ary linear locally recoverable code with distance $d/ge 5$ is upper bounded by $O(dq^3)$. Thus, it is a challenging problem to construct  $q$-ary locally recoverable codes with distance $d/ge 5$ and length approaching the upper bound.  We present an explicit construction of $q$-ary locally recoverable codes of distance $d= 5$ and $6$ via binary constant weight codes.

报告人简介：
金玲飞，复旦大学计算机科学技术学院副教授，硕导。2013年在新加坡南洋理工大学获得博士学位，分别在荷兰的信息科学研究中心和新加坡的南洋理工大学做过博士后。主要研究方向为编码密码，包括经典纠错码，量子纠错码，基于编码的密码等。