Advanced search
Start date
Betweenand


Amortized Bootstrapping Revisited: Simpler, Asymptotically-Faster, Implemented

Full text
Author(s):
Guimaraes, Antonio ; Pereira, Hilder V. L. ; van Leeuwen, Barry
Total Authors: 3
Document type: Journal article
Source: ADVANCES IN CRYPTOLOGY, ASIACRYPT 2023, PART VI; v. 14443, p. 33-pg., 2023-01-01.
Abstract

Micciancio and Sorrel (ICALP 2018) proposed a bootstrapping algorithm that can refresh many messages at once with sublinearly many homomorphic operations per message. However, despite the attractive asymptotic cost, it is unclear if their algorithm could ever be practical, which reduces the impact of their results. In this work, we follow their general framework, but propose an amortized bootstrapping procedure that is conceptually simpler and asymptotically cheaper. We reduce the number of homomorphic multiplications per refreshed message from O(3(rho) center dot n(1/rho) center dot log n) to O(rho center dot n(1/rho)), and the noise overhead from (O) over tilde (n(2+3 center dot rho)) to (O) over tilde (n(1+rho)), where n is the security level and rho >= 1 is a free parameter. We also make it more general, by handling non-binary messages and applying programmable bootstrapping. To obtain a concrete instantiation of our bootstrapping algorithm, we describe a double-CRT (aka RNS) version of the GSW scheme, including a new operation, called shrinking, used to speed-up homomorphic operations by reducing the dimension and ciphertext modulus of the ciphertexts. We also provide a C++ implementation of our algorithm, thus showing for the first time the practicability of the amortized bootstrapping. Moreover, it is competitive with existing bootstrapping algorithms, being even around 3.4 times faster than an equivalent non-amortized version of our bootstrapping. (AU)

FAPESP's process: 13/08293-7 - CCES - Center for Computational Engineering and Sciences
Grantee:Munir Salomao Skaf
Support Opportunities: Research Grants - Research, Innovation and Dissemination Centers - RIDC
FAPESP's process: 21/09849-5 - Efficient multi-key homomorphic evaluation for applications in genomics
Grantee:Antonio Carlos Guimarães Junior
Support Opportunities: Scholarships abroad - Research Internship - Doctorate
FAPESP's process: 19/12783-6 - Efficient migration of high-performance computing science and engineering applications to the cloud
Grantee:Antonio Carlos Guimarães Junior
Support Opportunities: Scholarships in Brazil - Doctorate