@InProceedings{RS82b,
  author = 	 { Ronald L. Rivest and Alan T. Sherman },
  title = 	 { Randomized Encryption Techniques },
  pages = 	 { 145--163 },
  booktitle =    { Advances in Cryptology---Proceedings of {CRYPTO 82} },
  editor = 	 { David Chaum and Ronald L. Rivest and Alan T. Sherman},
  publisher =    { Plenum Press },
  date =         { 1982-08 },                  
  OPTyear = 	 { 1983 },
  OPTmonth =     { August 23--25, },                  
  eventtitle =   { CRYPTO '82 },                  
  eventdate =    { 1982-08-23/1982-08-25 },                  
  venue =        { U. C. Santa Barbara },                  
  abstract =     {
        A \emph{randomized encryption procedure} enciphers a message by randomly
        choosing a ciphertext from a set of ciphertexts corresponding to the
        message under the current encryption key.  At the cost of increasing the
        required bandwidth, such procedures may achieve greater cryptographic
        security than their deterministic counterparts by increasing the apparent
        size of the message space, eliminating the threat of chosen plaintext attacks, 
        and improving the \emph{a priori} statistics for the inputs to the encryption
        algorithms.  In this paper we explore various ways of using randomization in
        encryption.                  
                 },
}