Proceedings of CRYPTO 84 on Advances in cryptology
Geometric secret sharing schemes and their duals
Designs, Codes and Cryptography
Communications of the ACM
Non-perfect Secret Sharing over General Access Structures
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
On Ideal Non-perfect Secret Sharing Schemes
Proceedings of the 5th International Workshop on Security Protocols
Secret Sharing With Public Reconstruction
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A Proactive Secret Sharing Scheme in matrix projection method
International Journal of Security and Networks
Further improvements on secret image sharing scheme
Proceedings of the 2nd ACM workshop on Multimedia in forensics, security and intelligence
An efficient group-based secret sharing scheme
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
(r, n)-threshold image secret sharing methods with small shadow images
IWDW'11 Proceedings of the 10th international conference on Digital-Forensics and Watermarking
Optimum general threshold secret sharing
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
| Hi-index | 0.00 |
This paper presents a strong (k, n) threshold-based ramp secret sharing scheme with k access levels. The secrets are the elements represented in a square matrix S. The secret matrix S can be shared among n different participants using a matrix projection technique where: i) any subset of k participants can collaborate together to reconstruct the secret, and ii) any subset of (k - 1) or fewer participants cannot partially discover the secret matrix. The primary advantages are its large compression rate on the size of the shares and its strong protection of the secrets.