Abstract
An efficient (v, r, n)-fairness secret sharing scheme is proposed in this paper. In the proposed scheme, all participants have an equal probability to recover the shared secret, even if there exist v cheaters, v
18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.
Like what you’re reading?
Already a member?
Related Articles
- On constructing secret sharing schemes
Proceedings of INFOCOM '94 Conference on Computer Communications - Threshold Secret Image Sharing by Chinese Remainder Theorem
2008 IEEE Asia-Pacific Services Computing Conference - A Verifiable and Recoverable Secret Image Sharing Mechanism
International Symposium on Parallel and Distributed Processing with Applications - An Efficient V-Fairness (t, n) Threshold Secret Sharing Scheme
Genetic and Evolutionary Computing, International Conference on - ({1,3},n) Hierarchical Secret Sharing Scheme Based on XOR Operations for a Small Number of Indispensable Participants
2016 11th Asia Joint Conference on Information Security (AsiaJCIS) - A New (t,n)-Threshold Secret Sharing Scheme
2008 International Conference on Advanced Computer Theory and Engineering (ICACTE) - Dynamic Key Generations for Secret Sharing in Access Structures
19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers) - (2, n) Secret Image Sharing Scheme with Ideal Contrast
2010 International Conference on Computational Intelligence and Security - Secret Image Sharing with Public Reconstruction over Distributed Cloud Network
2018 International Conference on Cloud Computing, Big Data and Blockchain (ICCBB) - A Novel Hierarchical Threshold Secret Image Sharing Scheme
2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)