2507
3
1
2016-11-10 18:18:24
2016-11-15
應(yīng)桂林電子科技大學(xué)計(jì)算機(jī)與信息安全學(xué)院邀請,，中山大學(xué)（高雄）范俊逸教授做學(xué)術(shù)報(bào)告,，同時(shí)我校計(jì)算機(jī)與信息安全學(xué)院劉憶寧教授，鄭彥斌博士也分別做報(bào)告,，分別是：
講座題目1：Privacy-Enhanced Data Aggregation Scheme Against Internal Attackers in Smart Grid
講 座 人：范俊逸教授
報(bào)告摘要：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.
報(bào)告人簡介：范俊逸,，中山大學(xué)（高雄）教授,，曾擔(dān)任許多重要國際會(huì)議主席與委員、國際期刊編輯委員,、學(xué)術(shù)組織及政府部門咨詢委員,，目前擔(dān)任資訊安全學(xué)會(huì)副理事長。范教授研究領(lǐng)域包括密碼學(xué),、信息與通訊安全,、云端及大數(shù)據(jù)安全等。
講座題目2：A Robust Electronic Voting Scheme Against Side Channel Attack
講 座 人：劉憶寧教授
報(bào)告摘要：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：有限域上置換多項(xiàng)式的構(gòu)造問題研究
講 座 人：鄭彥斌博士
報(bào)告摘要：有限域上置換多項(xiàng)式（函數(shù)）是有限域到自身的雙射,，每個(gè)置換多項(xiàng)式都有一個(gè)與之對應(yīng)的逆置換多項(xiàng)式,。密碼學(xué)中加密算法和解密算法互為逆運(yùn)算，從而有限域上置換多項(xiàng)式及其逆置換多項(xiàng)式的構(gòu)造問題是密碼學(xué)的研究熱點(diǎn)之一,。近年來kbary-Ghioca-Wang（AGW）準(zhǔn)則和分段方法是構(gòu)造有限域上置換多項(xiàng)式的兩個(gè)主流方法,。然而，構(gòu)造滿足特定條件的交換圖是應(yīng)用AGW 準(zhǔn)則時(shí)的困難問題,，尋找有效算法計(jì)算置換多項(xiàng)式的逆置換多項(xiàng)式也是一個(gè)難題,。我們主要對這兩個(gè)難題進(jìn)行了研究，獲得了一些結(jié)果,，具體包括：（1）構(gòu)造了有限域上一個(gè)性質(zhì)良好的交換圖,，進(jìn)而應(yīng)用 AGW 準(zhǔn)則構(gòu)造了有限域上新類型的置換多項(xiàng)式；（2）利用分段方法構(gòu)造了有限域上一些置換多項(xiàng)式的逆置換多項(xiàng)式,。
