On security properties of all-or-nothing transforms

Something About All or Nothing (Transforms)

In this short note, we study all-or-nothing transforms, which were recently proposed by Rivest as a mode of operation for block ciphers. We study transforms of this type that provide unconditional security. A simple construction for linear transforms is given, and some existence and non-existence results for general transforms are derived from a combinatorial characterization of these objects.

On All - or - Nothing Transforms and Password - AuthenticatedKey

This thesis provides a formal analysis of two kinds of cryptographic objects that used to be treated with much less rigor: All-or-Nothing Transforms (AONTs) and Password-Authenticated Key Exchange protocols. For both, novel formal deenitions of security are given, and then practical and eecient constructions are proven secure. The constructions for password-authenticated key exchange are novel,...

On the Security of Cryptosystems with All-or-Nothing Transform

We study the data privacy of cryptosystems with All-or-Nothing transform (AONT). An AONT is an efficient computable transform with two properties: Given all the bits of its output, it is easy to retrieve the message. On the other hand, if sufficiently many bits of the output are missing, it is computationally infeasible for an polynomial-time adversary to learn any information about the message...

Exposure-Resilient Fun tions and All-Or-Nothing Transforms

Exposure-Resilient Functions and All-or-Nothing Transforms

We study the problem of partial key exposure. Standard cryptographic definitions and constructions do not guarantee any security even if a tiny fraction of the secret key is compromised. We show how to build cryptographic primitives that remain secure even when an adversary is able to learn almost all of the secret key. The key to our approach is a new primitive of independent interest, which w...