33 citations · 78 across the 45 of their papers we have counts for
5 papers · 1 filter
Rectangular, Range, and Restricted AONTs: Three Generalizations of All-or-Nothing Transforms
Navid Nasr Esfahani, Douglas Stinson
All-or-nothing transforms (AONTs) were originally defined by Rivest as bijections from input blocks to output blocks such that no information can be obtained about any inpu…
An Analysis and Critique of the Scoring Method Used for Sport Climbing at the 2020 Tokyo Olympics
Michela J. Stinson, Douglas R. Stinson
Sport climbing was a new Olympic event introduced at the Tokyo 2020 Olympics. It was composed of three disciplines, and the final rankings were determined by computing the product…
Asymmetric All-or-nothing Transforms
Navid Nasr Esfahani, Douglas R. Stinson
In this paper, we initiate a study of asymmetric all-or-nothing transforms (or asymmetric AONTs). A (symmetric) -all-or-nothing transform is a bijective mapping defined on the s…
Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes
Maura B. Paterson, Douglas R. Stinson
A splitting BIBD is a type of combinatorial design that can be used to construct splitting authentication codes with good properties. In this paper we show that a design-theoretic…
On Security Properties of All-or-nothing Transforms
Navid Nasr Esfahani, Douglas R. Stinson
All-or-nothing transforms have been defined as bijective mappings on all s-tuples over a specified finite alphabet. These mappings are required to satisfy certain "perfect security…