Generic error SDP and generic error CVE
From MaRDI portal
Recommendations
Cites work
- A compactness argument in the additive theory and the polynomial method.
- A zero-knowledge identification scheme based on the q-ary syndrome decoding problem
- Adversarial Network Coding
- An algebraic approach for decoding spread codes
- An inverse theorem for the restricted set addition in Abelian groups.
- Averaging bounds for lattices and linear codes
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Foundations of Cryptography
- scientific article; zbMATH DE number 820499 (Why is no real title available?)
- Introduction to Coding Theory
- Introduction to post-quantum cryptography
- LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
- New technique for decoding codes in the rank metric and its cryptography applications
- On the Complexity of the Rank Syndrome Decoding Problem
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
- On the hardness of the Lee syndrome decoding problem
- On the inherent intractability of certain coding problems (Corresp.)
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Some new NP-complete coding problems
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- Ternary Syndrome Decoding with large weight
- The Knowledge Complexity of Interactive Proof Systems
- Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices
This page was built for publication: Generic error SDP and generic error CVE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550584)