A proactive secret sharing scheme based on Chinese remainder theorem
Authors:
- 2 October 2020
- journal article
- research article
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 15 (2) , 1-10
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Efficient Asynchronous Verifiable Secret Sharing and Multiparty ComputationJournal of Cryptology, 2013
- Identity-based key distribution for mobile Ad Hoc networksFrontiers of Computer Science in China, 2011
- APSSACM Transactions on Information and System Security, 2005
- How to Share a Secret2000
- Proactive Secret Sharing Or: How to Cope With Perpetual Leakage1995
- Group-oriented (t, n) threshold digital signature scheme and digital multisignatureIEE Proceedings - Computers and Digital Techniques, 1994
- On the size of shares for secret sharing schemesJournal of Cryptology, 1993
- A modular approach to key safeguardingIEEE Transactions on Information Theory, 1983
- On sharing secrets and Reed-Solomon codesCommunications of the ACM, 1981
- How to share a secretCommunications of the ACM, 1979