The result of this preprocessing is called the pseudomessage, and it serves as the input to the encryption algorithm.
In this way, it's impossible to recover the original plaintext without first having access to every single block of the pseudomessage.
In 1999 Victor Boyko proposed another AONT, provably secure under the random oracle model.
Another application, suggested in the original papers is to reduce the cost of security: for example, a file can be processed by AONT, and then only a small portion of it can be encrypted (e.g., on a smart-card).
AONT may be combined with forward error correction to yield a computationally secure secret sharing scheme.