From Farfalle to Megafono via Ciminion: The PRF Hydra for MPC Applications
Lorenzo Grassi, Morten Øygarden, Markus Schofnegger, Roman Walch
Abstract
The area of multi-party computation (MPC) has recently increased in popularity and number of use cases. At the current state of the art, Ciminion, a Farfalle-like cryptographic function, achieves the best performance in MPC applications involving symmetric primitives. However, it has a critical weakness. Its security highly relies on the independence of its subkeys, which is achieved by using an expensive key schedule. Many MPC use cases involving symmetric pseudo-random functions (PRFs) rely on secretly shared symmetric keys, and hence the expensive key schedule must also be computed in MPC. As a result, Ciminion's performance is significantly reduced in these use cases.
In this paper we solve this problem. Following the approach introduced by Ciminion's designers, we present a novel primitive in symmetric cryptography called Megafono. Megafono is a keyed extendable PRF, expanding a fixed-length input to an arbitrary-length output. Similar to Farfalle, an initial keyed permutation is applied to the input, followed by an expansion layer, involving the parallel application of keyed ciphers. The main novelty regards the expansion of the intermediate/internal state for "free", by appending the sum of the internal states of the first permutation to its output. The combination of this and other modifications, together with the impossibility for the attacker to have access to the input state of the expansion layer, make Megafono very efficient in the target application.
As a concrete example, we present the PRF Hydra, an instance of Megafono based on the Hades strategy and on generalized versions of the Lai--Massey scheme. Based on an extensive security analysis, we implement Hydra in an MPC framework. The results show that it outperforms all MPC-friendly schemes currently published in the literature.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 87f1f6a6-9cd7-4c31-8b50-25843bc14e7eCited by top-tier papers2
- New Design Techniques for Efficient Arithmetization-Oriented Hash Functions: ttAnemoi Permutations and ttJive Compression ModeClémence Bouvier, Pierre Briaud, Pyrros Chaidos, Léo Perrin et al.CRYPTO 2023 · 37 citations
- LaKey: Efficient Lattice-Based Distributed PRFs Enable Scalable Distributed Key ManagementMatthias Geihs, Hart MontgomeryUSENIX Security 2024 · 7 citations
Related papers
- MPC-Friendly Symmetric Key PrimitivesLorenzo Grassi, Christian Rechberger, Dragos Rotaru, Peter Scholl et al.CCS 2016 · 119 citations
- On the Security of Keyed Hashing Based on Public PermutationsJonathan Fuchs, Yann Rotella, Joan DaemenCRYPTO 2023 · 5 citations
- MPC-Friendly Symmetric Cryptography from Alternating Moduli: Candidates, Protocols, and ApplicationsItai Dinur, Steven Goldfeder, Tzipora Halevi, Yuval Ishai et al.CRYPTO 2021 · 37 citations
- Ciminion: Symmetric Encryption Based on Toffoli-Gates over Large Finite FieldsChristoph Dobraunig, Lorenzo Grassi, Anna Guinet, Daniël KuijstersEUROCRYPT 2021 · 64 citations
- 5Gen-C: Multi-input Functional Encryption and Program Obfuscation for Arithmetic CircuitsBrent Carmer, Alex J. Malozemoff, Mariana RaykovaCCS 2017 · 17 citations
