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

Some remarks on the security of the identification scheme based on permuted kernels

โœ Scribed by Jean Georgiades

Publisher
Springer
Year
1992
Tongue
English
Weight
219 KB
Volume
5
Category
Article
ISSN
0933-2790

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ 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

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

On the security of an identity based mul
On the security of an identity based multi-proxy signature scheme
โœ Hu Xiong; Jianbin Hu; Zhong Chen; Fagen Li ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 208 KB

In a multi-proxy signature scheme, an original signer could authorize a proxy group as his proxy agent. Then only the cooperation of all the signers in the proxy group can generate the proxy signatures on behalf of the original signer. Recently, Cao and Cao gave the first formal definition and secur

A digital secure image communication sch
A digital secure image communication scheme based on the chaotic Chebyshev map
โœ Xiaofeng Liao; Xueming Li; Jun Pen; Guanrong Chen ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 196 KB

## Abstract In this paper, a simple image secure communication scheme based on the chaotic Chebyshev map and chaos synchronization is proposed. The scheme relies on the excellent correlation property of chaotic sequences, which is very desirable for secure image communication. The results obtained