Fast Blind Rotation for Bootstrapping FHEs

Abstract

Bootstrapping is currently the only way to achieve fully homomorphic encryption, and the efficiency of bootstrapping directly determines the efficiency bottleneck of fully homomorphic encryption. In the past 10 years, many domestic and foreign scholars and experts have been studying how to improve bootstrapping efficiency and thereby break through the efficiency bottleneck of fully homomorphic encryption.

In particular, the GSW-based bootstrapping algorithm has attracted much attention due to its fast calculation speed and low storage cost. This report will introduce a new GSW-like bootstrapping algorithm. The performance of this algorithm is independent of the key distribution in an asymptotic sense, and is superior to the internationally renowned algorithms AP and GINX ( Especially for larger key distributions).

About the speakers

Dai Yiran (1998-), a doctoral candidate at the Institute of Information Engineering, University of Chinese Academy of Sciences, is currently visiting the State Key Laboratory of Cryptozoology Science and Technology. Her research focus is on fully homomorphic encryption.

Unable to make it?

After the event has finished, resources (including slides, video, papers, etc) will be available at the resource page at https://fhe.org/meetups/047-Fast_Blind_Rotation_for_Bootstrapping_FHEs

Never miss an update

1. The newsletter where we post community announcements: https://fheorg.substack.com/
2. The discord server where you can discuss FHE related topics with the community: https://discord.fhe.org

Make sure to join either (or both) of these to stay informed about future events!