SOFIA: MQ-based signatures in the QROM

No abstract is available for this paper.

• Publication year

  2018

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  2018-03-25

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-319-76581-5_1
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model

  2018cited by this paper
• Post-Quantum Zero-Knowledge Proofs for Accumulators with Applications to Ring Signatures from Symmetric-Key Primitives

  2018cited by this paper
• Tightly-Secure Signatures from Five-Move Identification Protocols

  2017cited by this paper
• Revisiting TESLA in the Quantum Random Oracle Model

  2017cited by this paper
• Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives

  2017influential reference
• A Crossbred Algorithm for Solving Boolean Polynomial Systems

  2017influential reference
• A Note on Quantum-Secure PRPs

  2016cited by this paper
• From 5-Pass MQ -Based Identification to MQ -Based Signatures

  2016cited by this paper
• Solving Binary MQ with Grover's Algorithm

  2016cited by this paper
• Computers And Intractability A Guide To The Theory Of Np Completeness

  2016cited by this paper
• Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model

  2015cited by this paper
• SPHINCS: Practical Stateless Hash-Based Signatures

  2015cited by this paper
• TESLA: Tightly-Secure Efficient Signatures from Standard Lattices

  2015cited by this paper
• Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding

  2014cited by this paper
• About the security of multivariate quadratic public key schemes

  2013cited by this paper
• The Fiat-Shamir Transformation in a Quantum World

  2013cited by this paper
• Operating Degrees for XL vs. F4/F5 for Generic $\mathcal{M}Q$ with Number of Equations Linear in That of Variables

  2013cited by this paper
• On the complexity of the F5 Gröbner basis algorithm

  2013cited by this paper
• Extended security arguments for signature schemes

  2012cited by this paper
• Solving polynomial systems over finite fields: improved analysis of the hybrid approach

  2012cited by this paper
• On the complexity of solving quadratic Boolean systems

  2011cited by this paper
• Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials

  2011influential reference
• Fast Exhaustive Search for Polynomial Systems in F2

  2010cited by this paper
• Fast Exhaustive Search for Polynomial Systems in F2

  2010cited by this paper
• Cryptanalysis of MinRank

  2008cited by this paper
• Note on Design Criteria for Rainbow-Type Multivariates

  2006cited by this paper
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors

  2005cited by this paper
• All in the XL Family: Theory and Practice

  2004cited by this paper
• Theoretical Analysis of XL over Small Fields

  2004influential reference
• The XL-Algorithm and a Conjecture from Commutative Algebra

  2004cited by this paper
• A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)

  2002cited by this paper
• Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank

  2001influential reference
• Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations

  2000cited by this paper
• A new efficient algorithm for computing Gröbner bases (F4)

  1999cited by this paper
• Certifying inconsistency of sparse linear systems

  1998cited by this paper
• A fast quantum mechanical algorithm for database search

  1996cited by this paper
• Security Proofs for Signature Schemes

  1996cited by this paper
• Hidden Field Equations (HFE) and Isomorphisms of Polynomials (IP): two new Families of Asymmetric Algorithms - Extended Version -

  1996cited by this paper
• Johnson: computers and intractability: a guide to the theory of np- completeness (freeman

  1979cited by this paper

• Multi-homogeneous XL

  2025cites this paper
• On Symbolic Computations over Arbitrary Commutative Rings via Temporal Jordan-Gauss Graphs and Multivariate Cryptosystems

  2025cites this paper
• On graph based pseudo quadratic multivariate maps of prescribed degree as instruments of key establishment

  2025cites this paper
• Faster Quantum Algorithms for MQ2 and Applications

  2025cites this paper
• On symbolic computations over arbitrary commutative rings and cryptography with the temporal Jordan-Gauss graphs

  2025cites this paper
• On the expanding graphs of large girth and algorithms of key establishment

  2025cites this paper
• On the cryptosystems based on two Eulerian transfor-mations defined over the commutative rings Z2s, s>1

  2024cites this paper
• On short digital signatures with Eulerian transformations

  2024cites this paper
• On historical Multivariate Cryptosystems and their restorations as instruments of Post-Quantum Cryptography

  2024cites this paper
• Jordan-Gauss graphs and quadratic public keys of Multivariate Cryptography

  2024cites this paper
• On Schubert cells of projective geometry and pseudo-quadratic public keys of multivariate cryptography (short paper)

  2024cites this paper
• Straight-Line Knowledge Extraction for Multi-Round Protocols

  2024cites this paper
• On the Jordan-Gauss graphs and new multivariate public keys

  2024cites this paper
• On Schubert cells of Projective Geometry and quadratic public keys of Multivariate Cryptography

  2024cites this paper
• A Generic Transform from Multi-Round Interactive Proof to NIZK

  2023cites this paper
• Progress in Multivariate Cryptography: Systematic Review, Challenges, and Research Directions

  2022cites this paper
• An Estimator for the Hardness of the MQ Problem

  2022cites this paper
• Novel Postquantum MQ-Based Signature Scheme for Internet of Things With Parallel Implementation

  2021cites this paper
• A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKs

  2021cites this paper
• A secure and efficient group signature scheme based on multivariate public key cryptography

  2021cites this paper
• The Measure-and-Reprogram Technique 2.0: Multi-Round Fiat-Shamir and More

  2020cites this paper
• Constant-time verification for cut-and-choose-based signatures

  2020influential citation
• An Efficient MQ-based Signature with Tight Security Proof

  2020influential citation
• Post-quantum digital signature scheme based on multivariate cubic problem

  2020cites this paper
• Certificateless Broadcast Multisignature Scheme Based on MPKC

  2020cites this paper
• Practical post-quantum cryptography

  2019cites this paper
• An Efficient MQ-Based Signature in the QROM

  2019influential citation
• Quantum security proofs using semi-classical oracles

  2019cites this paper
• Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures

  2018cites this paper
• Fast Quantum Algorithm for Solving Multivariate Quadratic Equations

  2017cites this paper