Articles «Previous Next»

Perfect Secret Sharing Schemes from Room Squares

G. R. Chaudhry, University of Wollongong
H Ghodosi, University of Wollongong
J. Seberry, University of Wollongong

Article comments

This article was originally published as Chaudhry, GR, Ghodosi, H and Seberry, J, Perfect Secret Sharing Schemes from Room Squares, Journal of Combinatorial Mathematics and Combinatorial Computing, 28, 1998, 55-61.

Abstract

Secret sharing schemes are one of the most important primitives in distributed systems. In perfect secret sharing schemes, collaboration between unauthorised participants cannot reduce their uncertainty about the secret. This paper presents a perfect secret sharing scheme arising from critical sets of Room squares.

Suggested Citation

G. R. Chaudhry, H Ghodosi, and J. Seberry. "Perfect Secret Sharing Schemes from Room Squares" Faculty of Informatics - Papers (1998).
Available at: http://works.bepress.com/jseberry/68