Introduces asymptotically ideal and provably secure disjunctive and conjunctive hierarchical secret sharing schemes based on CRT for integer rings.
Shamir, How to share a secret, Communications of the ACM, vol.22, no.11, pp.612- 613, 1979
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Asymptotically Ideal Hierarchical Secret Sharing Based on CRT for Integer Ring
Introduces asymptotically ideal and provably secure disjunctive and conjunctive hierarchical secret sharing schemes based on CRT for integer rings.