Homomorphic Autocomplete

Gizem S. Cetin, Wei Dai, Yarkin Doroz, Berk Sunar
Worcester Polytechnic Institute
Cryptology ePrint Archive: Report 2015/1194, 2015


   title={Homomorphic Autocomplete},

   author={c{C}}etin, Gizem S and Dai, Wei and Dor{"o}z, Yark{i}n and Sunar, Berk},



Download Download (PDF)   View View   Source Source   



With the rapid progress in fully homomorpic encryption (FHE) and somewhat homomorphic encryption (SHE) schemes, we are witnessing renewed efforts to revisit privacy preserving protocols. Several works have already appeared in the literature that provide solutions to these problems by employing FHE or SHE techniques. These applications range from cloud computing to computation over confidential patient data to several machine learning problems such as classifying privatized data. One application where privacy is a major concern is web search – a task carried out on a daily basis by billions of users around the world. In this work, we focus on a more surmountable yet essential version of the search problem, i.e. autocomplete. By utilizing a SHE scheme we propose concrete solutions to a homomorphic autocomplete problem. To investigate the real-life viability, we tackle a number of problems in the way towards a practical implementation such as communication and computational efficiency.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2024 hgpu.org

All rights belong to the respective authors

Contact us: