报告题目:　Cryptographic Reverse Firewall via Malleable Smooth Projective Hash Functions.

报告人: 陈荣茂 博士

主持人：张磊 研究员

报告时间：6月2日10:00－11:30

报告地点：中北校区数学馆201

报告人简介：

陈荣茂，博士，国防科技大学计算机学院网络与信息安全研究所助理研究员。2007年进入国防科技大学计算机学院就读本科，2013年受国家留学基金委资助被公派到澳大利亚Wollongong大学计算与信息安全中心攻读博士学位并于2016年9月份毕业回国并留校工作。研究兴趣为网络与信息安全技术，在公钥密码学理论及应用方面具有一定的研究积累，近期主要围绕“后斯诺登密码学”以及可证明安全技术开展相关研究，在CRYPTO17, ASIACRYPT16，CT-RSA16，Designs, Codes and Cryptography和IEEE Transaction on Information Forensics and Security等国际学术会议和期刊上发表学术论文20多篇，并先后担任多个国际学术会议程序委员会委员，以及20多个学术会议和期刊审稿人。(个人学术主页: www.rongmaochen.net)。

报告摘要：

          The revelations of Edward Snowden in 2013 has attracted worldwide attentions. It is shown that the computer machine could be compromised before delivered to the customer and the implemented cryptographic protocol may be even subverted and thus not as secure as thought. Since then, post-snowden cryptography has gradually become a prominent research direction. In Eurocrypt 2015, Mironov and Stephens-Davidowitz proposed a novel concept named Cryptographic Reverse Firewall (CRF) which can resist exfiltration of secret information from an arbitrarily compromised machine. In this talk, I will firstly describe an example of cryptographic protocol subversion attack and then introduce our recent progress on this line of research. Particularly, I will show how to generically construct CRFs for several widely used cryptographic protocols including message-transmission protocol, oblivious signature-based envelope and oblivious transfer protocol. Our work partially answered an open problem raised by Mironov and Stephens-Davidowitz in Eurocrypt 2015 and was published by Asiacrypt 2016.