Publikationen

Autor	Brüggemann, Andreas; Hundt, Robin; Schneider, Thomas; Suresh, Ajith; Yalame, Hossein
Datum	2023
Art	Conference Proceedings
Abstrakt	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.
Konferenz	44th IEEE Symposium on Security and Privacy
ISBN	978-1-6654-9336-9
In	Proceedings: 44th IEEE Symposium on Security and Privacy: SP 2023, p.515-533
Publisher	IEEE
Url	https://tubiblio.ulb.tu-darmstadt.de/id/eprint/137674