Standard

A novel approach for data packing : Using trapdoor knapsack. / Nateghizad, Majid; Erkin, Zekeriya; Lagendijk, Reginald L.

2018 IEEE International Workshop on Information Forensics and Security (WIFS). ed. / Ajay Kumar; Pong C Yuen; Jiwu Huang. Piscataway : IEEE, 2019. p. 1-6 8630769.

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

Harvard

Nateghizad, M, Erkin, Z & Lagendijk, RL 2019, A novel approach for data packing: Using trapdoor knapsack. in A Kumar, PC Yuen & J Huang (eds), 2018 IEEE International Workshop on Information Forensics and Security (WIFS)., 8630769, IEEE, Piscataway, pp. 1-6, 10th IEEE International Workshop on Information Forensics and Security, WIFS 2018, Hong Kong, Hong Kong, 10/12/18. https://doi.org/10.1109/WIFS.2018.8630769

APA

Nateghizad, M., Erkin, Z., & Lagendijk, R. L. (2019). A novel approach for data packing: Using trapdoor knapsack. In A. Kumar, P. C. Yuen, & J. Huang (Eds.), 2018 IEEE International Workshop on Information Forensics and Security (WIFS) (pp. 1-6). [8630769] IEEE. https://doi.org/10.1109/WIFS.2018.8630769

Vancouver

Nateghizad M, Erkin Z, Lagendijk RL. A novel approach for data packing: Using trapdoor knapsack. In Kumar A, Yuen PC, Huang J, editors, 2018 IEEE International Workshop on Information Forensics and Security (WIFS). Piscataway: IEEE. 2019. p. 1-6. 8630769 https://doi.org/10.1109/WIFS.2018.8630769

Author

Nateghizad, Majid ; Erkin, Zekeriya ; Lagendijk, Reginald L. / A novel approach for data packing : Using trapdoor knapsack. 2018 IEEE International Workshop on Information Forensics and Security (WIFS). editor / Ajay Kumar ; Pong C Yuen ; Jiwu Huang. Piscataway : IEEE, 2019. pp. 1-6

BibTeX

@inproceedings{871e4ec25a1541459b219606663d57a2,
title = "A novel approach for data packing: Using trapdoor knapsack",
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.",
author = "Majid Nateghizad and Zekeriya Erkin and Lagendijk, {Reginald L.}",
year = "2019",
doi = "10.1109/WIFS.2018.8630769",
language = "English",
isbn = "978-1-5386-6537-4 ",
pages = "1--6",
editor = "Kumar, {Ajay } and Yuen, {Pong C } and Huang, {Jiwu }",
booktitle = "2018 IEEE International Workshop on Information Forensics and Security (WIFS)",
publisher = "IEEE",
address = "United States",
note = "10th IEEE International Workshop on Information Forensics and Security, WIFS 2018 ; Conference date: 10-12-2018 Through 13-12-2018",

}

RIS

TY - GEN

T1 - A novel approach for data packing

T2 - 10th IEEE International Workshop on Information Forensics and Security, WIFS 2018

AU - Nateghizad, Majid

AU - Erkin, Zekeriya

AU - Lagendijk, Reginald L.

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85062862685&partnerID=8YFLogxK

U2 - 10.1109/WIFS.2018.8630769

DO - 10.1109/WIFS.2018.8630769

M3 - Conference contribution

AN - SCOPUS:85062862685

SN - 978-1-5386-6537-4

SP - 1

EP - 6

BT - 2018 IEEE International Workshop on Information Forensics and Security (WIFS)

A2 - Kumar, Ajay

A2 - Yuen, Pong C

A2 - Huang, Jiwu

PB - IEEE

CY - Piscataway

Y2 - 10 December 2018 through 13 December 2018

ER -

ID: 52737566