Abstract
AbstractChaudhry 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
