Name
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/WIFS.2018.8630769 | 2018 IEEE International Workshop on Information Forensics and Security (WIFS) |
Keywords | Field | DocType |
untrusted processing units,protecting privacy-sensitive data,secure data retrieval,encrypted data,data packing,communicational overheads,undesired computational overheads,data encryption,data expansion | Subset sum problem,Computer science,Data retrieval,Cryptography,Encryption,Theoretical computer science,Knapsack problem,Overhead (business) | Conference |
ISSN | ISBN | Citations |
2157-4766 | 978-1-5386-6537-4 | 0 |
PageRank | References | Authors |
0.34 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Majid Nateghizad | 1 | 3 | 2.43 |
| Zekeriya Erkin | 2 | 579 | 39.17 |
| Reginald L. Lagendijk | 3 | 388 | 39.05 |