Memory-bounded randomness for hardware-constrained encrypted computation

Nektarios Georgios Tsoutsos; Oleg Mazonka; Michail Maniatakos

doi:10.1109/ICCD.2017.117

Memory-bounded randomness for hardware-constrained encrypted computation

Nektarios Georgios Tsoutsos, Oleg Mazonka, Michail Maniatakos

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Encrypted computation enables processing sensitive data directly in the encrypted domain, which allows outsourcing to third parties without compromising privacy. Recent solutions that leverage partial homomorphic encryption, however, require excessive lookup tables or obfuscated software oracles to implement branching over encrypted control values. To address these limitations and make encrypted computations more practical on memory-constrained systems, we present a novel approach for limiting the amount of randomness in probabilistic ciphertexts, using number theory primitives and hash tables. This allows de-randomizing probabilistic ciphertexts and define a new encrypted abstract machine that is memory-friendly to the target system. Compared to obfuscated oracles in previous work, our method performs control flow decisions over ciphertexts twice as fast, while requiring selectively small lookup tables.

Original language	English (US)
Title of host publication	Proceedings - 35th IEEE International Conference on Computer Design, ICCD 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	673-680
Number of pages	8
ISBN (Electronic)	9781538622544
DOIs	https://doi.org/10.1109/ICCD.2017.117
State	Published - Nov 22 2017
Event	35th IEEE International Conference on Computer Design, ICCD 2017 - Boston, United States Duration: Nov 5 2017 → Nov 8 2017

Publication series

Name	Proceedings - 35th IEEE International Conference on Computer Design, ICCD 2017

Other

Other	35th IEEE International Conference on Computer Design, ICCD 2017
Country/Territory	United States
City	Boston
Period	11/5/17 → 11/8/17

Keywords

Abstract machine
Bounded randomness
Encrypted computation
One instruction set computing
Paillier encryption

ASJC Scopus subject areas

Hardware and Architecture

Access to Document

10.1109/ICCD.2017.117

Cite this

Tsoutsos, N. G., Mazonka, O., & Maniatakos, M. (2017). Memory-bounded randomness for hardware-constrained encrypted computation. In Proceedings - 35th IEEE International Conference on Computer Design, ICCD 2017 (pp. 673-680). Article 8119290 (Proceedings - 35th IEEE International Conference on Computer Design, ICCD 2017). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCD.2017.117

Memory-bounded randomness for hardware-constrained encrypted computation. / Tsoutsos, Nektarios Georgios; Mazonka, Oleg; Maniatakos, Michail.
Proceedings - 35th IEEE International Conference on Computer Design, ICCD 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 673-680 8119290 (Proceedings - 35th IEEE International Conference on Computer Design, ICCD 2017).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Tsoutsos, NG, Mazonka, O & Maniatakos, M 2017, Memory-bounded randomness for hardware-constrained encrypted computation. in Proceedings - 35th IEEE International Conference on Computer Design, ICCD 2017., 8119290, Proceedings - 35th IEEE International Conference on Computer Design, ICCD 2017, Institute of Electrical and Electronics Engineers Inc., pp. 673-680, 35th IEEE International Conference on Computer Design, ICCD 2017, Boston, United States, 11/5/17. https://doi.org/10.1109/ICCD.2017.117

Tsoutsos NG, Mazonka O, Maniatakos M. Memory-bounded randomness for hardware-constrained encrypted computation. In Proceedings - 35th IEEE International Conference on Computer Design, ICCD 2017. Institute of Electrical and Electronics Engineers Inc. 2017. p. 673-680. 8119290. (Proceedings - 35th IEEE International Conference on Computer Design, ICCD 2017). doi: 10.1109/ICCD.2017.117

Tsoutsos, Nektarios Georgios ; Mazonka, Oleg ; Maniatakos, Michail. / Memory-bounded randomness for hardware-constrained encrypted computation. Proceedings - 35th IEEE International Conference on Computer Design, ICCD 2017. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 673-680 (Proceedings - 35th IEEE International Conference on Computer Design, ICCD 2017).

@inproceedings{049bcfbcd2f343b8b016f1d835f3e974,

title = "Memory-bounded randomness for hardware-constrained encrypted computation",

abstract = "Encrypted computation enables processing sensitive data directly in the encrypted domain, which allows outsourcing to third parties without compromising privacy. Recent solutions that leverage partial homomorphic encryption, however, require excessive lookup tables or obfuscated software oracles to implement branching over encrypted control values. To address these limitations and make encrypted computations more practical on memory-constrained systems, we present a novel approach for limiting the amount of randomness in probabilistic ciphertexts, using number theory primitives and hash tables. This allows de-randomizing probabilistic ciphertexts and define a new encrypted abstract machine that is memory-friendly to the target system. Compared to obfuscated oracles in previous work, our method performs control flow decisions over ciphertexts twice as fast, while requiring selectively small lookup tables.",

keywords = "Abstract machine, Bounded randomness, Encrypted computation, One instruction set computing, Paillier encryption",

author = "Tsoutsos, {Nektarios Georgios} and Oleg Mazonka and Michail Maniatakos",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 35th IEEE International Conference on Computer Design, ICCD 2017 ; Conference date: 05-11-2017 Through 08-11-2017",

year = "2017",

month = nov,

day = "22",

doi = "10.1109/ICCD.2017.117",

language = "English (US)",

series = "Proceedings - 35th IEEE International Conference on Computer Design, ICCD 2017",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "673--680",

booktitle = "Proceedings - 35th IEEE International Conference on Computer Design, ICCD 2017",

}

TY - GEN

T1 - Memory-bounded randomness for hardware-constrained encrypted computation

AU - Tsoutsos, Nektarios Georgios

AU - Mazonka, Oleg

AU - Maniatakos, Michail

PY - 2017/11/22

Y1 - 2017/11/22

N2 - Encrypted computation enables processing sensitive data directly in the encrypted domain, which allows outsourcing to third parties without compromising privacy. Recent solutions that leverage partial homomorphic encryption, however, require excessive lookup tables or obfuscated software oracles to implement branching over encrypted control values. To address these limitations and make encrypted computations more practical on memory-constrained systems, we present a novel approach for limiting the amount of randomness in probabilistic ciphertexts, using number theory primitives and hash tables. This allows de-randomizing probabilistic ciphertexts and define a new encrypted abstract machine that is memory-friendly to the target system. Compared to obfuscated oracles in previous work, our method performs control flow decisions over ciphertexts twice as fast, while requiring selectively small lookup tables.

AB - Encrypted computation enables processing sensitive data directly in the encrypted domain, which allows outsourcing to third parties without compromising privacy. Recent solutions that leverage partial homomorphic encryption, however, require excessive lookup tables or obfuscated software oracles to implement branching over encrypted control values. To address these limitations and make encrypted computations more practical on memory-constrained systems, we present a novel approach for limiting the amount of randomness in probabilistic ciphertexts, using number theory primitives and hash tables. This allows de-randomizing probabilistic ciphertexts and define a new encrypted abstract machine that is memory-friendly to the target system. Compared to obfuscated oracles in previous work, our method performs control flow decisions over ciphertexts twice as fast, while requiring selectively small lookup tables.

KW - Abstract machine

KW - Bounded randomness

KW - Encrypted computation

KW - One instruction set computing

KW - Paillier encryption

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

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

U2 - 10.1109/ICCD.2017.117

DO - 10.1109/ICCD.2017.117

M3 - Conference contribution

AN - SCOPUS:85041679920

T3 - Proceedings - 35th IEEE International Conference on Computer Design, ICCD 2017

SP - 673

EP - 680

BT - Proceedings - 35th IEEE International Conference on Computer Design, ICCD 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 35th IEEE International Conference on Computer Design, ICCD 2017

Y2 - 5 November 2017 through 8 November 2017

ER -

Memory-bounded randomness for hardware-constrained encrypted computation

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this