Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Ramp secret sharing with cheater identification in presence of rushing cheaters

Ramp secret sharing with cheater identification in presence of rushing cheaters AbstractSecret sharing allows one to share a piece of information among n participants in a way that only qualified subsets of participants can recover the secret whereas others cannot.Some of these participants involved may, however, want to forge their shares of the secret(s) in order to cheat other participants.Various cheater identifiable techniques have been devised in order to identify such cheaters in secret sharing schemes.On the other hand, Ramp secret sharing schemes are a practically efficient variant of usual secret sharing schemes with reduced share size and some loss in security.Ramp secret sharing schemes have many applications in secure information storage, information-theoretic private information retrieval and secret image sharing due to producing relatively smaller shares.However, to the best of our knowledge, there does not exist any cheater identifiable ramp secret sharing scheme.In this paper we define the security model for cheater identifiable ramp secret sharing schemes and provide two constructions for cheater identifiable ramp secret sharing schemes.In addition, the second construction is secure against rushing cheaters who are allowed to submit their shares during secret reconstruction after observing other participants’ responses in one round.Also, we do not make any computational assumptions for the cheaters, i.e., cheaters may be equipped with unlimited time and resources, yet, the cheating probability would be bounded above by a very small positive number. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

Ramp secret sharing with cheater identification in presence of rushing cheaters

Loading next page...
 
/lp/de-gruyter/ramp-secret-sharing-with-cheater-identification-in-presence-of-rushing-p7pt1rA0fP
Publisher
de Gruyter
Copyright
© 2019 Walter de Gruyter GmbH, Berlin/Boston
ISSN
1869-6104
eISSN
1869-6104
DOI
10.1515/gcc-2019-2006
Publisher site
See Article on Publisher Site

Abstract

AbstractSecret sharing allows one to share a piece of information among n participants in a way that only qualified subsets of participants can recover the secret whereas others cannot.Some of these participants involved may, however, want to forge their shares of the secret(s) in order to cheat other participants.Various cheater identifiable techniques have been devised in order to identify such cheaters in secret sharing schemes.On the other hand, Ramp secret sharing schemes are a practically efficient variant of usual secret sharing schemes with reduced share size and some loss in security.Ramp secret sharing schemes have many applications in secure information storage, information-theoretic private information retrieval and secret image sharing due to producing relatively smaller shares.However, to the best of our knowledge, there does not exist any cheater identifiable ramp secret sharing scheme.In this paper we define the security model for cheater identifiable ramp secret sharing schemes and provide two constructions for cheater identifiable ramp secret sharing schemes.In addition, the second construction is secure against rushing cheaters who are allowed to submit their shares during secret reconstruction after observing other participants’ responses in one round.Also, we do not make any computational assumptions for the cheaters, i.e., cheaters may be equipped with unlimited time and resources, yet, the cheating probability would be bounded above by a very small positive number.

Journal

Groups Complexity Cryptologyde Gruyter

Published: Nov 1, 2019

There are no references for this article.