UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Applying Fully Homomorphic Encryption: Practices and Problems

Thumbnail Image

Files

Chen_Yao.pdf (708.92 KB)

Date

2021-09-24

Authors

Chen, Yao

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

Fully homomorphic encryption (FHE) has been regarded as the "holy grail" of cryptography for its versatility as a cryptographic primitive and wide range of potential applications. Since Gentry published the first theoretically feasible FHE design in 2008, there has been a lot of new discoveries and inventions in this particular field. New schemes significantly reduce the computational cost of FHE and make practical deployment within reach. As a result, FHE schemes have come off the paper and been explored and tested extensively in practice. However, FHE is made possible with many new problems and assumptions that are not yet well studied. In this thesis we present a comprehensive and intuitive overview of the current applied FHE landscape, from design to implementation, and draw attention to potential vulnerabilities both in theory and in practice. In more detail, we show how to use currently available FHE libraries for aggregation and select parameters to avoid weak FHE instances.

Description

Keywords

cryptography, fully homomorphic encryption

LC Keywords

Citation

URI

http://hdl.handle.net/10012/17513

Collections

Theses
Electrical and Computer Engineering