Zero knowledge proofs of identity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
A new identification scheme based on syndrome decoding
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Threshold Ring Signatures and Applications to Ad-hoc Groups
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
How to Achieve a McEliece-Based Digital Signature Scheme
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
McEliece Cryptosystem Implementation: Theory and Practice
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Post Quantum Cryptography
Provably Secure Code-Based Threshold Ring Signatures
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
A lattice-based threshold ring signature scheme
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
A zero-knowledge identification scheme based on the q-ary syndrome decoding problem
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Smaller decoding exponents: ball-collision decoding
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Information-set decoding for linear codes over Fq
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
How to leak a secret: theory and applications of ring signatures
Theoretical Computer Science
Decoding random linear codes in Õ(20.054n)
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Decoding random binary linear codes in 2n/20: how 1 + 1 = 0 improves information set decoding
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
A new paradigm for public key identification
IEEE Transactions on Information Theory - Part 1
On the inherent intractability of certain coding problems (Corresp.)
IEEE Transactions on Information Theory
A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The concept of threshold ring signature in code-based cryptography was introduced by Aguilar et al. in [1]. Their proposal uses Stern's identification scheme as basis. In this paper we construct a novel threshold ring signature scheme built on the q-SD identification scheme recently proposed by Cayrel et al. in [14]. Our proposed scheme benefits of a performance gain as a result of the reduction in the soundness error from 2/3 for Stern's scheme to 1/2 per round for the q-SD scheme. Our threshold ring signature scheme uses random linear codes over the field $\mathbb{F}_q$ , secure in the random oracle model and its security relies on the hardness of an error-correcting codes problem (namely the q-ary syndrome decoding problem). In this paper we also provide implementation results of the Aguilar et al. scheme and our proposal, this is the first efficient implementation of this type of code-based schemes.