### Some results on the existence of $t$-all-or-nothing transforms over arbitrary alphabets

Navid Nasr Esfahani, Ian Goldberg, and D. R. Stinson

##### Abstract

A $(t, s, v)$-all-or-nothing transform is a bijective mapping defined on $s$-tuples over an alphabet of size $v$, which satisfies the condition that the values of any $t$ input co-ordinates are completely undetermined, given only the values of any $s-t$ output co-ordinates. The main question we address in this paper is: for which choices of parameters does a $(t, s, v)$-all-or-nothing transform (AONT) exist? More specifically, if we fix $t$ and $v$, we want to determine the maximum integer $s$ such that a $(t, s, v)$-AONT exists. We mainly concentrate on the case $t=2$ for arbitrary values of $v$, where we obtain various necessary as well as sufficient conditions for existence of these objects. We consider both linear and general (linear or nonlinear) AONT. We also show some connections between AONT, orthogonal arrays and resilient functions.

Available format(s)
Category
Foundations
Publication info
Preprint.
Keywords
combinatorial cryptography
Contact author(s)
dstinson @ uwaterloo ca
History
Short URL
https://ia.cr/2017/177

CC BY

BibTeX

@misc{cryptoeprint:2017/177,
author = {Navid Nasr Esfahani and Ian Goldberg and D.  R.  Stinson},
title = {Some results on the existence of $t$-all-or-nothing  transforms over arbitrary alphabets},
howpublished = {Cryptology ePrint Archive, Paper 2017/177},
year = {2017},
note = {\url{https://eprint.iacr.org/2017/177}},
url = {https://eprint.iacr.org/2017/177}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.