Title: RTG paper presented at the IEEE Symposium on Security and Privacy (S&P, Core-Rank: A*)

The paper “FLUTE: Fast and Secure Lookup Table Evaluations (opens in new tab)” by RTG PhD Candidate Andreas Brüggemann, Robin Hundt, RTG PI Thomas Schneider, Ajith Suresh and Hossein Yalame (all TU Darmstadt, Computer Science) was accepted at the 44th IEEE Symposium on Security and Privacy, one of the most renowned conferences in the field of computer security and electronic privacy. Andreas Brüggemann presented the paper on May 22 in San Francisco.

The paper considers Lookup Tables (LUTs), i.e., individually programmable boolean gates with a freely chosen number of inputs and outputs, in the context of secure multi-party computation (MPC) which allows multiple parties to run computation on their joined data without leaking it. In MPC, LUTs are useful for attaining fast computation once the parties provide their input (online phase) at the expense of more required preprocessing. Here, the researchers were able to provide the first protocol for LUTs that offers a highly efficient online phase as well as efficient preprocessing while prior approaches were limited to optimizing one of these two aspects.