Shafi Goldwasser
Silvio Micali
ABSTRACT
This paper proposes an Encryption Scheme that possess the following property : An adversary, who knows the encryption algorithm and is given the cyphertext, cannot obtain any information about the clear-text.
Any implementation of a Public Key Cryptosystem, as proposed by Diffie and Hellman in [8], should possess this property.
Our Encryption Scheme follows the ideas in the number theoretic implementations of a Public Key Cryptosystem due to Rivest, Shamir and Adleman [13], and Rabin [12].
- 1.Adleman, L., Private Communication, 1981.Google Scholar
- 2.Adleman, L., Manders K. and Miller G., On Taking Roots In Finite Fields, Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1977, 175-177.Google ScholarDigital Library
- 3.Adleman, L., On Distinguishing Prime Numbers from Composite Numbers, Proceedings of the 21st IEEE Symposium on the Foundations of Computer Science (FOCS), Syracuse, N.Y., 1980, 387-408.Google Scholar
- 4.Blum, M., Three Applications of The Oblivious Transfer, to appear, 1981.Google Scholar
- 5.Blum, M., and Micali, S., How to Flip A Coin Through the Telephone, to appear, 1982.Google Scholar
- 6.Blum, M., Mental Poker, to appear, 1982.Google Scholar
- 7.Brassard, G., Relativized Cryptography, Proceedings of the 20st IEEE Symposium on the Foundations of Computer Science (FOCS), San Juan, Puerto Rico, 1979, 383-391.Google Scholar
- 8.Diffie, W., and M. E. Hellman, New Direction in Cryptography, IEEE Trans. on Inform. Th. IT-22, 6 (1976), 644-654.Google ScholarDigital Library
- 9.Goldwasser S., and Micali S., A Bit by Bit Secure Public Key Cryptosystem, Memorandum NO. UCB/ERL M81/88, University of California, Berkeley, December 1981.Google Scholar
- 10.Lipton, R., How to Cheat at Mental Poker, Proceeding of the AMS short course on Cryptology, January 1981.Google Scholar
- 11.Miller, G., Riemann's Hypothesis and Tests for Primality, Ph.D. Thesis, U.C. Berkeley, 1975.Google Scholar
- 12.Rabin, M., Digitalized Signatures and Public-Key Functions As Intractable As Factorization, MIT/LCS/TR-212, Technical Memo MIT, 1979. Google ScholarDigital Library
- 13.Rivest, R., Shamir, A., Adleman, L., A Method for Obtaining Digital Signatures and Public Key Cryptosystems, Communications of the ACM, February 1978. Google ScholarDigital Library
- 14.Shamir, Rivest, and Adleman, Mental Poker, MIT Technical Report, 1978.Google Scholar
- 15.Shanks, D., Solved and Unsolved Problems in Number Theory, Chelsea Publishing Co. (1978). Google ScholarDigital Library
- Probabilistic encryption & how to play mental poker keeping secret all partial information
Recommendations
Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
In this paper, we present two non-zero inner-product encryption (NIPE) schemes that are adaptively secure under a standard assumption, the decisional linear (DLIN) assumption, in the standard model. One of the proposed NIPE schemes features constant-...
Adaptive CCA broadcast encryption with constant-size secret keys and ciphertexts
We consider designing public-key broadcast encryption schemes with constant-size secret keys and ciphertexts, achieving chosen-ciphertext security. We first argue that known CPA-to-CCA transforms currently do not yield such schemes. We then propose a ...
Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
CANS'11: Proceedings of the 10th international conference on Cryptology and Network SecurityIn this paper, we present two <em>non-zero inner-product</em> encryption (NIPE) schemes that are <em>adaptively secure</em> under a standard assumption, the decisional linear (DLIN) assumption, in the standard model. One of the proposed NIPE schemes ...
Comments