Authors:
Rodolphe Lampe
and
Jacques Patarin
Affiliation:
University of Versailles Saint-Quentin, France
Keyword(s):
Public-key Cryptography, Identification Scheme, Zero Knowledge, Permuted Kernel Problem.
Related
Ontology
Subjects/Areas/Topics:
Applied Cryptography
;
Authentication
;
Cryptographic Techniques and Key Management
;
Data Engineering
;
Databases and Data Security
;
Identification, Authentication and Non-Repudiation
;
Information and Systems Security
;
Obstacles
;
Security in Information Systems
;
Security Information Systems Architecture and Design and Security Patterns
;
Sensor Networks
Abstract:
In 1989, (Shamir, 1989) proposed a new zero-knowledge identification scheme based on a NP-complete problem
called PKP for Permuted Kernel Problem. For a given prime p, a given matrix A and a given vector V, the
problem is to find a permutation p such that the permuted vector Vp verifies A·Vp = 0 mod p. This scheme
is still in 2011 known as one of the most efficient identification scheme based on a combinatorial problem.
However, we will see in this paper that it is possible to improve this scheme significantly by combining new
ideas in order to reduce the total number of computations to be performed and to improve very efficiently the
security against side channel attacks using precomputations. We will obtain like this a new scheme that we
have called SPKP. Moreover, if we use precomputed values in the scheme SPKP, then the prover will need to
perform no computations (i.e. only selection and transmission of precomputed values). This is very interesting
for security against side chann
el attacks because our scheme is zero-knowledge and we don’t perform any
computations using the key during the identification so we prove that any attacker (even using side channel
attacks) being successfully identified implies that he has a solution to the NP-complete problem PKP.
(More)