Pages that link to "Item:Q1352426"

The following pages link to Improved identification schemes based on error-correcting codes (Q1352426):

Displaying 31 items.

• SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
• Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\) (Q832357) (← links)
• A class of I.P.P. codes with efficient identification (Q1827562) (← links)
• Cryptanalysis of a code-based full-time signature (Q1981793) (← links)
• A gapless code-based hash proof system based on RQC and its applications (Q2099170) (← links)
• Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge (Q2693627) (← links)
• Code-based signatures from new proofs of knowledge for the syndrome decoding problem (Q2698342) (← links)
• Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature (Q2698345) (← links)
• Codes for strong identification (Q2741420) (← 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)
• On robust and dynamic identifying codes (Q3547044) (← links)
• Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications (Q4916004) (← links)
• Improved Zero-Knowledge Identification with Lattices (Q4933208) (← links)
• LESS is More: Code-Based Signatures Without Syndromes (Q5048961) (← links)
• A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography (Q5739036) (← links)
• A New Dynamic Code-Based Group Signature Scheme (Q5739046) (← links)
• Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems (Q6057202) (← links)
• Code-Based Signature Schemes from Identification Protocols in the Rank Metric (Q6104627) (← links)
• Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext (Q6123051) (← links)
• Densities of codes of various linearity degrees in translation-invariant metric spaces (Q6130607) (← links)
• On the (in)security of optimized Stern-like signature schemes (Q6130619) (← links)
• Improved information set decoding algorithms over Galois ring in the Lee metric (Q6131036) (← links)
• MR-DSS -- smaller MinRank-based (ring-)signatures (Q6166980) (← links)
• Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric (Q6488038) (← links)
• A gapless post-quantum hash proof system in the Hamming metric (Q6535099) (← links)
• Building MPCitH-based signatures from MQ, MinRank, and rank SD (Q6547988) (← links)
• \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head (Q6635752) (← links)
• Short code-based one-out-of-many proofs and applications (Q6635777) (← links)
• Reduction from sparse LPN to LPN, dual attack 3.0 (Q6637725) (← links)