𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A realistic security analysis of identification schemes based on combinatorial problems

✍ Scribed by Poupard, Guillaume

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
863 KB
Volume
8
Category
Article
ISSN
1124-318X

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we analyze the security of two zero-knowledge identification schemes based on cornbinatorial NP-cornplete problems, PKP (Shamir [3]) and CLE (Stem [5]). We use two different approaches in order to determine, on the one hand, the theoretical limit to the efficiency of the known attacks and, on the other hand, the practical results they permit. Accordingly, we obtain a precise evaluation of which parameters should be chosen today for a secure use of these protocols.

πŸ“œ SIMILAR VOLUMES

Some remarks on the security of the iden
Some remarks on the security of the identification scheme based on permuted kernels
✍ Jean Georgiades πŸ“‚ Article πŸ“… 1992 πŸ› Springer 🌐 English βš– 219 KB

We present in this paper an idea ofhow to reduce the number of possible permutations when trying to solve the permuted kernels problem. We refer to the identification scheme of Shamir [2] and we also show how a dishonest prover can maximize his prospects to pass the test.

A wavelet–Galerkin scheme for analysis o
A wavelet–Galerkin scheme for analysis of large-scale problems on simple domains
✍ Alejandro R. DΓ­az πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 315 KB πŸ‘ 2 views

A wavelet-Galerkin scheme tailored to address the numerical solution of large-scale boundary value problems defined on domains of simple geometry is presented. The variation of parameters, e.g. material properties, within the domain is arbitrary but the method is specifically designed to solve probl