Cryptology ePrint Archive: Report 2021/1498

Rectangular, Range, and Restricted AONTs: Three Generalizations of All-or-Nothing Transforms

Navid Nasr Esfahani and Douglas Stinson

Abstract: All-or-nothing transforms (AONTs) were originally defined by Rivest as bijections from $s$ input blocks to $s$ output blocks such that no information can be obtained about any input block in the absence of any output block. Numerous generalizations and extensions of all-or-nothing transforms have been discussed in recent years, many of which are motivated by diverse applications in cryptography, information security, secure distributed storage, etc. In particular, $t$-AONTs, in which no information can be obtained about any $t$ input blocks in the absence of any $t$ output blocks, have received considerable study. In this paper, we study three generalizations of AONTs that are motivated by applications due to Pham et al. and Oliveira et al. We term these generalizations rectangular, range, and restricted AONTs. Briefly, in a rectangular AONT, the number of outputs is greater than the number of inputs. A range AONT satisfies the $t$-AONT property for a range of consecutive values of $t$. Finally, in a restricted AONT, the unknown outputs are assumed to occur within a specified set of "secure" output blocks. We study existence and non-existence and provide examples and constructions for these generalizations. We also demonstrate interesting connections with combinatorial structures such as orthogonal arrays, split orthogonal arrays, MDS codes and difference matrices.

Category / Keywords: foundations / combinatorial cryptography

Date: received 10 Nov 2021

Contact author: dstinson at uwaterloo ca

Available format(s): PDF | BibTeX Citation

Version: 20211115:125625 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]