The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth 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
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
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
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
A new identification scheme based on syndrome decoding
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
A Modification of the Fiat-Shamir Scheme
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
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
A new public key cryptosystem based on higher residues
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
A New \mathcal{NP}-Complete Problem and Public-Key Identification
Designs, Codes and Cryptography
Fault Injection and a Timing Channel on an Analysis Technique
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Evolutionary computation in computer security and cryptography
New Generation Computing - Evolutionary computation
Efficient zero-knowledge identification schemes which respect privacy
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Security proofs for signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'97 Proceedings of the 16th 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 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
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography 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
Zero-knowledge proof of generalized compact knapsacks (or a novel identification/signature scheme)
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
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
Zero-Knowledge for multivariate polynomials
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
ParadisEO-MO-GPU: a framework for parallel GPU-based local search metaheuristics
Proceedings of the 15th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
Identification is a useful cryptographic tool. Since zero-knowledge theory appeared [3], several interactive identification schemes have been proposed (in particular Fiat-Shamir [2] and its variants [8, 5, 4], Schnorr [9]). These identifications are based on number theoretical problems. More recently, new schemes appeared with the peculiarity that they are more efficient from the computational point of view and that their security is based on NP-complete problems: PKP (Permuted Kernels Problem) [10], SD (Syndrome Decoding) [12] and CLE (Constrained Linear Equations) [13]. We present a new NP-complete linear problem which comes from learning machines: the Perceptrons Problem. We have some constraints, m vectors Xi of (-1, +1}n, and we want to find a vector V of (-1, +1}n such that Xi ċ V ≥ 0 for all i. Next, we provide some zero-knowledge interactive identification protocols based on this problem, with an evaluation of their security. Eventually, those protocols are well suited for smart card applications.