Computing Maximum and Minimum with Privacy Preservation and Flexible Access Control

Loading...
Thumbnail Image
Journal Title
Journal ISSN
Volume Title
Conference article in proceedings
This publication is imported from Aalto University research portal.
View publication in the Research portal
View/Open full text file from the Research portal
Date
2019
Major/Subject
Mcode
Degree programme
Language
en
Pages
Series
IEEE Global Communications Conference
Abstract
With the fast development of Internet of Things, huge volume of data is being collected from various sensors and devices, aggregated at gateways, and processed in the cloud. Due to privacy concern, data are usually encrypted before being outsourced to the cloud. However, encryption seriously impedes both computation over the data and sharing of the computation results. Computing maximum and minimum among a data set are two of the most basic operations in machine learning and data mining algorithms. In this paper, we study how to compute maximum and minimum over encrypted data and control the access to the computation result in a privacy-preserving manner. We present four schemes to realize privacy-preserving maximum and minimum computations with flexible access control that can adapt to various application scenarios. We further analyze their security and show their efficiency through extensive evaluations and comparisons with existing work. © 2019 IEEE.
Description
Keywords
access control, attribute-based encryption, homomorphic encryption, maximum and minimum, privacy preservation
Other note
Citation
Ding , W , Yan , Z , Qian , X R & Deng , R H 2019 , Computing Maximum and Minimum with Privacy Preservation and Flexible Access Control . in IEEE Global Communications Conference . , 9013937 , IEEE Global Communications Conference , IEEE , IEEE Global Communications Conference , Waikoloa , Hawaii , United States , 09/12/2019 . https://doi.org/10.1109/GLOBECOM38437.2019.9013937