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
A New \mathcal{NP}-Complete Problem and Public-Key Identification
Designs, Codes and Cryptography
A method for finding codewords of small weight
Proceedings of the 3rd International Colloquium on Coding Theory and Applications
An Efficient Identification Scheme Based on Permuted Kernels (Extended Abstract)
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Designing Identification Schemes with Keys of Short Size
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
The Cryptographic Security of the Syndrome Decoding Problem for Rank Distance Codes
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Cryptanalysis of PKP: A New Approach
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Secure Implementation of the Stern Authentication and Signature Schemes for Low-Resource Devices
CARDIS '08 Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Post Quantum Cryptography
Reducing Key Length of the McEliece Cryptosystem
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Compact McEliece Keys from Goppa Codes
Selected Areas in Cryptography
A new identification scheme based on the perceptrons problem
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Algebraic cryptanalysis of mceliece variants with compact keys
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Public-key identification schemes based on multivariate quadratic polynomials
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Full cryptanalysis of the chen identification protocol
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
Feasibility of position-based multivariate cryptosystems for WSN
International Journal of Internet Technology and Secured Transactions
Public-Key identification schemes based on multivariate cubic polynomials
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
An improved threshold ring signature scheme based on error correcting codes
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
Extended security arguments for signature schemes
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Zero-knowledge protocols for the mceliece encryption
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Commitments and efficient zero-knowledge proofs from learning parity with noise
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Anonymous Shared Certificate Entity Authentication Protocol
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
At CRYPTO'93, Stern proposed a 3-pass code-based identification scheme with a cheating probability of 2/3. In this paper, we propose a 5-pass code-based protocol with a lower communication complexity, allowing an impersonator to succeed with only a probability of 1/2. Furthermore, we propose to use double-circulant construction in order to dramatically reduce the size of the public key. The proposed scheme is zero-knowledge and relies on an NP-complete coding theory problem (namely the q-ary Syndrome Decoding problem). The parameters we suggest for the instantiation of this scheme take into account a recent study of (a generalization of) Stern's information set decoding algorithm, applicable to linear codes over arbitrary fields Fq; the public data of our construction is then 4 Kbytes, whereas that of Stern's scheme is 15 Kbytes for the same level of security. This provides a very practical identification scheme which is especially attractive for light-weight cryptography.