Lightweight fault tolerance for secure aggregation of homomorphic data

Nektarios Georgios Tsoutsos, Mihalis Maniatakos

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Homomorphic encryption constitutes a powerful cryptographic method that enables data aggregation in distributed applications over large datasets, such as electronic voting, electronic wallets, secure auctions, lotteries and secret sharing. At the same time, as attack trends move towards the lower levels of the computation stack and new threats continue to emerge, the lack of trust in contemporary computing paradigms keeps increasing. Since, homomorphic encryption helps preserve the confidentiality of sensitive information, it offers a powerful countermeasure against contemporary and future privacy threats, while allowing meaningful processing even though the data remains unreadable. Nevertheless, when homomorphic primitives are mapped to hardware circuits to improve performance, they become vulnerable to random faults and soft errors since homomorphic operations are malleable by construction and do not provide any explicit assurance towards data integrity. In this chapter, we present a fault tolerance methodology that protects homomorphic aggregation circuits through concurrent detection of random errors in homomorphic ALUs and encrypted values stored in memory. Our approach establishes the theoretical foundations to extend residue numbering to additive homomorphic operations, which enables lightweight fault detection with detection rates of more than 99.98% for ALU operations, and 100% for clustered faults and single bitflips in memory values. Using an efficient modular reduction algorithm, our method incurs a performance overhead between 3.6 and 8%, for a minimal area penalty.

Original languageEnglish (US)
Title of host publicationInternet of Things
PublisherSpringer International Publishing
Pages87-110
Number of pages24
DOIs
StatePublished - Jan 1 2019

Publication series

NameInternet of Things
ISSN (Print)2199-1073
ISSN (Electronic)2199-1081

Fingerprint

fault tolerance
Fault tolerance
arithmetic and logic units
Cryptography
Agglomeration
Data storage equipment
Random errors
Networks (circuits)
Fault detection
voting
privacy
fault detection
countermeasures
random errors
assurance
penalties
Hardware
electronics
integrity
attack

ASJC Scopus subject areas

  • Signal Processing
  • Instrumentation
  • Computer Science Applications
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Artificial Intelligence

Cite this

Tsoutsos, N. G., & Maniatakos, M. (2019). Lightweight fault tolerance for secure aggregation of homomorphic data. In Internet of Things (pp. 87-110). (Internet of Things). Springer International Publishing. https://doi.org/10.1007/978-3-030-02807-7_5

Lightweight fault tolerance for secure aggregation of homomorphic data. / Tsoutsos, Nektarios Georgios; Maniatakos, Mihalis.

Internet of Things. Springer International Publishing, 2019. p. 87-110 (Internet of Things).

Research output: Chapter in Book/Report/Conference proceedingChapter

Tsoutsos, NG & Maniatakos, M 2019, Lightweight fault tolerance for secure aggregation of homomorphic data. in Internet of Things. Internet of Things, Springer International Publishing, pp. 87-110. https://doi.org/10.1007/978-3-030-02807-7_5
Tsoutsos NG, Maniatakos M. Lightweight fault tolerance for secure aggregation of homomorphic data. In Internet of Things. Springer International Publishing. 2019. p. 87-110. (Internet of Things). https://doi.org/10.1007/978-3-030-02807-7_5
Tsoutsos, Nektarios Georgios ; Maniatakos, Mihalis. / Lightweight fault tolerance for secure aggregation of homomorphic data. Internet of Things. Springer International Publishing, 2019. pp. 87-110 (Internet of Things).
@inbook{987e70d4e5884a16a9a6e65753a40c75,
title = "Lightweight fault tolerance for secure aggregation of homomorphic data",
abstract = "Homomorphic encryption constitutes a powerful cryptographic method that enables data aggregation in distributed applications over large datasets, such as electronic voting, electronic wallets, secure auctions, lotteries and secret sharing. At the same time, as attack trends move towards the lower levels of the computation stack and new threats continue to emerge, the lack of trust in contemporary computing paradigms keeps increasing. Since, homomorphic encryption helps preserve the confidentiality of sensitive information, it offers a powerful countermeasure against contemporary and future privacy threats, while allowing meaningful processing even though the data remains unreadable. Nevertheless, when homomorphic primitives are mapped to hardware circuits to improve performance, they become vulnerable to random faults and soft errors since homomorphic operations are malleable by construction and do not provide any explicit assurance towards data integrity. In this chapter, we present a fault tolerance methodology that protects homomorphic aggregation circuits through concurrent detection of random errors in homomorphic ALUs and encrypted values stored in memory. Our approach establishes the theoretical foundations to extend residue numbering to additive homomorphic operations, which enables lightweight fault detection with detection rates of more than 99.98{\%} for ALU operations, and 100{\%} for clustered faults and single bitflips in memory values. Using an efficient modular reduction algorithm, our method incurs a performance overhead between 3.6 and 8{\%}, for a minimal area penalty.",
author = "Tsoutsos, {Nektarios Georgios} and Mihalis Maniatakos",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/978-3-030-02807-7_5",
language = "English (US)",
series = "Internet of Things",
publisher = "Springer International Publishing",
pages = "87--110",
booktitle = "Internet of Things",

}

TY - CHAP

T1 - Lightweight fault tolerance for secure aggregation of homomorphic data

AU - Tsoutsos, Nektarios Georgios

AU - Maniatakos, Mihalis

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Homomorphic encryption constitutes a powerful cryptographic method that enables data aggregation in distributed applications over large datasets, such as electronic voting, electronic wallets, secure auctions, lotteries and secret sharing. At the same time, as attack trends move towards the lower levels of the computation stack and new threats continue to emerge, the lack of trust in contemporary computing paradigms keeps increasing. Since, homomorphic encryption helps preserve the confidentiality of sensitive information, it offers a powerful countermeasure against contemporary and future privacy threats, while allowing meaningful processing even though the data remains unreadable. Nevertheless, when homomorphic primitives are mapped to hardware circuits to improve performance, they become vulnerable to random faults and soft errors since homomorphic operations are malleable by construction and do not provide any explicit assurance towards data integrity. In this chapter, we present a fault tolerance methodology that protects homomorphic aggregation circuits through concurrent detection of random errors in homomorphic ALUs and encrypted values stored in memory. Our approach establishes the theoretical foundations to extend residue numbering to additive homomorphic operations, which enables lightweight fault detection with detection rates of more than 99.98% for ALU operations, and 100% for clustered faults and single bitflips in memory values. Using an efficient modular reduction algorithm, our method incurs a performance overhead between 3.6 and 8%, for a minimal area penalty.

AB - Homomorphic encryption constitutes a powerful cryptographic method that enables data aggregation in distributed applications over large datasets, such as electronic voting, electronic wallets, secure auctions, lotteries and secret sharing. At the same time, as attack trends move towards the lower levels of the computation stack and new threats continue to emerge, the lack of trust in contemporary computing paradigms keeps increasing. Since, homomorphic encryption helps preserve the confidentiality of sensitive information, it offers a powerful countermeasure against contemporary and future privacy threats, while allowing meaningful processing even though the data remains unreadable. Nevertheless, when homomorphic primitives are mapped to hardware circuits to improve performance, they become vulnerable to random faults and soft errors since homomorphic operations are malleable by construction and do not provide any explicit assurance towards data integrity. In this chapter, we present a fault tolerance methodology that protects homomorphic aggregation circuits through concurrent detection of random errors in homomorphic ALUs and encrypted values stored in memory. Our approach establishes the theoretical foundations to extend residue numbering to additive homomorphic operations, which enables lightweight fault detection with detection rates of more than 99.98% for ALU operations, and 100% for clustered faults and single bitflips in memory values. Using an efficient modular reduction algorithm, our method incurs a performance overhead between 3.6 and 8%, for a minimal area penalty.

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

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

U2 - 10.1007/978-3-030-02807-7_5

DO - 10.1007/978-3-030-02807-7_5

M3 - Chapter

AN - SCOPUS:85058972556

T3 - Internet of Things

SP - 87

EP - 110

BT - Internet of Things

PB - Springer International Publishing

ER -