Markus Schofnegger

RainHash2.0: Hardware- and Arithmetization-friendly Hash Function

Jiamin Cui, Lorenzo Grassi, Katharina Koschatko, Florian Krieger et autres

Zero-knowledge (ZK) proof systems have developed rapidly in recent years, with hash functions as one of their central building blocks. Since these often dominate the prover cost, circuit-friendly hash function design has become an active research area. Most hash proposals target prime …

cn, nl, at, gb (code pays fourni par la source)

Poseidon(2)b

Lorenzo Grassi, Dmitry Khovratovich, Katharina Koschatko, Christian Rechberger et autres

We present Poseidonb and Poseidon2b, natural variants of Poseidon and Poseidon2, respectively, defined over binary extension fields with a target security level of 128 bits. They are specifically designed to inherit many of the circuit-friendly properties of their prime field version, and …

pa, nl, us, ch, at, cn (code pays fourni par la source)

Skyscraper: Fast Hashing on Big Primes

Clémence Bouvier, Lorenzo Grassi, Dmitry Khovratovich, Katharina Koschatko et autres

Arithmetic hash functions defined over prime fields have been actively developed and used in verifiable computation (VC) protocols. Among those, ellipticcurve- based SNARKs require large (256-bit and higher) primes. Such hash functions are notably slow, losing a factor of up to 1000 …

fr, de, ch, lu, pt, us, at, cn (code pays fourni par la source)

Monolith: Circuit-Friendly Hash Functions with New Nonlinear Layers for Fast and Constant-Time Implementations

Lorenzo Grassi, Dmitry Khovratovich, Reinhard Lüftenegger, Christian Rechberger et autres

Hash functions are a crucial component in incrementally verifiable computation (IVC) protocols and applications. Among those, recursive SNARKs and folding schemes require hash functions to be both fast in native CPU computations and compact in algebraic descriptions (constraints). However, neither SHA-2/3 nor …

de, lu, ch, at, us (code pays fourni par la source)

Pasta: A Case for Hybrid Homomorphic Encryption

Christoph Dobraunig, Lorenzo Grassi, Lukas Helminger, Christian Rechberger et autres

The idea of hybrid homomorphic encryption (HHE) is to drastically reduce bandwidth requirements when using homomorphic encryption (HE) at the cost of more expensive computations in the encrypted domain. To this end, various dedicated schemes for symmetric encryption have already been proposed. …

nl, at (code pays fourni par la source)

From Farfalle to Megafono via Ciminion: The PRF Hydra for MPC Applications

Lorenzo Grassi, Morten Øygarden, Markus Schofnegger, Roman Walch

nl, no, at, de (code pays fourni par la source)

Poseidon2: A Faster Version of the Poseidon Hash Function

Lorenzo Grassi, Dmitry Khovratovich, Markus Schofnegger

de, ch (code pays fourni par la source)

Horst Meets Fluid-SPN: Griffin for Zero-Knowledge Applications

Lorenzo Grassi, Yonglin Hao, Christian Rechberger, Markus Schofnegger et autres

de, cn, at, fr (code pays fourni par la source)

Shorter Signatures Based on Tailor-Made Minimalist Symmetric-Key Crypto

Christoph Dobraunig, Daniel Kales, Christian Rechberger, Markus Schofnegger et autres

Signature schemes based on the MPC-in-the-head approach (MPCitH) have either been designed by taking a proof system and selecting a suitable symmetric-key primitive (Picnic, CCS16), or starting with an existing primitive such as AES and trying to find the most suitable proof …

at, us (code pays fourni par la source)

Reinforced Concrete

Lorenzo Grassi, Dmitry Khovratovich, Reinhard Lüftenegger, Christian Rechberger et autres

We propose a new hash function Reinforced Concrete, which is the first generic purpose hash that is fast both for a zero-knowledge prover and in native x86 computations. It is suitable for a various range of zero-knowledge proofs and protocols, from set …

nl, at (code pays fourni par la source)

Practical key recovery attacks on FlexAEAD

Orr Dunkelman, Maria Eichlseder, Daniel Kales, Nathan Keller et autres

il, at, fr (code pays fourni par la source)

Influence of the Linear Layer on the Algebraic Degree in SP-Networks

Carlos Cid, Lorenzo Grassi, Aldo Gunsing, Reinhard Lüftenegger et autres

We consider SPN schemes, i.e., schemes whose non-linear layer is defined as the parallel application of t ≥ 1 independent S-Boxes over F2n and whose linear layer is defined by the multiplication with a (n · t) × (n · t) matrix …

gb, no, nl, at (code pays fourni par la source)