Abstract
This paper introduces the first probabilistic public-key encryption scheme which combines the following two properties:
-
(1)
Perfect secrecy with respect to polynomial time eavesdroppers: For all message spaces, no polynomial time bounded passive adversary who is tapping the lines, can compute any partial information about messages from their encodings, unless factoring composite integers is in probabilistic polynomial time.
-
(2)
Efficiecy: It compares favorably with the deterministic RSA public-key cryptosystem in both encoding and decoding time and bandwidth expansion.
The security of the system we propose can also be based on the assumption that the RSA function is intractable, maintaining the same cost for encoding and decoding and the Same data expansion. This implementation may have advantages in practice.
Supported in part by IBM Young Faculty Development Award Dated September 1984
Chapter PDF
Similar content being viewed by others
Key Words
References
Awerbach, Blum, Chor, Goldwasser, Micali, A Provably Fair Coin Toss in A Byzantine Network, Submitted to PODC 1985.
Chor, Goldreich, RSA/Rabin Bits are \( {1 \mathord{\left/ {\vphantom {1 2}} \right. \kern-\nulldelimiterspace} 2} + \frac{1} {{poly \left( {\left| N \right|} \right)}} \) secure, Proc. of Crypto 84, Santa Barbara.
M. Blum, private communication.
L. Blum, M. Blum and M. Shub, A simple secure pseudo random number generator. Advances in Cryptology: Proc. of CRYPTO-82, ed D. Chaum. R.L. Rivest and A.T. Sherman. Plenum press 1983, pp 61–78.
Ben-Or, Chor, Shamir, On the Security of RSA Bits. Proceedings of 15th ACM symposuim on Theory of Computation, April 1983. pp. 421–430
A. Broder. and D. Dolev. On Flipping Coins in Many Pockets. 25th IEEE FOCS, 1984.
M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo-random bits Proc 23rd IEEE Symp. on Foundations of Computer Science, 1982, pp 112–117
Diffie and Hellman, New Directions in Cryptography, IEEE Transactions on Infromation Theory.
S. Goldwasser and S. Micali, Probabilistic Encryption, JCSS 28(2), 1984. References
Goldwasser and Micali, Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Infroniation, 1982 14th STOC.
S. Goldwasser, S. Micali and P. Tong, Why and how to establish a private code on a public network, Proc. 23rd IEEE Symp. on Foundations of Computer Science, 1982, pp 134–144
S. Goldwasser, S. Micali and R. Rivest, Probabilistic Signature SEcure Against Chosen Cyphertext Attack. In Preparation.
J. Hastad, On Using RSA with Low Exponent in A Public Key Network In Preparation.
D. Lipton. How to Cheat in Mental Poker.
M. Rabin, Digital Signatures as Intractable as Factorization.
R. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public key crypltosystems, Commun. ACM, vol. 21, Feb. 1978. pp 120–126
A.C. Yao. Theory and applications of trapdoor functions, Proc. 23rd IEEE Symp. on Foundations of Computer Science, 1982, pp 80–91.
C. Shannon, A Mathematical Theory of Cryptography, 1945.
V. Vazirani, U. Vazirani Trapdoor Pseudo-Random Number Generators with Applications to Protocol Design, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blum, M., Goldwasser, S. (1985). An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information. In: Blakley, G.R., Chaum, D. (eds) Advances in Cryptology. CRYPTO 1984. Lecture Notes in Computer Science, vol 196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39568-7_23
Download citation
DOI: https://doi.org/10.1007/3-540-39568-7_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15658-1
Online ISBN: 978-3-540-39568-3
eBook Packages: Springer Book Archive