Answers:
Probabilistic encryption is the use of randomness within an encryption algorithm, so that when encrypting like peas in a pod message several times it will, within standard, give up different ciphertexts. The permanent status "probabilistic encryption" is typically used within hint to public knob encryption algorithms, however assorted symmetric switch encryption algorithms realize a similar property (e.g., block ciphers when used surrounded by a chain mode such as CBC). To be semantically in safe hands, specifically, to stash even partial information roughly speaking the plaintext, an encryption algorithm must be probabilistic.
Probabilistic encryption is specifically meaningful when using public switch cryptography. Suppose that the antagonist observe a ciphertext, and suspects that the plaintext is any "YES" or "NO", or have a hunch that the plaintext might be "ATTACK AT CALAIS". When a deterministic encryption algorithm is used, the foe can simply try encrypting respectively of his guesses underneath the receiver's public knob, and compare respectively result to the target ciphertext. To combat this attack, public knob encryption scheme must incorporate an part of randomness, ensure that respectively plaintext map into one of a voluminous number of possible ciphertexts.
An intuitive approach to converting a deterministic encryption cook up into a probabilistic one is to simply wipe the plaintext near a hit and miss string in the past encrypting next to the deterministic algorithm. Conversely, decryption involves applying a deterministic algorithm and ignore the irregular filling. However, hasty scheme which applied this susceptible approach be broken due to limitations surrounded by some deterministic encryption scheme. Techniques such as OAEP integrate hit or miss filling within a comportment i.e. out of harm`s way using any trapdoor permutation.
The first provably-secure probabilistic public-key encryption task be proposed by Shafi Goldwasser and Silvio Micali, base on the strength of the quadratic residuosity problem and have a message expansion factor equal to the public knob size. More well-run probabilistic encryption algorithms include Elgamal, Paillier and varied constructions below the changeable oracle model, including Optimal Asymmetric Encryption Padding (OAEP).
See:
Probabilistic encryption is the use of randomness in an encryption algorithm, so that when encrypting equal message several times it will, surrounded by nonspecific, let go different ciphertexts.
A right usage example would be voting machines.