MinRank in the head. Short signatures from zero-knowledge proofs

DOI10.1007/978-3-031-37679-5_1MaRDI QIDQ6145535FDOQ6145535

Authors: Gora Adj, Luis Rivera-Zamarripa, Javier A. Verbel 

Publication date: 2 February 2024

Published in: Progress in Cryptology - AFRICACRYPT 2023 (Search for Journal in Brave)

Recommendations

• Building MPCitH-based signatures from MQ, MinRank, and rank SD
• MR-DSS -- smaller MinRank-based (ring-)signatures
• scientific article; zbMATH DE number 2081078
• Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems

zbMATH Keywords

proof of knowledgezero-knowledgeMinRankMPC-in-the-hea

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• The computational complexity of some problems of linear algebra
• Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
• Cryptanalysis of MinRank
• Title not available (Why is that?)
• On the Complexity of the Rank Syndrome Decoding Problem
• Title not available (Why is that?)
• From 5-pass \(\mathcal {MQ}\)-based identification to \(\mathcal {MQ}\)-based signatures
• Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
• Improvements of algebraic attacks for solving the rank decoding and MinRank problems
• On the complexity of ``Superdetermined minrank instances
• Improved cryptanalysis of UOV and Rainbow
• An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
• Efficient key recovery for all HFE signature variants
• Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
• Revisiting algebraic attacks on MinRank and on the rank decoding problem
• Efficient information-theoretic multi-party computation over non-commutative rings
• Improvement of algebraic attacks for solving superdetermined MinRank instances
• Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
• Breaking rainbow takes a weekend on a laptop
• MR-DSS -- smaller MinRank-based (ring-)signatures

Cited In (2)

• MPC in the head using the subfield bilinear collision problem
• Building MPCitH-based signatures from MQ, MinRank, and rank SD

This page was built for publication: MinRank in the head. Short signatures from zero-knowledge proofs

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