@InProceedings{Riv97d,
  author = 	 { Ronald L. Rivest },
  title = 	 { All-Or-Nothing Encryption and The Package Transform },
  pages = 	 { 210--218 },
  doi =          { 10.1007/BFb0052348 },                  
  booktitle =    { Proceedings Fourth International Conference on Fast Software Encryption },
  editor = 	 { Eli Biham },
  isbn =         { 3-540-63247-6 },                  
  publisher =    { Springer },
  series = 	 { Lecture Notes in Computer Science },
  volume = 	 { 1267 },
  date =         { 1997-01  },                  
  OPTyear = 	 { 1997 },
  OPTmonth = 	 { January 20--22 },
  eventtitle =   { FSE'97 },
  eventdate =    { 1997-01-20/1997-01-22 },                  
  venue =        { Haifa, Israel },                  
  abstract =     {
        We present a new mode of encryption for block ciphers, which we call all-or-nothing encryption.
        This mode has the interesting defining property that one must decrypt the entire ciphertext before
        one can determine even one message block. This means that brute-force searches against all-or-nothing
        encryption are slowed down by a factor equal to the number of blocks in the ciphertext. We give a
        specific way of implementing all-or-nothing encryption using a ``package transform'' as a pre-processing
        step to an ordinary encryption mode. A package transform followed by ordinary codebook encryption also
        has the interesting property that it is very efficiently implemented in parallel. All-or-nothing
        encryption can also provide protection against chosen-plaintext and related-message attacks.
                 },
}