In this work, a renewable, multi-use, multi-secret sharing scheme for general access structure based on the one-way collision resistant hash function is presented in which each participant has to carry only one share. As it applies the collision resistant oneway hash function, the proposed scheme is
โฆ LIBER โฆ
An ideal multi-secret sharing scheme based on MSP
โ Scribed by Ching-Fang Hsu; Qi Cheng; Xueming Tang; Bing Zeng
- Book ID
- 108152980
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 207 KB
- Volume
- 181
- Category
- Article
- ISSN
- 0020-0255
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
An efficient multi-use multi-secret shar
โ
Angsuman Das; Avishek Adhikari
๐
Article
๐
2010
๐
Elsevier Science
๐
English
โ 244 KB
A New Verifiable Multi-secret Sharing Sc
โ
Ziba Eslami; Saideh Kabiri Rad
๐
Article
๐
2010
๐
Springer US
๐
English
โ 243 KB
On Matroid Characterization of Ideal Sec
โ
Jovan Dj. Golic
๐
Article
๐
1998
๐
Springer
๐
English
โ 129 KB
On the classification of ideal secret sh
โ
Ernest F. Brickell; Daniel M. Davenport
๐
Article
๐
1991
๐
Springer
๐
English
โ 693 KB
In a secret sharing scheme a dealer has a secret key. There is a finite set P of participants and a set F of subsets of P. A secret sharing scheme with F as the access structure is a method which the dealer can use to distribute shares to each participant so that a subset of participants can determi
New secret sharing scheme based on linea
โ
Xiaoqing Tan; Zhiguo Wang
๐
Article
๐
2004
๐
SP Editorial Committee of Applied Mathematics - A
๐
English
โ 364 KB
Secret sharing schemes based on combinat
โ
Youjin Song; Kaoru Kurosawa; Takashi Satoh; Shigeo Tsujii
๐
Article
๐
1995
๐
John Wiley and Sons
๐
English
โ 420 KB