Obfuscated arbitrary computation using cryptographic primitives

Nektarios Georgios Tsoutsos, Michail Maniatakos

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


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.
Number of pages4
ISBN (Electronic)9781467399944
StatePublished - Feb 1 2016
Event10th IEEE International Design and Test Symposium, IDT 2015 - Dead Sea, Amman, Jordan
Duration: Dec 14 2015Dec 16 2015

Publication series

NameProceeding of 2015 10th International Design and Test Symposium, IDT 2015


Other10th IEEE International Design and Test Symposium, IDT 2015
CityDead Sea, Amman

ASJC Scopus subject areas

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


Dive into the research topics of 'Obfuscated arbitrary computation using cryptographic primitives'. Together they form a unique fingerprint.

Cite this