Obfuscated arbitrary computation using cryptographic primitives

Nektarios Georgios Tsoutsos, Mihalis Maniatakos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The breakthrough of fully homomorphic encryption (FHE) enables privacy-preserving arbitrary computation in the cloud, supporting both addition and multiplication over encrypted data. Current FHE implementations, however, suffer from high performance overheads and require expensive boot-strapping operations to decrease ciphertext noise. In this work, we discuss how homomorphic encryption primitives can implement a functionally complete set of homomorphic operations and enable arbitrary computation that is outsourced by a single party. We focus on obfuscated computation with or without special look-up tables, to enable branch decisions over encrypted values while preserving privacy. Since partial homomorphic encryption is orders of magnitude less expensive than FHE, it can be more practical for privacy-preserving applications in the cloud.

Original languageEnglish (US)
Title of host publicationProceeding of 2015 10th International Design and Test Symposium, IDT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages5-8
Number of pages4
ISBN (Electronic)9781467399944
DOIs
StatePublished - Feb 1 2016
Event10th IEEE International Design and Test Symposium, IDT 2015 - Dead Sea, Amman, Jordan
Duration: Dec 14 2015Dec 16 2015

Other

Other10th IEEE International Design and Test Symposium, IDT 2015
CountryJordan
CityDead Sea, Amman
Period12/14/1512/16/15

Fingerprint

Cryptography
Strapping

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering
  • Safety, Risk, Reliability and Quality

Cite this

Tsoutsos, N. G., & Maniatakos, M. (2016). Obfuscated arbitrary computation using cryptographic primitives. In Proceeding of 2015 10th International Design and Test Symposium, IDT 2015 (pp. 5-8). [7396726] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IDT.2015.7396726

Obfuscated arbitrary computation using cryptographic primitives. / Tsoutsos, Nektarios Georgios; Maniatakos, Mihalis.

Proceeding of 2015 10th International Design and Test Symposium, IDT 2015. Institute of Electrical and Electronics Engineers Inc., 2016. p. 5-8 7396726.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tsoutsos, NG & Maniatakos, M 2016, Obfuscated arbitrary computation using cryptographic primitives. in Proceeding of 2015 10th International Design and Test Symposium, IDT 2015., 7396726, Institute of Electrical and Electronics Engineers Inc., pp. 5-8, 10th IEEE International Design and Test Symposium, IDT 2015, Dead Sea, Amman, Jordan, 12/14/15. https://doi.org/10.1109/IDT.2015.7396726
Tsoutsos NG, Maniatakos M. Obfuscated arbitrary computation using cryptographic primitives. In Proceeding of 2015 10th International Design and Test Symposium, IDT 2015. Institute of Electrical and Electronics Engineers Inc. 2016. p. 5-8. 7396726 https://doi.org/10.1109/IDT.2015.7396726
Tsoutsos, Nektarios Georgios ; Maniatakos, Mihalis. / Obfuscated arbitrary computation using cryptographic primitives. Proceeding of 2015 10th International Design and Test Symposium, IDT 2015. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 5-8
@inproceedings{849dd6956e8a46faa58704c5307cddf5,
title = "Obfuscated arbitrary computation using cryptographic primitives",
abstract = "The breakthrough of fully homomorphic encryption (FHE) enables privacy-preserving arbitrary computation in the cloud, supporting both addition and multiplication over encrypted data. Current FHE implementations, however, suffer from high performance overheads and require expensive boot-strapping operations to decrease ciphertext noise. In this work, we discuss how homomorphic encryption primitives can implement a functionally complete set of homomorphic operations and enable arbitrary computation that is outsourced by a single party. We focus on obfuscated computation with or without special look-up tables, to enable branch decisions over encrypted values while preserving privacy. Since partial homomorphic encryption is orders of magnitude less expensive than FHE, it can be more practical for privacy-preserving applications in the cloud.",
author = "Tsoutsos, {Nektarios Georgios} and Mihalis Maniatakos",
year = "2016",
month = "2",
day = "1",
doi = "10.1109/IDT.2015.7396726",
language = "English (US)",
pages = "5--8",
booktitle = "Proceeding of 2015 10th International Design and Test Symposium, IDT 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Obfuscated arbitrary computation using cryptographic primitives

AU - Tsoutsos, Nektarios Georgios

AU - Maniatakos, Mihalis

PY - 2016/2/1

Y1 - 2016/2/1

N2 - The breakthrough of fully homomorphic encryption (FHE) enables privacy-preserving arbitrary computation in the cloud, supporting both addition and multiplication over encrypted data. Current FHE implementations, however, suffer from high performance overheads and require expensive boot-strapping operations to decrease ciphertext noise. In this work, we discuss how homomorphic encryption primitives can implement a functionally complete set of homomorphic operations and enable arbitrary computation that is outsourced by a single party. We focus on obfuscated computation with or without special look-up tables, to enable branch decisions over encrypted values while preserving privacy. Since partial homomorphic encryption is orders of magnitude less expensive than FHE, it can be more practical for privacy-preserving applications in the cloud.

AB - The breakthrough of fully homomorphic encryption (FHE) enables privacy-preserving arbitrary computation in the cloud, supporting both addition and multiplication over encrypted data. Current FHE implementations, however, suffer from high performance overheads and require expensive boot-strapping operations to decrease ciphertext noise. In this work, we discuss how homomorphic encryption primitives can implement a functionally complete set of homomorphic operations and enable arbitrary computation that is outsourced by a single party. We focus on obfuscated computation with or without special look-up tables, to enable branch decisions over encrypted values while preserving privacy. Since partial homomorphic encryption is orders of magnitude less expensive than FHE, it can be more practical for privacy-preserving applications in the cloud.

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

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

U2 - 10.1109/IDT.2015.7396726

DO - 10.1109/IDT.2015.7396726

M3 - Conference contribution

AN - SCOPUS:84969820583

SP - 5

EP - 8

BT - Proceeding of 2015 10th International Design and Test Symposium, IDT 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -