题 目： Secure Network Function Computation for Linear Functions: Source Security
主讲人：光炫
时 间：2022年06月16日9:00-10:00
地 址：腾讯会议ID：838-994-462
摘要：In this talk, we put forward the model of secure network function computation. In this model, a target function, of which the inputs are generated at multiple source nodes, is required to be computed with zero error at a sink node over a network while being protected from a wiretapper who can access any one but not more than one wiretap set in a given collection of wiretap sets. The secure computing rate of a secure network code is the average number of times the target function can be securely computed with zero error for one use of the network. However, characterizing this secure capacity with this general setup is overwhelmingly difficult. In this talk we focus on the secure model for linear functions with the wiretapper being able to eavesdrop any subset of edges in the network up to a certain size, referred to as the security level. We prove an upper bound on the secure computing capacity, which is applicable to arbitrary network topologies and arbitrary security levels. We further provide a graph-theoretic approach to efficiently compute the upper bound thus obtained. Also, we discover a surprising fact that for some models, there is no penalty on the secure computing capacity compared with the computing capacity without security consideration. Furthermore, we present a systematic construction of (function-computing) linear secure network codes. This code construction implies a lower bound on the secure computing capacity. We further give some sufficient conditions in terms of the network topology on the tightness of the lower bound. Together with the obtained upper bound, the secure computing capacities for multiple classes of security models can be fully characterized.
主讲人简介：光炫博士，南开大学数学科学学院教授，入选国家级青年人才项目及南开大学百名青年学科带头人培养计划。2012年毕业于南开大学陈省身数学研究所，获博士学位，其中2011年1月至2012年8月在美国南加州大学从事联合培养博士（留学基金委和美国自然科学基金资助）。2015年11月至2018年11月在香港中文大学网络编码研究所从事研究工作（香江学者）。光炫博士的研究领域为信息论、编码理论与密码学；目前的研究兴趣为面向函数计算的信息论、网络编码和信息论安全。近年来完成一部学术专著Linear Network Error Correction Coding，由德国Springer出版社出版发行；发表学术论文40余篇，其中在信息论权威期刊IEEE Trans. Inf. Theory上发表论文7篇；在通信及信息安全领域的权威期刊或会议上（如IEEE J. Sel. Areas Commun., IEEE Trans. Commun., USENIX Security等）发表论文7篇。研究成果获多个国内外会议的最佳论文奖。2021获天津数学与统计联合学术年会“青年学者奖”；2018年获得中国电子学会“信息论青年新星奖”；入选天津市“131创新人才计划”第二梯队人选；2016年入选“香江学者计划”；2014入选天津市“三年千人”高层次人才计划。
邀请人：方伟军
审核人：魏普文
