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

zbMATH Open1392.94757arXiv1702.06612MaRDI QIDQ4570879FDOQ4570879

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

Publication date: 9 July 2018

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.

Full work available at URL: https://arxiv.org/abs/1702.06612

Mathematics Subject Classification ID

Cryptography (94A60) Source coding (94A29)

Cited In (4)

• A scalable post-quantum hash-based group signature
• Linear \((2, p, p)\)-AONTs exist for all primes \(p\)
• Rectangular, range, and restricted AONTs: three generalizations of all-or-nothing transforms
• On security properties of all-or-nothing transforms

This page was built for publication: Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4570879)