Title of article
An efficient multi-use multi-secret sharing scheme based on hash function
Author/Authors
Das، نويسنده , , Angsuman and Adhikari، نويسنده , , Avishek، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
4
From page
993
To page
996
Abstract
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 one-way hash function, the proposed scheme is secure against conspiracy attacks even if the pseudo-secret shares are compromised. Moreover, high complexity operations like modular multiplication, exponentiation and inversion are avoided to increase its efficiency. Finally, in the proposed scheme, both the combiner and the participants can verify the correctness of the information exchanged among themselves.
Keywords
Multi-use , Verifiable , renewable , Pseudo-secret share
Journal title
Applied Mathematics Letters
Serial Year
2010
Journal title
Applied Mathematics Letters
Record number
1527127
Link To Document