\texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications

DOI10.1007/978-3-031-38548-3_19MaRDI QIDQ6186772zbMATH OpenFDO

Authors Lorenzo Grassi, Yonglin Hao, Christian Rechberger, Markus Schofnegger, Roman Walch, Qingju Wang

Publication date 2 February 2024

Published in Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

zbMATH Keywords

hash functionszero-knowledge\textit{Fluid}-SPN\textsc{Griffin}horst

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
• Feistel structures for MPC, and more
• MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
• Security of the Poseidon hash function against non-binary differential and linear attacks
• Spartan: efficient and general-purpose zkSNARKs without trusted setup

Cites work

• scientific article; zbMATH DE number 177050 (Why is no real title available?)
• scientific article; zbMATH DE number 503238 (Why is no real title available?)
• scientific article; zbMATH DE number 1024070 (Why is no real title available?)
• scientific article; zbMATH DE number 1942429 (Why is no real title available?)
• scientific article; zbMATH DE number 1951617 (Why is no real title available?)
• scientific article; zbMATH DE number 2009979 (Why is no real title available?)
• scientific article; zbMATH DE number 2081068 (Why is no real title available?)
• scientific article; zbMATH DE number 1759317 (Why is no real title available?)
• scientific article; zbMATH DE number 1394292 (Why is no real title available?)
• scientific article; zbMATH DE number 967945 (Why is no real title available?)
• About Feistel schemes with six (or more) rounds
• Algebraic cryptanalysis of STARK-friendly designs: application to MARVELlous and MiMC
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Aurora: transparent succinct arguments for R1CS
• Feistel structures for MPC, and more
• Higher-order differential properties of Keccak and Luffa
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Indifferentiability of 8-Round Feistel Networks
• Ligero: lightweight sublinear arguments without a trusted setup
• MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
• On a generalization of substitution-permutation networks: the HADES design strategy
• On generalized Feistel networks
• On permutation polynomials over finite fields
• On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
• On the Indifferentiability of the Sponge Construction
• On the size of pairing-based non-interactive arguments
• Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
• Rebound attack on the full Lane compression function
• Rebound distinguishers: results on the full Whirlpool compression function
• Reverse-engineering the S-Bbox of Streebog, Kuznyechik and Stribobr1
• Scalable zero knowledge with no trusted setup
• Selected Areas in Cryptography
• The Random Oracle Model and the Ideal Cipher Model Are Equivalent
• The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Grøstl
• The Wide Trail Design Strategy
• The interpolation attack on block ciphers
• \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields

Cited in

(2)

• Security analysis of P-SPN schemes against invariant subspace attack with inactive S-boxes
• The algebraic FreeLunch: efficient Gröbner basis attacks against arithmetization-oriented primitives

This page was built for publication: \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186772)