Advanced signature functionalities from the code equivalence problem
- 24 March 2022
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics: Computer Systems Theory
- Vol. 7 (2) , 112-128
Abstract
The LESS signature scheme, introduced in 2020, represented a fresh start for code-based signatures. In this paper we explore advanced functionalities for signature schemes, stemming from the work of LESS. First, we adapt a recent protocol of Beullens et al. to obtain a construction for (linkable) ring signatures. Then, we realize an identity-based signature scheme following the traditional approach by Joye and Neven. Our performance numbers confirm that signature schemes based on the code equivalence problem have considerable potential for practical applications.Keywords
Funding Information
- NIST (60NANB17D184)
- NSF (183980,1906360)
This publication has 23 references indexed in Scilit:
- A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem2011
- Security Bounds for the Design of Code-Based Cryptosystems2009
- Security Proofs for Identity-Based Identification and Signature SchemesJournal of Cryptology, 2008
- Variations of Diffie-Hellman Problem2003
- How to Achieve a McEliece-Based Digital Signature Scheme2001
- Finding the permutation between equivalent linear codes: the support splitting algorithmIEEE Transactions on Information Theory, 2000
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- A new identification scheme based on syndrome decoding1994
- A Digital Signature Based on a Conventional Encryption Function1988
- Computing automorphism groups of error-correcting codesIEEE Transactions on Information Theory, 1982