Paper Unlock

Authors: Rodolphe Lampe and Jacques Patarin

Affiliation: University of Versailles Saint-Quentin, France

ISBN: 978-989-8565-24-2

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 channe l 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)

PDF ImageFull Text


Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Lampe, R. and Patarin, J. (2012). Analysis of Some Natural Variants of the PKP Algorithm.In Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2012) ISBN 978-989-8565-24-2, pages 209-214. DOI: 10.5220/0004012202090214

author={Rodolphe Lampe. and Jacques Patarin.},
title={Analysis of Some Natural Variants of the PKP Algorithm},
booktitle={Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2012)},


JO - Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2012)
TI - Analysis of Some Natural Variants of the PKP Algorithm
SN - 978-989-8565-24-2
AU - Lampe, R.
AU - Patarin, J.
PY - 2012
SP - 209
EP - 214
DO - 10.5220/0004012202090214

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.