๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Security of a Practical Identification Scheme

โœ Scribed by Victor Shoup

Book ID
105840038
Publisher
Springer
Year
1999
Tongue
English
Weight
84 KB
Volume
12
Category
Article
ISSN
0933-2790

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A realistic security analysis of identif
A realistic security analysis of identification schemes based on combinatorial problems
โœ Poupard, Guillaume ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 863 KB

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

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.

On the security of metering scheme
On the security of metering scheme
โœ Huang Lin; Zhenfu Cao ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 223 KB

## In 2001, Harn and Lin [4] proposed a non-repudiation metering scheme. In this paper, we reveal two security weaknesses in their scheme, which could make the scheme either too inefficient or incapable of presenting the exact visiting number of a server. An improved scheme will be presented in th

A secure on-line software transaction sc
A secure on-line software transaction scheme
โœ Shiang-Feng Tzeng; Min-Shiang Hwang; Hsing-Bai Chen ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 314 KB