A New \mathcal{NP}-Complete Problem and Public-Key Identification
Designs, Codes and Cryptography
Security Parallels between People and Pervasive Devices
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
IEEE Transactions on Computers
A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Digital Signature Scheme Based on NP-Complete Lattice Problems
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Zero-Knowledge Protocols for NTRU: Application to Identification and Proof of Plaintext Knowledge
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Provably Secure Code-Based Threshold Ring Signatures
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Lattice-based identification schemes secure under active attacks
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Public-key identification schemes based on multivariate quadratic polynomials
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Authenticating pervasive devices with human protocols
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
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
Proof of plaintext knowledge for code-based public-key encryption revisited
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Identity based identification from algebraic coding theory
Theoretical Computer Science
| Hi-index | 0.00 |
The present paper investigates the possibility of designing zero-knowledge identification schemes based on hard problems from coding theory. Zero-knowledge proofs were introduced by Goldwasser, Micali, and Rackoff (1985). Their practical significance was soon demonstrated in the work of Fiat and Shamir [1986], who turned zero-knowledge proofs of quadratic residuosity into efficient means of establishing user identities. In the present paper, we propose a new identification scheme, based on error-correcting codes, which is zero-knowledge and seems of practical value. Furthermore, we describe several variants, including one which has an identity-based character. The security of our schemes depends on the hardness of finding a word of given syndrome and prescribed (small) weight with respect to some randomly generated binary linear error-correcting code. This is, of course, not the first attempt to design a cryptographic scheme using tools from coding theory. The difference is that identification protocols do not follow the public key paradigm based on trap-door functions and described in the seminal Diffie-Hellman paper [1976]. Rather, they only require one-way functions, which opens the way to using, in a rather direct manner, simple combinatorial problems of the kind provided by coding theory. The resulting schemes compare favorably to their number-theoretic analogs