✦ LIBER ✦

Analysis of a kind of quantum cryptographic schemes based on secret sharing

✍ Scribed by XingLan Zhang; DongYao Ji

Publisher: Science in China Press (SCP)
Year: 2009
Tongue: English
Weight: 493 KB
Volume: 52
Category: Article
ISSN: 1672-1799
DOI: 10.1007/s11433-009-0154-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the size of shares for secret sharing

On the size of shares for secret sharing schemes

✍ R. M. Capocelli; A. De Santis; L. Gargano; U. Vaccaro 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 574 KB

AbstracL A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret, but any nonqualified subset has absolutely no information on the secret. The set of all qualified subsets defines the access structure t

Secret key sharing scheme based on the t

Secret key sharing scheme based on the theory of algebraic semigroups

✍ Yongchuan Wang; Zichen Li; Yixian Yang 📂 Article 📅 2000 🏛 SP Science Press 🌐 English ⚖ 286 KB

New secret sharing scheme based on linea

New secret sharing scheme based on linear code

✍ Xiaoqing Tan; Zhiguo Wang 📂 Article 📅 2004 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 364 KB

Improving the security of multiparty qua

Improving the security of multiparty quantum secret sharing based on the improved Boström–Felbinger protocol

✍ Song Lin; Qiao-Yan Wen; Fei Gao; Fu-Chen Zhu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 133 KB

A special attack on the multiparty quant

A special attack on the multiparty quantum secret sharing of secure direct communication using single photons

✍ Su-Juan Qin; Fei Gao; Qiao-Yan Wen; Fu-Chen Zhu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 148 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