All or nothing at all

MaRDI QIDQ727180zbMATH OpenFDO

Authors Paolo D'Arco, Navid Nasr Esfahani, D. R. Stinson

Publication date 6 December 2016

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.03655, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p10

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

all-or-nothing transformblock designscyclotomy

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Abstract: 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 consider the security of t inputs, when s-t outputs are known. Previous work concerned the case t=1; here we consider the problem for general t, focussing on the case t=2. We investigate constructions of binary matrices for which the desired properties hold with the maximum probability. Upper bounds on these probabilities are obtained via a quadratic programming approach, while lower bounds can be obtained from combinatorial constructions based on symmetric BIBDs and cyclotomy. We also report some results on exhaustive searches and random constructions for small values of s.

Review text

Summary: We continue a study of unconditionally secure all-or-nothing transforms (AONT) begun by \textit{D. R. Stinson} [Des. Codes Cryptography 22, No. 2, 133--138 (2001; Zbl 0985.94030)]. An AONT is a bijective mapping that constructs \(s\) outputs from \(s\) inputs. We consider the security of \(t\) inputs, when \(s-t\) outputs are known. Previous work concerned the case \(t=1\); here we consider the problem for general \(t\), focussing on the case \(t=2\). We investigate constructions of binary matrices for which the desired properties hold with the maximum probability. Upper bounds on these probabilities are obtained via a quadratic programming approach, while lower bounds can be obtained from combinatorial constructions based on symmetric BIBDs and cyclotomy. We also report some results on exhaustive searches and random constructions for small values of \(s\).

Recommendations

• On security properties of all-or-nothing transforms
• Something about all or nothing (transforms)
• Linear \((2, p, p)\)-AONTs exist for all primes \(p\)
• Applied Cryptography and Network Security
• Exposure-resilient functions and all-or-nothing transforms

Cites work

• A new mode of using all-or-nothing transforms
• A polyhedral branch-and-cut approach to global optimization
• All-or-nothing encryption and the package transform
• Exposure-resilient functions and all-or-nothing transforms
• scientific article; zbMATH DE number 1759790 (Why is no real title available?)
• Resolution of the sign ambiguity in the determination of the cyclotomic numbers of order 4 and the corresponding Jacobsthal sum.
• Something about all or nothing (transforms)

Cited in

(11)

• On security properties of all-or-nothing transforms
• Everything, and more, in Austin
• Linear \((2, p, p)\)-AONTs exist for all primes \(p\)
• Invertible binary matrices with maximum number of 2-by-2 invertible submatrices
• Computational results on invertible matrices with the maximum number of invertible \(2\times 2\) submatrices
• Applied Cryptography and Network Security
• scientific article; zbMATH DE number 1418314 (Why is no real title available?)
• Something about all or nothing (transforms)
• Rectangular, range, and restricted AONTs: three generalizations of all-or-nothing transforms
• Asymmetric all-or-nothing transforms
• A scalable post-quantum hash-based group signature

This page was built for publication: All or nothing at all

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