Probabilistic encryption

Adleman, 1977, On taking roots in finite fields, 175 Adleman, 1980, On distinguishing prime numbers from composite numbers, 387 Blum, 1982, Coin flipping by telephone, 133 Blum, 1982 Blum, 1982, How to generate cryptographically strong sequences of pseudo random bits Brassard, 1979, Relativized cryptography, 383 Brassard, 1982 Gauss, 1966 Diffie, 1976, New direction in cryptography, IEEE Trans. Inform. Theory, IT-22, 644, 10.1109/TIT.1976.1055638 Goldwasser, 1981, A Bit by Bit Secure Public Key Cryptosystem Goldwasser, 1982, Probabilistic encryption & how to play mental poker, keeping secret all partial information Goldwasser, 1982, Why and how to establish a private code in a public network Goldwasser, 1983, Probabilistic Encryption: Theory and Applications Goldwasser, 1983, Strong signature schemes and authentication Guy, 1975, How to factor a number, 49 Knuth, 1981, Vol. 2 Lipton, 1981, How to cheat at mental poker Miller, 1975, Riemann's hypothesis and tests for primality, 10.1145/800116.803773 Luby, 1983 Rabin, 1979, Digitalized signatures and public-key functions as intractable as factorization, MIT/ LCS/TR-212, Technical Memo MIT Rivest, 1978, A method for obtaining digital signatures and public key cryptosystems, Communications of the ACM, 10.1145/359340.359342 Shamir, 1978, Mental Poker, MIT Technical Report Shannon, 1949, Communication theory of secrecy systems, Bell System Tech. J., 28, 656, 10.1002/j.1538-7305.1949.tb00928.x Shanks, 1978 Vazirani, 1983, Secure one-bit disclosures using a pseudo random number generator Yao, 1982, On the theory and application of trapdoor functions