Toward Practical Homomorphic Evaluation of Block Ciphers Using Prince

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


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 languageEnglish
Title of host publicationFinancial Cryptography and Data Security
EditorsRainer Böhme, Michael Brenner, Tyler Moore, Matthew Smith
Number of pages13
Place of PublicationBerlin, Heidelberg
PublisherSpringer Berlin Heidelberg
Publication date08.10.2014
ISBN (Print)978-3-662-44773-4
ISBN (Electronic)978-3-662-44774-1
Publication statusPublished - 08.10.2014
EventInternational Conference on Financial Cryptography and Data Security 2014 - Christ Church, Barbados
Duration: 03.03.201407.03.2014


Dive into the research topics of 'Toward Practical Homomorphic Evaluation of Block Ciphers Using Prince'. Together they form a unique fingerprint.

Cite this