Toward Practical Homomorphic Evaluation of Block Ciphers Using Prince

Yarkin Doröz; Aria Shahverdi; Thomas Eisenbarth; Berk Sunar

doi:10.1007/978-3-662-44774-1_17

Toward Practical Homomorphic Evaluation of Block Ciphers Using Prince

Yarkin Doröz, Aria Shahverdi, Thomas Eisenbarth, Berk Sunar

Institute of IT Security

37 Citations (Scopus)

Abstract

We present the homomorphic evaluation of the Prince block cipher. Our leveled implementation is based on a generalization of NTRU. We are motivated by the drastic bandwidth savings that may be achieved by scheme conversion. To unlock this advantage we turn to lightweight ciphers such as Prince. These ciphers were designed from scratch to yield fast and compact implementations on resource-constrained embedded platforms. We show that some of these ciphers have the potential to enable near practical homomorphic evaluation of block ciphers. Indeed, our analysis shows that Prince can be implemented using only a 24 level deep circuit. Using an NTRU based implementation we achieve an evaluation time of 3.3 s per Prince block -- one and two orders of magnitude improvement over homomorphic AES implementations achieved using NTRU, and BGV-style homomorphic encryption libraries, respectively.

Original language	English
Title of host publication	Financial Cryptography and Data Security
Editors	Rainer Böhme, Michael Brenner, Tyler Moore, Matthew Smith
Number of pages	13
Volume	8438
Place of Publication	Berlin, Heidelberg
Publisher	Springer Berlin Heidelberg
Publication date	08.10.2014
Pages	208-220
ISBN (Print)	978-3-662-44773-4
ISBN (Electronic)	978-3-662-44774-1
DOIs	https://doi.org/10.1007/978-3-662-44774-1_17
Publication status	Published - 08.10.2014
Event	International Conference on Financial Cryptography and Data Security 2014 - Christ Church, Barbados Duration: 03.03.2014 → 07.03.2014

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure
SDG 11 Sustainable Cities and Communities
SDG 12 Responsible Consumption and Production

Access to Document

10.1007/978-3-662-44774-1_17

https://eprint.iacr.org/2014/233.pdf

Cite this

Doröz, Y., Shahverdi, A., Eisenbarth, T., & Sunar, B. (2014). Toward Practical Homomorphic Evaluation of Block Ciphers Using Prince. In R. Böhme, M. Brenner, T. Moore, & M. Smith (Eds.), Financial Cryptography and Data Security (Vol. 8438, pp. 208-220). (Lecture Notes in Computer Science; Vol. 8438). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-44774-1_17

@inproceedings{5c4f1519c92e432f8db266e5aa9b2531,

title = "Toward Practical Homomorphic Evaluation of Block Ciphers Using Prince",

abstract = "We present the homomorphic evaluation of the Prince block cipher. Our leveled implementation is based on a generalization of NTRU. We are motivated by the drastic bandwidth savings that may be achieved by scheme conversion. To unlock this advantage we turn to lightweight ciphers such as Prince. These ciphers were designed from scratch to yield fast and compact implementations on resource-constrained embedded platforms. We show that some of these ciphers have the potential to enable near practical homomorphic evaluation of block ciphers. Indeed, our analysis shows that Prince can be implemented using only a 24 level deep circuit. Using an NTRU based implementation we achieve an evaluation time of 3.3 s per Prince block -- one and two orders of magnitude improvement over homomorphic AES implementations achieved using NTRU, and BGV-style homomorphic encryption libraries, respectively.",

author = "Yarkin Dor{\"o}z and Aria Shahverdi and Thomas Eisenbarth and Berk Sunar",

year = "2014",

month = oct,

day = "8",

doi = "10.1007/978-3-662-44774-1\_17",

language = "English",

isbn = "978-3-662-44773-4",

volume = "8438",

series = "Lecture Notes in Computer Science",

publisher = "Springer Berlin Heidelberg",

pages = "208--220",

editor = "Rainer B{\"o}hme and Michael Brenner and Tyler Moore and Matthew Smith",

booktitle = "Financial Cryptography and Data Security",

note = "International Conference on Financial Cryptography and Data Security 2014, FC 2014 ; Conference date: 03-03-2014 Through 07-03-2014",

}

Doröz, Y, Shahverdi, A, Eisenbarth, T & Sunar, B 2014, Toward Practical Homomorphic Evaluation of Block Ciphers Using Prince. in R Böhme, M Brenner, T Moore & M Smith (eds), Financial Cryptography and Data Security. vol. 8438, Lecture Notes in Computer Science, vol. 8438, Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 208-220, International Conference on Financial Cryptography and Data Security 2014, Christ Church, Barbados, 03.03.14. https://doi.org/10.1007/978-3-662-44774-1_17

Toward Practical Homomorphic Evaluation of Block Ciphers Using Prince. / Doröz, Yarkin; Shahverdi, Aria; Eisenbarth, Thomas et al.
Financial Cryptography and Data Security. ed. / Rainer Böhme; Michael Brenner; Tyler Moore; Matthew Smith. Vol. 8438 Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. p. 208-220 (Lecture Notes in Computer Science; Vol. 8438).

Research output: Chapters in Books/Reports/Conference Proceedings › Conference contribution › peer-review

TY - GEN

T1 - Toward Practical Homomorphic Evaluation of Block Ciphers Using Prince

AU - Doröz, Yarkin

AU - Shahverdi, Aria

AU - Eisenbarth, Thomas

AU - Sunar, Berk

PY - 2014/10/8

Y1 - 2014/10/8

N2 - We present the homomorphic evaluation of the Prince block cipher. Our leveled implementation is based on a generalization of NTRU. We are motivated by the drastic bandwidth savings that may be achieved by scheme conversion. To unlock this advantage we turn to lightweight ciphers such as Prince. These ciphers were designed from scratch to yield fast and compact implementations on resource-constrained embedded platforms. We show that some of these ciphers have the potential to enable near practical homomorphic evaluation of block ciphers. Indeed, our analysis shows that Prince can be implemented using only a 24 level deep circuit. Using an NTRU based implementation we achieve an evaluation time of 3.3 s per Prince block -- one and two orders of magnitude improvement over homomorphic AES implementations achieved using NTRU, and BGV-style homomorphic encryption libraries, respectively.

AB - We present the homomorphic evaluation of the Prince block cipher. Our leveled implementation is based on a generalization of NTRU. We are motivated by the drastic bandwidth savings that may be achieved by scheme conversion. To unlock this advantage we turn to lightweight ciphers such as Prince. These ciphers were designed from scratch to yield fast and compact implementations on resource-constrained embedded platforms. We show that some of these ciphers have the potential to enable near practical homomorphic evaluation of block ciphers. Indeed, our analysis shows that Prince can be implemented using only a 24 level deep circuit. Using an NTRU based implementation we achieve an evaluation time of 3.3 s per Prince block -- one and two orders of magnitude improvement over homomorphic AES implementations achieved using NTRU, and BGV-style homomorphic encryption libraries, respectively.

U2 - 10.1007/978-3-662-44774-1_17

DO - 10.1007/978-3-662-44774-1_17

M3 - Conference contribution

SN - 978-3-662-44773-4

VL - 8438

T3 - Lecture Notes in Computer Science

SP - 208

EP - 220

BT - Financial Cryptography and Data Security

A2 - Böhme, Rainer

A2 - Brenner, Michael

A2 - Moore, Tyler

A2 - Smith, Matthew

PB - Springer Berlin Heidelberg

CY - Berlin, Heidelberg

T2 - International Conference on Financial Cryptography and Data Security 2014

Y2 - 3 March 2014 through 7 March 2014

ER -

Toward Practical Homomorphic Evaluation of Block Ciphers Using Prince

Abstract

UN SDGs

Access to Document

Fingerprint

Cite this