A construction for Sv/4 pairwise disjoint quadruple systems on u points has been given by Lindner. This thesis looks at an implementation of nearly optimal (4,4, v)threshold schemes based on his construction. These threshold schemes will have 3 v/4 keys, whereas the best implementation known to date is based on a construction given by Shamir and yields only v/4 keys. Lindner's construction depends heavily on the existence of an iV2 latin square of order v/4, thus several constructions for them have also been implemented. Unfortunately, due to the combinatorial nature of the problem, the limitations of this implementation are an important issue and will be discussed.
Library of Congress Subject Headings
Computers--Access control; Logic programming; Threshold logic; Steiner systems--Data processing
Department, Program, or Center
Computer Science (GCCIS)
Monroe, W. John, "Computer construction of (4,4,v)-threshold schemes from Steiner Quadruple Systems" (1989). Thesis. Rochester Institute of Technology. Accessed from
RIT – Main Campus
Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in December 2013.