2725
3
1
2016-11-10 18:18:24
2016-11-15
應桂林電子科技大學計算機與信息安全學院邀請，中山大學（高雄）范俊逸教授做學術報告，同時我校計算機與信息安全學院劉憶寧教授，鄭彥斌博士也分別做報告，分別是：
講座題目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）利用分段方法構造了有限域上一些置換多項式的逆置換多項式。
