The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design
Proceedings on Advances in cryptology---CRYPTO '86
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
A smart card implementation of the Fiat-Shamir identification scheme
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
An interactive identification scheme based on discrete logarithms and factoring (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Fast signature generation with a Fiat Shamir—like scheme
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
An identity-based identification scheme based on discrete logarithms modulo a composite number
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Efficient identification and signatures for smart cards
CRYPTO '89 Proceedings on Advances in cryptology
An efficient identification scheme based on permuted kernels (extended abstract)
CRYPTO '89 Proceedings on Advances in cryptology
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
An interactive identification scheme based on discrete logarithms and factoring
Journal of Cryptology - Eurocrypt '90
Some remarks on the security of the identification scheme based on permuted kernels
Journal of Cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
On the fly signatures based on factoring
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms and Simulated Annealing
Genetic Algorithms and Simulated Annealing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Modification of the Fiat-Shamir Scheme
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
On the Security of the Permuted Kernel Identification Scheme
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Improved Algorithms for the Permuted Kernel Problem
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
A New Identification Scheme Based on Syndrome Decoding
CRYPTO '93 Proceedings of the 13th 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
On the Length of Cryptographic Hash-Values Used in Identification Schemes
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
The Composite Discrete Logarithm and Secure Authentication
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Short Proofs of Knowledge for Factoring
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
On the security of a practical identification scheme
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
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
Cryptanalysis of an identification scheme based on the permuted perceptron problem
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
A new paradigm for public key identification
IEEE Transactions on Information Theory - Part 1
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
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
Public-key identification schemes based on multivariate quadratic polynomials
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Cryptography from learning parity with noise
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
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
Extended security arguments for signature schemes
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
| Hi-index | 0.01 |
The appearance of the theory of zero-knowledge, presented by Goldwasser, Micali and Rackoff in 1985, opened a way to secure identification schemes. The first application was the famous Fiat-Shamir scheme based on the problem of modular square roots extraction. In the following years, many other schemes have been proposed, some Fiat-Shamir extensions but also new discrete logarithm based schemes. Therefore, all of them were based on problems from number theory. Their main common drawback is high computational load because of arithmetical operations modulo large integers. Implementation on low-cost smart cards was made difficult and inefficient.With the Permuted Kernels Problem (PKP), Shamir proposed the first efficient scheme allowing for an implementation on such low-cost smart cards, but very few others have afterwards been suggested.In this paper, we present an efficient identification scheme based on a combinatorial \mathcal{NP}-complete problem: the Permuted Perceptrons Problem (PPP). This problem seems hard enough to be unsolvable even with very small parameters, and some recent cryptanalysis studies confirm that position. Furthermore, it admits efficient zero-knowledge proofs of knowledge and so it is well-suited for cryptographic purposes. An actual implementation completes the optimistic opinion about efficiency and practicability on low-cost smart cards, and namely with less than 2KB of EEPROM and just 100 Bytes of RAM and 6.4 KB of communication.