Olive Chakraborty
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Olive Chakraborty has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Antonina Bondarchuk
Université Paris-Saclay, CEA, List
2 shared publications - Aymen Boudguiga
Université Paris-Saclay, CEA-List, Palaiseau, France
2 shared publications - Renaud Sirdey
Université Paris-Saclay, CEA, List
2 shared publications - Andreea Alexandru
Duality Technologies
1 shared publication - Geoffroy Couteau
Université Paris Cité, CNRS, IRIF
1 shared publication - Jules Dumezy
Université Paris-Saclay, CEA-List, France
1 shared publication
Latest Publications
- 9 July 2026
- Published by Springer Nature
- p. 133-159
Threshold (T)FHE Without Smudging by Means of Correct Threshold Additive HE
- 9 July 2026
- Published by Springer Nature
- p. 133-159
Threshold (T)FHE Without Smudging by Means of Correct Threshold Additive HE
- Open Access
- 16 January 2026
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Cryptographic Hardware and Embedded Systems
- Vol. 2026 (1) , 559-591
Evaluating Larger Lookup Tables using CKKS
The Cheon–Kim–Kim–Song (CKKS) scheme is a fully homomorphic encryption scheme that traditionally supports only the evaluation of smooth functions. Recent works have enabled the evaluation of arbitrary (discontinuous) integer functions represented as lookup tables (LUT) on small inputs using the method of functional bootstrapping (FBT). Although well-suited for small integers (up to around 10 bits), the efficiency of FBT quickly declines for large LUTs, and a considerable increase in both runtime and memory requirements is observed. Building on CKKS functional bootstrapping, we propose in this paper two functional bootstrapping algorithms, specifically designed to target larger LUTs (up to 20 bits). For a 16-bit LUT, our implementation in OpenFHE achieves a speed-up of 47.5 in amortized time and 95.1 in latency for single-threaded execution, compared to the state-of-the-art CKKS-based functional bootstrapping method of Alexandru et al. (CRYPTO’25).
- 16 January 2026
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Cryptographic Hardware and Embedded Systems
- Vol. 2026 (1) , 559-591
Open AccessEvaluating Larger Lookup Tables using CKKS
The Cheon–Kim–Kim–Song (CKKS) scheme is a fully homomorphic encryption scheme that traditionally supports only the evaluation of smooth functions. Recent works have enabled the evaluation of arbitrary (discontinuous) integer functions represented as lookup tables (LUT) on small inputs using the method of functional bootstrapping (FBT). Although well-suited for small integers (up to around 10 bits), the efficiency of FBT quickly declines for large LUTs, and a considerable increase in both runtime and memory requirements is observed. Building on CKKS functional bootstrapping, we propose in this paper two functional bootstrapping algorithms, specifically designed to target larger LUTs (up to 20 bits). For a 16-bit LUT, our implementation in OpenFHE achieves a speed-up of 47.5 in amortized time and 95.1 in latency for single-threaded execution, compared to the state-of-the-art CKKS-based functional bootstrapping method of Alexandru et al. (CRYPTO’25).