Feistel Structures for MPC, and More

Martin R. Albrecht, Lorenzo Grassi, Léo Perrin, Sebastian Ramacher, Christian Rechberger, Dragos Rotaru, Arnab Roy, Markus Schofnegger

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review


We study approaches to generalized Feistel constructions with low-degree round functions with a focus on x -> x^3 . Besides known constructions, we also provide a new balanced Feistel construction with improved diffusion properties. This then allows us to propose more efficient generalizations of the MiMC design (Asiacrypt’16), which we in turn evaluate in three application areas. Whereas MiMC was not competitive at all in a recently proposed new class of PQ-secure signature schemes, our new construction leads to about 30 times smaller signatures than MiMC. In MPC use cases, where MiMC outperforms all other competitors, we observe improvements in throughput by a factor of more than 4 and simultaneously a 5-fold reduction of preprocessing effort, albeit at the cost of a higher latency. Another use case where MiMC already outperforms other designs, in the area of SNARKs, sees modest improvements. Additionally, this use case benefits from the flexibility to use smaller fields.
Original languageEnglish
Title of host publicationComputer Security – ESORICS 2019
Place of PublicationCham
ISBN (Print)978-3-030-29961-3
Publication statusPublished - 2019
EventESORICS 2019: 24th European Symposium on Research in Computer Security - Luxembourg, Luxembourg
Duration: 23 Sept 201927 Sept 2019

Publication series

NameLecture Notes in Computer Science


ConferenceESORICS 2019


  • Feistel
  • Multiplicative Complexity
  • Algebraic Attack
  • Secure Multiparty Computation (MPC)
  • PQ-secure Signature Scheme
  • SNARKs

Cite this