Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
From MaRDI portal
Recommendations
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Zero-knowledge proofs for committed symmetric Boolean functions
- Advances in Cryptology – CRYPTO 2004
- Commitments and efficient zero-knowledge proofs from learning parity with noise
- A non-PCP approach to succinct quantum-safe zero-knowledge
Cites work
- A new identification scheme based on syndrome decoding
- A new paradigm for public key identification
- A zero-knowledge identification scheme based on the q-ary syndrome decoding problem
- Advances in Cryptology - CRYPTO 2003
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric
- Commitments and efficient zero-knowledge proofs from learning parity with noise
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Full cryptanalysis of the Chen identification protocol
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- scientific article; zbMATH DE number 1759341 (Why is no real title available?)
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- Improved identification schemes based on error-correcting codes
- Improved Zero-Knowledge Identification with Lattices
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Key recovery attacks on some rank metric code-based signatures
- Lattice-Based Identification Schemes Secure Under Active Attacks
- New technique for decoding codes in the rank metric and its cryptography applications
- On computing nearest neighbors with applications to decoding of binary linear codes
- On the Complexity of the Rank Syndrome Decoding Problem
- On the inherent intractability of certain coding problems (Corresp.)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- RLWE-based zero-knowledge proofs for linear and multiplicative relations
- The Knowledge Complexity of Interactive Proof Systems
- Theory of codes with maximum rank distance
Cited in
(7)- A gapless code-based hash proof system based on RQC and its applications
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Efficient zero-knowledge identification based on matrix completion problem
- Revisiting algebraic attacks on MinRank and on the rank decoding problem
- MR-DSS -- smaller MinRank-based (ring-)signatures
- zk-SNARKs from codes with rank metrics
This page was built for publication: Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488038)
