Paper 2024/1935

RevoLUT : Rust Efficient Versatile Oblivious Look-Up-Tables

Sofiane Azogagh, University of Quebec at Montreal
Zelma Aubin Birba, University of Quebec at Montreal
Marc-Olivier Killijian, University of Quebec at Montreal
Félix Larose-Gervais, University of Quebec at Montreal
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.
Keywords
PrivacyHomomorphic encryptionOblivious algorithmLibraryLook-Up-Table
Contact author(s)
azogagh sofiane @ courrier uqam ca
birba zelma_aubin @ courrier uqam ca
killijian marc-olivier 2 @ uqam ca
larose-gervais felix @ courrier uqam ca
History
2024-12-02: approved
2024-11-29: received
See all versions
Short URL
https://ia.cr/2024/1935
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2024/1935,
      author = {Sofiane Azogagh and Zelma Aubin Birba and Marc-Olivier Killijian and Félix Larose-Gervais},
      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, eprint.iacr.org does not use cookies or embedded third party content.