Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge

DOI10.1016/j.tcs.2023.113731OpenAlexW4319880777MaRDI QIDQ2693627

Yanyan Li

Publication date: 24 March 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113731

zbMATH Keywords

code-based cryptographypost-quantum cryptographyrank metriczero-knowledge proof of knowledge

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• McEliece
• Durandal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved identification schemes based on error-correcting codes
• Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
• Decoding linear codes with high error rate and its impact for LPN security
• Identity-based encryption from codes with rank metric
• New technique for decoding codes in the rank metric and its cryptography applications
• An algebraic attack on rank metric code-based cryptosystems
• Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
• An algebraic approach to the rank support learning problem
• Key recovery attacks on some rank metric code-based signatures
• Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
• Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
• A code-based signature scheme from the Lyubashevsky framework
• Durandal: a rank metric based signature scheme
• Cryptanalysis of a rank-based signature with short public keys
• On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
• Improvements of algebraic attacks for solving the rank decoding and MinRank problems
• RankSign: An Efficient Signature Algorithm Based on the Rank Metric
• On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
• On the Complexity of the Rank Syndrome Decoding Problem
• A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
• Full Cryptanalysis of the Chen Identification Protocol
• Cryptanalysis of MinRank
• On the inherent intractability of certain coding problems (Corresp.)
• A new identification scheme based on syndrome decoding
• Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
• Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
• Provably Secure Group Signature Schemes From Code-Based Assumptions
• Efficient Encryption From Random Quasi-Cyclic Codes
• Revisiting algebraic attacks on MinRank and on the rank decoding problem
• Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
• Code-Based Signature Schemes from Identification Protocols in the Rank Metric

This page was built for publication: Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge