Paper 2023/499

FLUTE: Fast and Secure Lookup Table Evaluations (Full Version)

Andreas Brüggemann, Technical University of Darmstadt
Robin Hundt, Technical University of Darmstadt
Thomas Schneider, Technical University of Darmstadt
Ajith Suresh, Technical University of Darmstadt
Hossein Yalame, Technical University of Darmstadt

The concept of using Lookup Tables (LUTs) instead of Boolean circuits is well-known and been widely applied in a variety of applications, including FPGAs, image processing, and database management systems. In cryptography, using such LUTs instead of conventional gates like AND and XOR results in more compact circuits and has been shown to substantially improve online performance when evaluated with secure multi-party computation. Several recent works on secure floating-point computations and privacy-preserving machine learning inference rely heavily on existing LUT techniques. However, they suffer from either large overhead in the setup phase or subpar online performance. We propose FLUTE, a novel protocol for secure LUT evaluation with good setup and online performance. In a two-party setting, we show that FLUTE matches or even outperforms the online performance of all prior approaches, while being competitive in terms of overall performance with the best prior LUT protocols. In addition, we provide an open-source implementation of FLUTE written in the Rust programming language, and implementations of the Boolean secure two-party computation protocols of ABY2.0 and silent OT. We find that FLUTE outperforms the state of the art by two orders of magnitude in the online phase while retaining similar overall communication.

Note: This is the full version of our research paper that has been accepted for publication at the 2023 IEEE Security & Privacy (IEEE S&P) conference.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. IEEE Security & Privacy 2023
Lookup Tables2PCABY2.0PrivacyBooleanLUTsMPC
Contact author(s)
brueggemann @ encrypto cs tu-darmstadt de
hundt @ stud tu-darmstadt de
schneider @ encrypto cs tu-darmstadt de
suresh @ encrypto cs tu-darmstadt de
yalame @ encrypto cs tu-darmstadt de
2023-04-07: approved
2023-04-06: received
See all versions
Short URL
Creative Commons Attribution


      author = {Andreas Brüggemann and Robin Hundt and Thomas Schneider and Ajith Suresh and Hossein Yalame},
      title = {FLUTE: Fast and Secure Lookup Table Evaluations (Full Version)},
      howpublished = {Cryptology ePrint Archive, Paper 2023/499},
      year = {2023},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.