An efficient multi-use multi-secret sharing scheme based on hash function

Details An efficient multi-use multi-secret sharing scheme based on hash function An efficient multi-use multi-secret sharing scheme based on hash function

2011-03-09

arxiv.org/abs/1103.1730v1

Applied Mathematics Letters, 23 (2010) 993-996

Computer Science

Cryptography and Security

Scientific paper

10.1016/j.aml.2010.04.024

In this paper, a renewable, multi-use, multi-secret sharing scheme for general access structure based on one-way collision resistant hash function is presented in which each participant has to carry only one share. By applying 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.

Affiliated with

Also associated with

No associations

Rating

An efficient multi-use multi-secret sharing scheme based on hash function does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An efficient multi-use multi-secret sharing scheme based on hash function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An efficient multi-use multi-secret sharing scheme based on hash function will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-644011