Perfect secret sharing schemes from combinatorial squares

Abstract

Chaudhry et al. proposed perfect secret sharing schemes from combinatorial squares called Room squares based on certain balanced incomplete block designs. Their protocol is efficient and secure but it is based on a Room square of order r which exists if and only if r is odd and r ≠ 3, 5. Here, we have proposed the schemes from Room squares based on group divisible designs which are a broader class of designs.