Secret sharing in multilevel and compartmented groups
The paper proposes efficient solutions to two long standing open problems related to secret sharing schemes in multilevel (or hierarchical) and compartmented access structures. The secret sharing scheme in multilevel access structures uses a sequence of related Shamir threshold schemes with overlapping shares and the secret. The secret sharing scheme in compartmented access structures applies Shamir schemes first to recover partial secrets and second to combine them into the requested secret. Both schemes described in the paper are ideal and perfect.
Key wordsSecret Sharing Hierarchical and Compartmented Access Structures Ideal Schemes Perfect Security
Unable to display preview. Download preview PDF.
- 1.G. Blakley, “Safeguarding cryptographic keys,” in Proceedings of AFIPS 1979 National Computer Conference, vol. 48, pp. 313–317, 1979.Google Scholar
- 2.E. Brickell, “Some Ideal Secret Sharing Schemes,” in Advances in Cryptology — Proceedings of EUROCRYPT '89 (J.-J. Quisquater and J. Vandewalle, eds.), vol. 434 of Lecture Notes in Computer Science, pp. 468–475, Springer-Verlag, 1990.Google Scholar
- 3.M. Ito, A. Saito, and T. Nishizeki, “Secret Sharing Scheme Realizing General Access Structure,” in Proceedings IEEE Global Telecommun. Conf., Globecom '87, Washington, pp. 99–102, IEEE Communications Soc. Press, 1987.Google Scholar
- 4.S. Kothari, “Generalized Linear Threshold Scheme,” in Advances in Cryptology — Proceedings of CRYPTO '84 (G. Blakley and D. Chaum, eds.), vol. 196 of Lecture Notes in Computer Science, pp. 231–241, Springer-Verlag, 1985.Google Scholar
- 6.G. Simmons, “How to (Really) Share a Secret,” in Advances in Cryptology — Proceedings of CRYPTO '88 (S. Goldwasser, ed.), vol. 403 of Lecture Notes in Computer Science, pp. 390–448, Springer-Verlag, 1990.Google Scholar