Dense Probabilistic Encryption

  title={Dense Probabilistic Encryption},
  author={Josh Benaloh},
This paper describes a method of dense probabilistic encryption. Previous probabilistic encryption methods require large numbers of random bits and produce large amounts of ciphertext for the encryption of each bit of plaintext. This paper develops a method of probabilistic encryption in which the ratio of ciphertext text size to plaintext size and the proportion of random bits to plaintext can both be made arbitrarily close to one. The methods described here have applications which are not in… CONTINUE READING
Highly Influential
This paper has highly influenced 18 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 239 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
156 Citations
11 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 156 extracted citations

239 Citations

Citations per Year
Semantic Scholar estimates that this publication has 239 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 11 references

A. \Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation

  • M Bgw88 ] Ben-Or, S Goldwasser, Wigderson
  • Proc. 20 th ACM Symp. on Theory of Computing
  • 1987

\Improving Privacy in Cryptographic Elections

  • J Cohe86 ] Cohen
  • \Improving Privacy in Cryptographic Elections
  • 1986

Similar Papers

Loading similar papers…