@inproceedings{e793b0aa3bec4123aabdeb267e3b329d,
title = "Feistel Structures for MPC, and More",
abstract = "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{\textquoteright}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.",
keywords = "Feistel, Multiplicative Complexity, Algebraic Attack, Secure Multiparty Computation (MPC), PQ-secure Signature Scheme, SNARKs",
author = "Albrecht, {Martin R.} and Lorenzo Grassi and L{\'e}o Perrin and Sebastian Ramacher and Christian Rechberger and Dragos Rotaru and Arnab Roy and Markus Schofnegger",
year = "2019",
doi = "10.1007/978-3-030-29962-0_8",
language = "English",
isbn = "978-3-030-29961-3",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "151--171",
booktitle = "Computer Security – ESORICS 2019",
note = "ESORICS 2019 : 24th European Symposium on Research in Computer Security ; Conference date: 23-09-2019 Through 27-09-2019",
}