RMQ-based cryptographic protocols

Develop competitive cryptographic protocols whose security relies on the hardness of the Regular Multivariate Quadratic (RMQ) problem, and investigate the conjecture that RMQ supports many cryptographic applications by constructing and analyzing concrete schemes (e.g., digital signatures or MPC-in-the-head-style protocols) based on RMQ.

Background

The RMQ problem is positioned as a new NP-complete variant closely related to MQ and to regular syndrome decoding (RSD), both of which underpin practical cryptographic constructions such as digital signatures and MPC-in-the-head schemes.

Motivated by these antecedents, the authors conjecture RMQ will similarly enable cryptographic applications and explicitly leave the task of devising competitive RMQ-based protocols for future work.