Abstract
Processing encrypted data is a well-known solution when protecting privacy-sensitive data from untrusted processing units. However, data expansion, as a result of data encryption, makes undesired computational and communicational overheads in the cryptographic applications. Data packing is one of the useful tools to minimize the overheads. In this work, we introduce a novel approach for packing encrypted data based on the subset sum problem. We show that our data packing achieve high performance in reducing the overheads and it is significantly more efficient than existing techniques. Moreover, we show that our approach perfectly matches with secure searching protocols for secure data retrieval.
Original language | English |
---|---|
Title of host publication | 2018 IEEE International Workshop on Information Forensics and Security (WIFS) |
Editors | Ajay Kumar, Pong C Yuen, Jiwu Huang |
Place of Publication | Piscataway |
Publisher | IEEE |
Pages | 1-6 |
Number of pages | 6 |
ISBN (Electronic) | 978-1-5386-6536-7 |
ISBN (Print) | 978-1-5386-6537-4 |
DOIs | |
Publication status | Published - 2019 |
Event | 10th IEEE International Workshop on Information Forensics and Security, WIFS 2018 - Hong Kong, Hong Kong Duration: 10 Dec 2018 → 13 Dec 2018 |
Conference
Conference | 10th IEEE International Workshop on Information Forensics and Security, WIFS 2018 |
---|---|
Country/Territory | Hong Kong |
City | Hong Kong |
Period | 10/12/18 → 13/12/18 |