文献
J-GLOBAL ID:201802250345968980
整理番号:18A0185839
プライバシー保護による暗号化グラフ上のクラウドに基づく近似的な制約つき最短距離クエリー【Powered by NICT】
Cloud-Based Approximate Constrained Shortest Distance Queries Over Encrypted Graphs With Privacy Protection
著者 (6件):
Shen Meng
(Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications, School of Computer Science, Beijing Institute of Technology, Beijing, China)
,
Ma Baoli
(Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications, School of Computer Science, Beijing Institute of Technology, Beijing, China)
,
Zhu Liehuang
(Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications, School of Computer Science, Beijing Institute of Technology, Beijing, China)
,
Mijumbi Rashid
(Bell Labs CTO, Nokia, Dublin, Ireland)
,
Du Xiaojiang
(Department of Computer and Information Sciences, Temple University, Philadelphia, PA, USA)
,
Hu Jiankun
(School of Engineering and IT, University of New South Wales, Canberra, ACT, Australia)
資料名:
IEEE Transactions on Information Forensics and Security
(IEEE Transactions on Information Forensics and Security)
巻:
13
号:
4
ページ:
940-953
発行年:
2018年
JST資料番号:
W1570A
ISSN:
1556-6013
CODEN:
ITIFA6
資料種別:
逐次刊行物 (A)
記事区分:
原著論文
発行国:
アメリカ合衆国 (USA)
言語:
英語 (EN)