应网络空间安全学院李丽香教授邀请，加拿大纽布伦斯威克大学陆荣幸副教授和香港大学数学学院韩光跃教授将于9月11日（星期日）作线上学术报告。欢迎感兴趣的师生踊跃参加！
腾讯会议ID：785 427 681
报告题目1：Towards Efficient and Privacy-Preserving Interval Skyline Queries over Time Series Data
主讲人：陆荣幸副教授
报告时间：北京时间9月11日（星期日）上午8:40—9:40
主讲人介绍：
陆荣幸，IEEE Fellow，万事达卡物联网研究主席，大学研究学者，加拿大纽布伦斯威克大学计算机科学系副教授。2013年4月-2016年8月，他在新加坡南洋理工大学电气与电子工程学院担任助理教授。2012年5月-2013年4月，他在加拿大滑铁卢大学做博士后研究工作。2012年，他在加拿大滑铁卢大学电气与计算机工程学院获得博士学位，并荣获最负盛名的总督金质奖章（Governor General's Gold Medal）。2013年，他获得第八届IEEE通信协会亚洲太平洋杰出年轻学者奖。他的研究方向为应用密码学、隐私增强技术、物联网大数据安全和隐私保护等。他在自己的专业领域发表了400多篇论文。根据2022年5月谷歌学者数据，他谷歌引用为26000多次，H指数为79。他在著名期刊和会议上获得9个最佳（学生）论文奖。他现在担任IEEE通信与信息安全技术委员会系列国际会议的主席，他还是IEEE TEMS区块链和分布式账本技术的创始联席主席。他获2016-2017年度加拿大纽布伦斯威克大学优秀教学奖。2022年Research.com网站计算机领域排名前1000的科学家，他的世界排名为572名，在加拿大排名为22名。
报告内容摘要：
Outsourcing encrypted time series data and query services to a cloud has been widely adopted by data owners for economic considerations. However, it inevitably lowers data utility and query efficiency. Existing secure skyline query schemes either leak critical information or are inefficient. In this paper, we propose an efficient and privacy-preserving interval skyline query scheme by employing symmetric homomorphic encryption (SHE). Specifically, we first devise a secure sort protocol to sort the encrypted dataset and a secure high-dimensional dominance check protocol to securely determine dominance relations of time series data, in which a dominance check tree is presented. With these secure protocols, we propose our secure skyline computation protocol that can ensure both security and efficiency. Furthermore, to deal with the characteristics of time series data, we design a look-up table to index time series for quick query response. The security analysis shows that our proposed scheme can protect outsourced data, query results, and single-dimensional privacy and hide access patterns. In addition, we evaluate our proposed scheme and compare the core component of our scheme with the state-of-the-art solution, and the results indicate that our protocol outperforms the compared solution by two orders of magnitude in the computational cost and at least 23x in the communication cost.
报告题目2：On Sampling Continuous-Time AWGN Channels
主讲人：韩光跃教授
报告时间：北京时间9月11日（星期日）上午9:40—10:40
主讲人介绍：
韩光跃教授分别于1997年和2000年获得北京大学的学士和硕士学位，于2004年在美国圣母大学获得博士学会。2004-2007年，他在加拿大不列颠哥伦比亚大学的数学学院工作了3年。2007年，他任职于香港大学的数学学院，他主要的研究领域是编码和信息论。
报告内容摘要：
For a continuous-time additive white Gaussian noise (AWGN) channel with possible feedback, it has been shown that as sampling gets infinitesimally fine, the mutual information of the associative discrete-time channels converges to that of the original continuous-time channel. We give in this paper more quantitative strengthenings of this result, which, among other implications, characterize how over-sampling approaches the true mutual information of a continuous-time Gaussian channel with bandwidth limit. The assumptions in our results are relatively mild. In particular, for the non-feedback case, compared to the Shannon-Nyquist sampling theorem, a widely used tool to connect continuous-time Gaussian channels to their discrete-time counterparts that requires the band-limitedness of the channel input, our results only require some integrability conditions on the power spectral density function of the input.
