A New Efficient Threshold Ring Signature Scheme Based on Coding Theory

DOI10.1007/978-3-540-88403-3_1MaRDI QIDQ3535347zbMATH OpenOpenAlexFDO

Authors Carlos Aguilar-Melchor, Pierre-Louis Cayrel, Philippe Gaborit

Publication date 11 November 2008

Published in Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-88403-3_1

zbMATH Keywords

code-based cryptographythreshold ring signaturesyndrome decodingStern's scheme

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Provably Secure Code-Based Threshold Ring Signatures
• An improved threshold ring signature scheme based on error correcting codes
• Information Security and Privacy
• A lattice-based threshold ring signature scheme
• A code-based linkable ring signature scheme

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1942438 (Why is no real title available?)
• scientific article; zbMATH DE number 1942439 (Why is no real title available?)
• scientific article; zbMATH DE number 2081064 (Why is no real title available?)
• scientific article; zbMATH DE number 2081086 (Why is no real title available?)
• 1-out-of-n Signatures from a Variety of Keys
• A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
• A new identification scheme based on syndrome decoding
• A new paradigm for public key identification
• Advances in Cryptology - EUROCRYPT 2004
• Efficient Ring Signatures Without Random Oracles
• Group Signatures
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• How to share a secret
• ID-Based Blind Signature and Ring Signature from Pairings
• Information Security and Cryptology - ICISC 2003
• Limit distribution of the minimum distance of random linear codes
• Mesh Signatures
• On the inherent intractability of certain coding problems (Corresp.)
• Progress in Cryptology - INDOCRYPT 2003
• Progress in Cryptology - INDOCRYPT 2004
• Ring Signatures of Sub-linear Size Without Random Oracles
• Security proofs for signature schemes
• The intractability of computing the minimum distance of a code
• Theory of Cryptography

Cited in

(14)

• A lattice-based threshold ring signature scheme
• Zero-knowledge proofs for committed symmetric Boolean functions
• Extendable threshold ring signatures with enhanced anonymity
• A zero-knowledge identification scheme based on the \(q\)-ary syndrome decoding problem
• Group encryption: full dynamicity, message filtering and code-based instantiation
• Certificate-free \textit{ad hoc} anonymous authentication
• A traceable ring signature scheme based on coding theory
• Group encryption: full dynamicity, message filtering and code-based instantiation
• An improved threshold ring signature scheme based on error correcting codes
• Information Security and Privacy
• Non-interactive composition of sigma-protocols via Share-then-Hash
• Cryptanalysis of multivariate threshold ring signature schemes
• Improved lattice-based threshold ring signature scheme
• Provably Secure Code-Based Threshold Ring Signatures

Describes a project that uses

Uses Software

• MicroEliece

This page was built for publication: A New Efficient Threshold Ring Signature Scheme Based on Coding Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3535347)