Toward practical homomorphic evaluation of block ciphers using prince

32Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Doröz, Y., Shahverdi, A., Eisenbarth, T., & Sunar, B. (2014). Toward practical homomorphic evaluation of block ciphers using prince. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8438, pp. 208–220). Springer Verlag. https://doi.org/10.1007/978-3-662-44774-1_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free