{"ID":2858994,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2510.07479","arxiv_id":"2510.07479","title":"MIRANDA: short signatures from a leakage-free full-domain-hash scheme","abstract":"We present $\\mathsf{Miranda}$, the first family of full-domain-hash signatures based on matrix codes. This signature scheme fulfils the paradigm of Gentry, Peikert and Vaikuntanathan ($\\mathsf{GPV}$), which gives strong security guarantees. Our trapdoor is very simple and generic: if we propose it with matrix codes, it can actually be instantiated in many other ways since it only involves a subcode of a decodable code (or lattice) in a unique decoding regime of parameters. Though $\\mathsf{Miranda}$ signing algorithm relies on a decoding task where there is exactly one solution, there are many possible signatures given a message to sign and we ensure that signatures are not leaking information on their underlying trapdoor by means of a very simple procedure involving the drawing of a small number of uniform bits. In particular $\\mathsf{Miranda}$ does not use a rejection sampling procedure which makes its implementation a very simple task contrary to other $\\mathsf{GPV}$-like signatures schemes such as $\\mathsf{Falcon}$ or even $\\mathsf{Wave}$. We instantiate $\\mathsf{Miranda}$ with the famous family of Gabidulin codes represented as spaces of matrices and we study thoroughly its security (in the EUF-CMA security model). For~$128$ bits of classical security, the signature sizes are as low as~$90$ bytes and the public key sizes are in the order of~$2.6$ megabytes.","short_abstract":"We present $\\mathsf{Miranda}$, the first family of full-domain-hash signatures based on matrix codes. This signature scheme fulfils the paradigm of Gentry, Peikert and Vaikuntanathan ($\\mathsf{GPV}$), which gives strong security guarantees. Our trapdoor is very simple and generic: if we propose it with matrix codes, it...","url_abs":"https://arxiv.org/abs/2510.07479","url_pdf":"https://arxiv.org/pdf/2510.07479v1","authors":"[\"Alain Couvreur\",\"Thomas Debris-Alazard\",\"Philippe Gaborit\",\"Adrien Vinçotte\"]","published":"2025-10-08T19:24:24Z","proceeding":"cs.CR","tasks":"[\"cs.CR\",\"cs.IT\"]","methods":"[]","has_code":false}