✦ LIBER ✦

On the security of a modified Beth identity-based identification scheme

✍ Scribed by Chin, Ji-Jian; Tan, Syh-Yuan; Heng, Swee-Huay; Phan, Raphael C.-W.

Book ID: 123348081
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 169 KB
Volume: 113
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2013.04.015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the security of an identity-based pro

On the security of an identity-based proxy multi-signature scheme

✍ Wang, B. 📂 Article 📅 2010 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 127 KB

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

On the Security of a Practical Identific

On the Security of a Practical Identification Scheme

✍ Victor Shoup 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 84 KB

Reflections on the security proofs of Bo

Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme

✍ Chen, Yu; Chen, LiQun; Lin, DongDai 📂 Article 📅 2013 🏛 SP Science China Press 🌐 English ⚖ 338 KB

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.