活动类别：网络信息安全系列学术报告

活动时间：8:30-11:40

活动日期：2019-1-4

地点：长安校区 文津楼三段6层628报告厅

主办单位：ABG欧博网平台登录 网络信息安全团队

活动日程安排:

报告题目一：Secure Data-Sharing Scheme using Verifiable and CCA-Secure Re-encryption from cryptographic Obfuscation

报告时间：8:30-10:00

报告人：张明武 教授

报告内容简介

A cloud-based re-encryption scheme allows a semi-trusted cloud proxy to convert a ciphertext under delegator's public-key into a ciphertext of delegatee's. However, for an untrusted cloud proxy, as the re-encryption program was outsourced on the cloud, the cloud can debug the program and might have illegal activities in practice, such as monitoring the program executing, returning an incorrect re-encryption ciphertext, or colluding with the participants to obtain the sensitive information. In this work, we propose a construction of cloud-based verifiable re-encryption by incorporating new cryptographic primitives of indistinguishability obfuscation and puncturable pseudorandom functions, which can achieve the master-secret security even if the proxy colludes with the delegatee. Furthermore, our scheme can provide the white-box security in re-encryption procedure to implement the sensitive-data protection in the presence of white-box access, and it resists on chosen-ciphertext attacks in both the first-level encryption and the second-level encryption. The decryption is very efficient since it only requires several symmetric PRF operations, which can be deployed and applied in the light-weight security device such as Mobile Phones (MPs), Wireless Body Area Networks (WBANs) and nodes in Internet-of-Things

报告人简介

张明武，博士(后)，博士生导师，湖北省“楚天学者”特聘教授。现任湖北工业大学计算机学院副院长、湖北省中小企业大数据工程技术研究中心主任、湖北工业大学工业大数据协同创新中心主任、大数据安全与隐私保护技术研究中心主任。

主要研究方向为大数据安全与隐私保护技术、敏感信息泄漏下的安全协议、混淆与系统、工业大数据应用等。近年来主持各类科学研究项目20余项，获得省级科技进步二等奖1项(2003)、三等奖1项(2015)，自然科学三等奖1项(2014)，武汉市科技进步二等奖1项(2015)。申请专利30余项(已授权16，公开15项)，获得软件著作权12项。近年来公开出版学术专著2部(独著), 主(副)编教材6本，在国内外学术期刊和会议上公开发表学术论文100余篇，获得国内外学术会议最佳论文奖4次。

报告题目二：An Efficient and Provably Secure Private Polynomial Evaluation Scheme

报告时间：10:10-11:40

报告人：夏喆 副教授

报告内容简介

The Cloud computing technologies have not only provided convenience to ordinary users, but also cause many new security challenges. Among the applications of Cloud Computing, private polynomial evaluation (PPE) allows the service provider to outsource the computation of a polynomial to the cloud server in a verifiable way. And meanwhile, the polynomial remains hidden to the clients who are able to query the service. Recently in ProvSec 2017, Bultel et al. have presented the formal security definitions for PPE, including polynomial protection (PP), proof unforgeability (UNF) and indistinguishability against chosen function attack (IND-CFA). They have introduced a PPE scheme that satisfies all these properties, and they have shown that a polynomial commitment scheme in Asiacrypt 2010, called PolyCommit, enjoys these properties as well. In this paper, we introduce another provably secure PPE scheme, which not only has computational advantages over these two existing ones, but also relies on a much weaker security assumption. Moreover, we further explore how our PPE scheme can be implemented in the distributed fashion, so that a number of cloud servers jointly response to the query, but none of them could learn the polynomial unless they all collude.

报告人简介

夏喆，男，1982年7月出生，博士、武汉理工大学副教授、硕士生导师。2009年获得英国萨里大学(University of Surrey)博士学位，2009年至2013年在英国萨里大学进行博士后研究，2017年至2018年在澳大利亚伍伦贡大学(University of Wollongong)进行访问学习，主要研究方向为密码学和安全协议。夏喆近年来在国际期刊/会议发表学术论文40余篇，曾担任澳大利亚学术委员会（ARC）信息安全方向评审及EVT, RE-VOTE, VOTE-ID 等国际学术会议程序委员会委员（PC Member）。目前担任国际期刊《Journal of Information Security and Application》的副主编（Associate Editor），以及多个信息安全专刊的编委。