Pages that link to "Item:Q4341729"
From MaRDI portal
The following pages link to A new identification scheme based on syndrome decoding (Q4341729):
Displayed 50 items.
- Identity based identification from algebraic coding theory (Q391761) (← links)
- A code-based group signature scheme (Q510499) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- Lattice-based zero-knowledge arguments for additive and multiplicative relations (Q831178) (← links)
- Efficient lattice-based polynomial evaluation and batch ZK arguments (Q832321) (← links)
- Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\) (Q832357) (← links)
- Conceptual, computational and inferential benefits of the missing data perspective in applied and theoretical statistical problems (Q878277) (← links)
- Improved identification schemes based on error-correcting codes (Q1352426) (← links)
- Cryptanalysis of a code-based full-time signature (Q1981793) (← links)
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes (Q2055652) (← links)
- Shorter lattice-based zero-knowledge proofs via one-time commitments (Q2061919) (← links)
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices (Q2128574) (← links)
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs (Q2128576) (← links)
- More efficient amortization of exact zero-knowledge proofs for LWE (Q2148770) (← links)
- A correction to a code-based blind signature scheme (Q2163765) (← links)
- A code-based signature scheme from the Lyubashevsky framework (Q2192378) (← links)
- Speeding-up verification of digital signatures (Q2220442) (← links)
- Naor-Yung paradigm with shared randomness and applications (Q2401764) (← links)
- A fuzzy vault scheme (Q2491270) (← links)
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings (Q2692384) (← links)
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge (Q2693627) (← links)
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature (Q2698345) (← links)
- Post-Quantum Cryptography: State of the Art (Q2803619) (← links)
- Cryptography from Learning Parity with Noise (Q2891361) (← links)
- From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures (Q2953775) (← links)
- A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem (Q3084253) (← links)
- Full Cryptanalysis of the Chen Identification Protocol (Q3102782) (← links)
- Decoding One Out of Many (Q3102783) (← links)
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory (Q3193273) (← links)
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory (Q3535347) (← links)
- How traveling salespersons prove their identity (Q4608506) (← links)
- A new algorithm for finding minimum-weight words in large linear codes (Q4608514) (← links)
- Code-Based Public-Key Cryptosystems and Their Applications (Q4931667) (← links)
- Improved Zero-Knowledge Identification with Lattices (Q4933208) (← links)
- Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions (Q5041222) (← links)
- LESS is More: Code-Based Signatures Without Syndromes (Q5048961) (← links)
- A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties (Q5056025) (← links)
- A Secure and Efficient Code-Based Signature Scheme (Q5205021) (← links)
- A new identification algorithm (Q5235427) (← links)
- A Practical Group Signature Scheme Based on Rank Metric (Q5267806) (← links)
- One-Shot Verifiable Encryption from Lattices (Q5738881) (← links)
- A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography (Q5739036) (← links)
- Generalization of the Ball-Collision Algorithm (Q5855596) (← links)
- The security of the code-based signature scheme based on the Stern identification protocol (Q5871430) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5918256) (← links)
- Extended security arguments for signature schemes (Q5963366) (← links)
- Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems (Q6057202) (← links)
- Attack on a code-based signature scheme from QC-LDPC codes (Q6057214) (← links)
- Revisiting algebraic attacks on MinRank and on the rank decoding problem (Q6063136) (← links)
- A new key recovery attack on a code-based signature from the Lyubashevsky framework (Q6072205) (← links)