Brüggemann, Andreas ; Hundt, Robin ; Schneider, Thomas ; Suresh, Ajith ; Yalame, Hossein (2023)
FLUTE: Fast and Secure Lookup Table Evaluations.
Report, Bibliographie
 | Es ist eine neuere Version dieses Eintrags verfügbar. |
Kurzbeschreibung (Abstract)
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.
| Typ des Eintrags: | Report |
|---|---|
| Erschienen: | 2023 |
| Autor(en): | Brüggemann, Andreas ; Hundt, Robin ; Schneider, Thomas ; Suresh, Ajith ; Yalame, Hossein |
| Art des Eintrags: | Bibliographie |
| Titel: | FLUTE: Fast and Secure Lookup Table Evaluations |
| Sprache: | Englisch |
| Publikationsjahr: | April 2023 |
| Verlag: | Cryptology ePrint Archive |
| Reihe: | Cryptographic Protocols |
| URL / URN: | https://eprint.iacr.org/2023/499 |
| Kurzbeschreibung (Abstract): | 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. |
| Zusätzliche Informationen: | Preprint |
| Fachbereich(e)/-gebiet(e): | DFG-Graduiertenkollegs DFG-Graduiertenkollegs > Graduiertenkolleg 2050 Privacy and Trust for Mobile Users |
| Hinterlegungsdatum: | 03 Mai 2023 08:28 |
| Letzte Änderung: | 22 Jul 2024 12:14 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
Verfügbare Versionen dieses Eintrags
- FLUTE: Fast and Secure Lookup Table Evaluations. (deposited 03 Mai 2023 08:28) [Gegenwärtig angezeigt]
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum