Extending residue-based fault tolerance to encrypted computation

Nektarios Georgios Tsoutsos, Michail Maniatakos

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


In this work we adapt residue numbering and modular arithmetic, combining them with the intrinsic properties of partial homomorphic encryption algorithms, in order to propose an efficient fault tolerance framework specifically tailored to encrypted computation. Our approach can be easily integrated to such systems and protect the individual processing components, such as the ALU, the memory, and the outputs. Experimental results demonstrate that the proposed methodology offers more than 99.9% fault coverage for single bit-flips and clustered multiple bit upsets, incurring a runtime overhead of up to 8%. Compared to resource duplication approaches, our framework incurs approximately 47% less area overhead.

Original languageEnglish (US)
Title of host publicationInternational Test Conference 2015, ITC 2015 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781467365789
StatePublished - Nov 30 2015
Event46th IEEE International Test Conference, ITC 2015 - Anaheim, United States
Duration: Oct 6 2015Oct 8 2015

Publication series

NameProceedings - International Test Conference
ISSN (Print)1089-3539


Other46th IEEE International Test Conference, ITC 2015
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'Extending residue-based fault tolerance to encrypted computation'. Together they form a unique fingerprint.

Cite this