当前位置: 网站首页 > 正文
Tight Reduction in Lattices
作者:    摄影:    发布时间:2019-05-22    阅读:

报告题目:Tight Reduction in Lattices

时间:2019523日上午9点半

地点:文津楼3628研讨室

内容简介:Achieving tight security is an important task in understanding the power (and limitation) of provable security theory. In the setting of lattices, a super-polynomial modulus seems to be necessary in all prior work in achieving (almost) tight security for primitives that allow the adversary to conduct queries, such as PRF, IBE, and Signatures. It is important to further determine whether a super-polynomial modulus is inherent in achieving (almost) tight security.

In this talk, I will talk about some new ideas that break the super-polynomial barrier in prior work. Particularly, I will focus on the setting of IBE, and discuss other related tight primitives.

主讲人简介:Feng-Hao Liu(刘峰豪),美国佛罗里达大西洋大学教授,博士生导师。Feng-Hao Liu教授在美国布朗大学取得博士学位,并曾在美国马里兰大学从事博士后研究工作。Feng-Hao Liu教授的研究方向包括密码学、计算复杂理论,尤其是在抗泄露公钥密码、不可延展编码、基于格的公钥密码方案设计方面做出了出色的工作,其研究成功发表于相关领域的顶级会议和期刊CRYPTOEurocryptTCCCCSPKCJournal of Cryptology等,并获得TCC 2010最佳学生论文奖,此外Feng-Hao Liu教授还曾担任多个顶级国际会议AsiacryptPKC等的审稿人。