应桂林电子科技大学计算机与信息安全学院邀请，中山大学（高雄）范俊逸教授做学术报告，同时我校计算机与信息安全学院刘忆宁教授，郑彦斌博士也分别做报告，分别是：
       讲座题目1：Privacy-Enhanced Data Aggregation Scheme Against Internal Attackers in Smart Grid
       讲 座 人：范俊逸教授
       报告摘要：According to related research, energy consumption can be effectively reduced by using energy management information of smart grids. In smart grid architecture, electricity suppliers can monitor, predicate, and control energy generation/consumption in real time. Users can know the current price of electrical energy and obtain energy management information from smart meters. It helps users reduce home’s energy use. However, electricity consumptions of users may divulge the privacy information of users. Therefore, privacy of users and communication security of the smart grid become crucial security issues. This paper presents a secure power-usage data aggregation scheme for smart grid. Electricity suppliers can learn about the current power usage of each neighborhood to arrange energy supply and distribution without knowing the individual electricity consumption of each user. This is the first scheme against internal attackers, and it provides secure batch verification. Additionally, the security of the proposed scheme is demonstrated by formal proofs.
        报告人简介：范俊逸，中山大学（高雄）教授，曾担任许多重要国际会议主席与委员、国际期刊编辑委员、学术组织及政府部门咨询委员，目前担任资讯安全学会副理事长。范教授研究领域包括密码学、信息与通讯安全、云端及大数据安全等。
        讲座题目2：A Robust Electronic Voting Scheme Against Side Channel Attack
        讲 座 人：刘忆宁教授
        报告摘要：A challenging task in the design of secure e-voting system is that a voter could verify whether his vote is recorded and counted correctly, while he has no evidence to prove his ballot in order to prevent a malicious voter from selling his vote. Bingo Voting scheme has been proposed to achieve the verifiability and coercion-resistance; however, it has a weakness, which could still lead to vote selling due to a potential of side channel attack. A malicious voter could take a picture of the fresh random number displayed in the voting booth using a secret camera, and then prove to others which candidate he has selected. In this paper, we propose an improved voting scheme, which does not require a trusted random number generator and eliminates the side channel attack, while our scheme still retains the properties of verifiability and coercion-resistance. It also allows the voter to check whether the receipt is correct even after he has left the voting booth. 
        讲座题目3：有限域上置换多项式的构造问题研究
        讲 座 人：郑彦斌博士
        报告摘要：有限域上置换多项式（函数）是有限域到自身的双射，每个置换多项式都有一个与之对应的逆置换多项式。密码学中加密算法和解密算法互为逆运算，从而有限域上置换多项式及其逆置换多项式的构造问题是密码学的研究热点之一。近年来kbary-Ghioca-Wang（AGW）准则和分段方法是构造有限域上置换多项式的两个主流方法。然而，构造满足特定条件的交换图是应用AGW 准则时的困难问题，寻找有效算法计算置换多项式的逆置换多项式也是一个难题。我们主要对这两个难题进行了研究，获得了一些结果，具体包括：（1）构造了有限域上一个性质良好的交换图，进而应用 AGW 准则构造了有限域上新类型的置换多项式；（2）利用分段方法构造了有限域上一些置换多项式的逆置换多项式。