Dynamic threshold scheme based on the definition of cross-product in an N-dimensional linear space
CRYPTO '89 Proceedings on Advances in cryptology
General constructions for information-theoretic private information retrieval
Journal of Computer and System Sciences
Secret image sharing with smaller shadow images
Pattern Recognition Letters
Two-tier authentication for cluster and individual sets in mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
Electronic Notes in Theoretical Computer Science (ENTCS)
Hypergraph decomposition and secret sharing
Discrete Applied Mathematics
Strongly secure ramp secret sharing schemes for general access structures
Information Processing Letters
A lower bound on the encoding length in lossy transmission
Information Sciences: an International Journal
An ideal multi-secret sharing scheme based on MSP
Information Sciences: an International Journal
A novel linear multi-secret sharing scheme for group communication in wireless mesh networks
Journal of Network and Computer Applications
Research note: General secret sharing scheme
Computer Communications
Linear multi-secret sharing schemes based on multi-party computation
Finite Fields and Their Applications
Linear threshold multisecret sharing schemes
Information Processing Letters
A DCT multi-channel image information sharing scheme in resisting JPEG lossy compression attack
IScIDE'11 Proceedings of the Second Sino-foreign-interchange conference on Intelligent Science and Intelligent Data Engineering
Optimum general threshold secret sharing
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Secret Sharing Schemes with Nice Access Structures
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Journal of Computer and System Sciences
On partial anonymity in secret sharing
EuroPKI'07 Proceedings of the 4th European conference on Public Key Infrastructure: theory and practice
Verifiable quantum (k, n)-threshold secret sharing
Quantum Information Processing
Finding lower bounds on the complexity of secret sharing schemes by linear programming
Discrete Applied Mathematics
End-to-end policy based encryption techniques for multi-party data management
Computer Standards & Interfaces
| Hi-index | 754.84 |
A "secret sharing system" permits a secret to be shared amongntrustees in such a way that anykof them can recover the secret, but anyk-1have complete uncertainty about it. A linear coding scheme for secret sharing is exhibited which subsumes the polynomial interpolation method proposed by Shamir and can also be viewed as a deterministic version of Blakley's probabilistic method. Bounds on the maximum value ofnfor a givenkand secret size are derived for any system, linear or nonlinear. The proposed scheme achieves the lower bound which, for practical purposes, differs insignificantly from the upper bound. The scheme may be extended to protect several secrets. Methods to protect against deliberate tampering by any of the trustees are also presented.