Y
Yarkin Doröz
Researcher at Worcester Polytechnic Institute
Publications - 31
Citations - 826
Yarkin Doröz is an academic researcher from Worcester Polytechnic Institute. The author has contributed to research in topics: Homomorphic encryption & NTRU. The author has an hindex of 16, co-authored 30 publications receiving 669 citations.
Papers
More filters
Journal ArticleDOI
Accelerating Fully Homomorphic Encryption in Hardware
TL;DR: This contribution presents the first full realization of FHE in hardware based on the Gentry-Halevi fully homomorphic encryption scheme using an optimized multi-million bit multiplierbased on the Schonhage Strassen multiplication algorithm.
Proceedings ArticleDOI
Practical homomorphic encryption: A survey
TL;DR: The current state of the art in this promising new area of research in homomorphic cryptography is presented and the interesting remaining open problems are highlighted.
Proceedings ArticleDOI
Accelerating NTRU based homomorphic encryption using GPUs
Wei Dai,Yarkin Doröz,Berk Sunar +2 more
TL;DR: In this article, a large polynomial arithmetic library optimized for Nvidia GPUs was proposed to support fully homomorphic encryption schemes, and the library was used to evaluate homomorphic evaluation of two block ciphers: Prince and AES.
Book ChapterDOI
Toward Practical Homomorphic Evaluation of Block Ciphers Using Prince
TL;DR: This analysis shows that Prince can be implemented using only a 24 level deep circuit, and achieves one and two orders of magnitude improvement over homomorphic AES implementations achieved using NTRU, and BGV-style homomorphic encryption libraries, respectively.
Journal ArticleDOI
Homomorphic AES evaluation using the modified LTV scheme
Yarkin Doröz,Yin Hu,Berk Sunar +2 more
TL;DR: This work develops a customized implementation of the LTV scheme that embodies a number of optimizations and introduces a specialization of the ring structure that allows us to drastically reduce the public key size making evaluation of deep circuits such as the AES block cipher viable on a standard computer with a reasonable amount of memory.