Information-theoretic secure rational secret sharing in asynchronous networks for untrusted cloud environments
Open Access
- 8 December 2022
- journal article
- research article
- Published by Springer Science and Business Media LLC in Journal of Cloud Computing
- Vol. 11 (1), 1-8
- https://doi.org/10.1186/s13677-022-00364-9
Abstract
No abstract availableKeywords
Funding Information
- National Nature Science Foundation of China (62172181, 62072133)
This publication has 27 references indexed in Scilit:
- AN EFFICIENT AND INFORMATION THEORETICALLY SECURE RATIONAL SECRET SHARING SCHEME BASED ON SYMMETRIC BIVARIATE POLYNOMIALSInternational Journal of Foundations of Computer Science, 2011
- Rational Secret Sharing with Repeated GamesPublished by Springer Science and Business Media LLC ,2008
- Non-Interactive and Information-Theoretic Secure Verifiable Secret SharingPublished by Springer Science and Business Media LLC ,2007
- Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret (Extended Abstract)Published by Springer Science and Business Media LLC ,2000
- A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic VotingLecture Notes in Computer Science, 1999
- Public-Key Cryptosystems Based on Composite Degree Residuosity ClassesPublished by Springer Science and Business Media LLC ,1999
- Publicly Verifiable Secret SharingLecture Notes in Computer Science, 1996
- Fair reconstruction of a secretInformation Processing Letters, 1995
- A modular approach to key safeguardingIEEE Transactions on Information Theory, 1983
- How to share a secretCommunications of the ACM, 1979