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 contributionResearchpeer-review

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’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 publicationESORICS 2019
Number of pages54
Publication statusAccepted/In press - 21 Jun 2019
EventESORICS 2019: 24th European Symposium on Research in Computer Security - Luxembourg, Luxembourg
Duration: 23 Sep 201927 Sep 2019

Conference

ConferenceESORICS 2019
CountryLuxembourg
CityLuxembourg
Period23/09/1927/09/19

Fingerprint

Throughput

Keywords

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

Cite this

Albrecht, M. R., Grassi, L., Perrin, L., Ramacher, S., Rechberger, C., Rotaru, D., ... Schofnegger, M. (Accepted/In press). Feistel Structures for MPC, and More. In ESORICS 2019

Feistel Structures for MPC, and More. / Albrecht, Martin R.; Grassi, Lorenzo; Perrin, Léo; Ramacher, Sebastian; Rechberger, Christian; Rotaru, Dragos; Roy, Arnab; Schofnegger, Markus.

ESORICS 2019. 2019.

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

Albrecht, MR, Grassi, L, Perrin, L, Ramacher, S, Rechberger, C, Rotaru, D, Roy, A & Schofnegger, M 2019, Feistel Structures for MPC, and More. in ESORICS 2019. ESORICS 2019, Luxembourg, Luxembourg, 23/09/19.
Albrecht MR, Grassi L, Perrin L, Ramacher S, Rechberger C, Rotaru D et al. Feistel Structures for MPC, and More. In ESORICS 2019. 2019
Albrecht, Martin R. ; Grassi, Lorenzo ; Perrin, Léo ; Ramacher, Sebastian ; Rechberger, Christian ; Rotaru, Dragos ; Roy, Arnab ; Schofnegger, Markus. / Feistel Structures for MPC, and More. ESORICS 2019. 2019.
@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’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",
month = "6",
day = "21",
language = "English",
booktitle = "ESORICS 2019",

}

TY - GEN

T1 - Feistel Structures for MPC, and More

AU - Albrecht, Martin R.

AU - Grassi, Lorenzo

AU - Perrin, Léo

AU - Ramacher, Sebastian

AU - Rechberger, Christian

AU - Rotaru, Dragos

AU - Roy, Arnab

AU - Schofnegger, Markus

PY - 2019/6/21

Y1 - 2019/6/21

N2 - 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.

AB - 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.

KW - Feistel

KW - Multiplicative Complexity

KW - Algebraic Attack

KW - Secure Multiparty Computation (MPC)

KW - PQ-secure Signature Scheme

KW - SNARKs

M3 - Conference contribution

BT - ESORICS 2019

ER -