zk-SNARKs from Codes with Rank Metrics - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

zk-SNARKs from Codes with Rank Metrics

Xuan-Thanh Do
Dang-Truong Mac
Quoc-Huy Vu

Résumé

Succinct non-interactive zero-knowledge arguments of knowledge (zk-SNARKs) are a type of non-interactive proof system enabling efficient privacy-preserving proofs of membership for NP languages. A great deal of works has studied candidate constructions that are secure against quantum attackers, which are based on either lattice assumptions, or post-quantum collision-resistant hash functions. In this paper, we propose a code-based zk-SNARK scheme, whose security is based on the rank support learning (RSL) problem, a variant of the random linear code decoding problem in the rank metric. Our construction follows the general framework of Gennaro et al. (CCS'18), which is based on square span programs (SSPs). Due to the fundamental differences between the hardness assumptions, our proof of security cannot apply the techniques from the lattice-based constructions, and indeed, it distinguishes itself by the use of techniques from coding theory. We also provide the scheme with a set of concrete parameters.
Fichier principal
Vignette du fichier
main.pdf (375.91 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04212679 , version 1 (20-09-2023)

Licence

Domaine public

Identifiants

  • HAL Id : hal-04212679 , version 1

Citer

Xuan-Thanh Do, Dang-Truong Mac, Quoc-Huy Vu. zk-SNARKs from Codes with Rank Metrics. 19th IMA International Conference on Cryptography and Coding, Dec 2023, London, United Kingdom. ⟨hal-04212679⟩

Collections

ANR
73 Consultations
64 Téléchargements

Partager

Gmail Facebook X LinkedIn More