Generic error SDP and generic error CVE
From MaRDI portal
Publication:6550584
DOI10.1007/978-3-031-46495-9_7zbMATH Open1540.94072MaRDI QIDQ6550584
Freeman Slaughter, Felice Manganiello
Publication date: 5 June 2024
Cites Work
- Unnamed Item
- An algebraic approach for decoding spread codes
- Ternary Syndrome Decoding with large weight
- Some new NP-complete coding problems
- 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
- An inverse theorem for the restricted set addition in Abelian groups.
- A compactness argument in the additive theory and the polynomial method.
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- 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
- Introduction to post-quantum cryptography
- The Knowledge Complexity of Interactive Proof Systems
- On the inherent intractability of certain coding problems (Corresp.)
- Foundations of Cryptography
- Averaging bounds for lattices and linear codes
- Adversarial Network Coding
- Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices
- Introduction to Coding Theory
- On the hardness of the Lee syndrome decoding problem
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
This page was built for publication: Generic error SDP and generic error CVE