A new identification scheme based on syndrome decoding
From MaRDI portal
Publication:4341729
DOI10.1007/3-540-48329-2_2zbMath0876.94035MaRDI QIDQ4341729
Publication date: 1 December 1997
Published in: Advances in Cryptology — CRYPTO’ 93 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-48329-2_2
Related Items
How traveling salespersons prove their identity, A new algorithm for finding minimum-weight words in large linear codes, Code-Based Public-Key Cryptosystems and Their Applications, Improved Zero-Knowledge Identification with Lattices, Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions, LESS is More: Code-Based Signatures Without Syndromes, A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties, A Secure and Efficient Code-Based Signature Scheme, A new identification algorithm, A Practical Group Signature Scheme Based on Rank Metric, One-Shot Verifiable Encryption from Lattices, A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography, Extended security arguments for signature schemes, \(k\)-critical graphs in \(P_5\)-free graphs, The security of the code-based signature scheme based on the Stern identification protocol, Generalization of the Ball-Collision Algorithm, Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems, Attack on a code-based signature scheme from QC-LDPC codes, Revisiting algebraic attacks on MinRank and on the rank decoding problem, A new key recovery attack on a code-based signature from the Lyubashevsky framework, A lightweight identification protocol based on lattices, Disjunctive delimited control, Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general, On codes and learning with errors over function fields, Syndrome decoding in the head: shorter signatures from zero-knowledge proofs, Code-Based Signature Schemes from Identification Protocols in the Rank Metric, Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs, An algorithm for generalized syndrome decoding problem, Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection, Non-interactive secure computation of inner-product from LPN and LWE, Lattice-based inner product argument, MR-DSS -- smaller MinRank-based (ring-)signatures, Ternary forking lemma and its application to the analysis of one code-based signature, A code-based hybrid signcryption scheme, Statistical decoding 2.0: reducing decoding to LPN, Identity based identification from algebraic coding theory, A code-based group signature scheme, SoK: how (not) to design and implement post-quantum cryptography, Lattice-based zero-knowledge arguments for additive and multiplicative relations, Efficient lattice-based polynomial evaluation and batch ZK arguments, Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\), Conceptual, computational and inferential benefits of the missing data perspective in applied and theoretical statistical problems, Improved identification schemes based on error-correcting codes, Cryptanalysis of a code-based full-time signature, Sigma protocols for MQ, PKP and SIS, and fishy signature schemes, Shorter lattice-based zero-knowledge proofs via one-time commitments, Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices, A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs, More efficient amortization of exact zero-knowledge proofs for LWE, A correction to a code-based blind signature scheme, A code-based signature scheme from the Lyubashevsky framework, Speeding-up verification of digital signatures, Naor-Yung paradigm with shared randomness and applications, A fuzzy vault scheme, Practical exact proofs from lattices: new techniques to exploit fully-splitting rings, 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, Post-Quantum Cryptography: State of the Art, Cryptography from Learning Parity with Noise, From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures, A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem, Full Cryptanalysis of the Chen Identification Protocol, Decoding One Out of Many, A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory, A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
