2 citations · 2 across the 6 of their papers we have counts for
8 papers
Constructions and bounds for codes with restricted overlaps
Simon R. Blackburn, Navid Nasr Esfahani, Donald L. Kreher +1
Non-overlapping codes have been studied for almost 60 years. In such a code, no proper, non-empty prefix of any codeword is a suffix of any codeword. In this paper, we study codes…
On the Information-theoretic Security of Combinatorial All-or-nothing Transforms
Yujie Gu, Sonata Akao, Navid Nasr Esfahani +2
All-or-nothing transforms (AONT) were proposed by Rivest as a message preprocessing technique for encrypting data to protect against brute-force attacks, and have numerous applicat…
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…
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…
On The Relationship between (16,6,3)-Designs and (25,12) Self-Orthogonal Codes
Navid Nasr Esfahani, G. H. John van Rees
Binary self-orthogonal codes and balanced incomplete block designs are two combinatorial configurations that have been much studied because of their wide areas of application. In t…
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…
Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets
Navid Nasr Esfahani, Ian Goldberg, Douglas R. Stinson
A -all-or-nothing transform is a bijective mapping defined on -tuples over an alphabet of size , which satisfies the condition that the values of any input co-…
All or Nothing at All
Paolo D'Arco, Navid Nasr Esfahani, Douglas R. Stinson
We continue a study of unconditionally secure all-or-nothing transforms (AONT) begun in \cite{St}. An AONT is a bijective mapping that constructs s outputs from s inputs. We consid…