報告題目：Efficient and Privacy-Preserving Similarity Query with Access Control in eHealthcare
報告時間：2023年4月17日 9:00~10:00
報告地點：伟德国际BETVlCTOR中心校區王湘浩樓A521
報告人：鄭豔冬
報告人簡介：
鄭豔冬，西安電子科技大學網絡與信息安全學院副教授，2022年博士畢業于加拿大新布倫瑞克大學，導師IEEE Fellow Rongxing Lu教授，研究方向是應用密碼學、數據安全與隐私保護。近5年，在國際期刊和會議發表論文60餘篇，其中以第一作者身份發表論文23篇，包括IEEE TIFS, IEEE TDSC, IEEE TSC等CCF A類論文11篇（含高被引論文1篇）、中科院一區論文3篇，主持國家重點研發計劃子課題、陝西省秦創原高層次創新創業人才、陝西省科學基礎研究計劃等多項國家級和省部級項目，曾獲國家優秀留學生獎、中國中文信息學會科學技術獎-“錢偉長中文信息處理科學技術獎”一等獎等多項榮譽。
報告内容簡介：
Similarity queries, giving a way to disease diagnosis based on similar patients, have wide applications in eHealthcare and are essentially demanded to be processed under fine-grained access policies due to the high sensitivity of healthcare data. One efficient and flexible way to implement such queries is to outsource healthcare data and the corresponding query services to a powerful cloud. Nevertheless, considering data privacy, healthcare data are usually outsourced in an encrypted form and required to be accessed in a privacy-preserving way. In the past years, many schemes have been proposed for privacy-preserving similarity queries. However, none of them is applicable to achieve data access control and access pattern privacy preservation. Aiming at this challenge, we propose an efficient and access pattern privacy-preserving similarity range query scheme with access control (named EPSim-AC). In our proposed scheme, we first design a novel tree structure, called k-d-PB tree, to index healthcare data and introduce an efficient k-d-PB tree based similarity query algorithm with access control. Second, to balance the search efficiency and access pattern privacy of k-d-PB tree, we also define a weakened access pattern privacy, called k-d-PB tree’s β-access pattern unlinkability. After that, we preserve the privacy of k-d-PB tree based similarity queries with access control through a symmetric homomorphic encryption scheme and present our detailed EPSim-AC scheme. Finally, we analyze the security of our scheme and also conduct extensive experiments to evaluate its performance. The results demonstrate that our scheme can guarantee k-d-PB tree’s β-access pattern unlinkability and has high efficiency.
主辦單位：伟德国际BETVlCTOR
伟德国际BETVlCTOR軟件學院
伟德国际BETVlCTOR計算機科學技術研究所
符号計算與知識工程教育部重點實驗室
仿真技術教育部重點實驗室
網絡技術及應用軟件教育部工程研究中心
伟德国际BETVlCTOR國家級計算機實驗教學示範中心
