Paper 2024/1935 Original: eprint.iacr.org/2024/1935 ↗

RevoLUT : Rust Efficient Versatile Oblivious Look-Up-Tables

Sofiane Azogagh
Zelma Aubin Birba
Marc-Olivier Killijian
Félix Larose-Gervais
Sébastien Gambs
Abstract

In this paper we present RevoLUT, a library implemented in Rust that reimagines the use of Look-Up-Tables (LUT) beyond their conventional role in function encoding, as commonly used in TFHE's programmable boostrapping. Instead, RevoLUT leverages LUTs as first class objects, enabling efficient oblivious operations such as array access, elements sorting and permutation directly within the table. This approach supports oblivious algortithm, providing a secure, privacy-preserving solution for handling sensitive data in various applications.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Preprint.
History
2025-04-20: last updated
2024-11-29: published
Short URL
https://ia.cr/2024/1935
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2024/1935,
      author = {Sofiane Azogagh and Zelma Aubin Birba and Marc-Olivier Killijian and Félix Larose-Gervais and Sébastien Gambs},
      title = {RevoLUT : Rust Efficient Versatile Oblivious Look-Up-Tables},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1935},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1935}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.