STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Communications of the ACM
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
CODEX: A Robust and Secure Secret Distribution System
IEEE Transactions on Dependable and Secure Computing
Secure Group Communications Over Data Networks
Secure Group Communications Over Data Networks
A Strong Ramp Secret Sharing Scheme Using Matrix Projection
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Secret Sharing With Public Reconstruction
IEEE Transactions on Information Theory
MDS secret-sharing scheme secure against cheaters
IEEE Transactions on Information Theory
Wireless telemedicine and m-health: technologies, applications and research issues
International Journal of Sensor Networks
A survey of security visualization for computer network logs
Security and Communication Networks
Security and Communication Networks
| Hi-index | 0.00 |
Proactive Secret Sharing (PSS) scheme is a method to periodically renew n secret shares in a (k, n) threshold-based Secret Sharing Scheme (SSS) without modifying the secret, or reconstructing the secret to reproduce new shares. Traditionally, PSS schemes are developed for the Shamir's SSS which is a single SSS. Bai (2006) developed a multiple-secret sharing scheme using matrix projection. This paper presents a distributed PSS method for the matrix projection SSS. Once the new shares are updated, adversaries cannot discover the secrets from k shares which are mixed with past and present shares.