Chosen Ciphertext Security with Optimal Ciphertext Overhead

@inproceedings{Abe2008ChosenCS,
  title={Chosen Ciphertext Security with Optimal Ciphertext Overhead},
  author={Masayuki Abe and Eike Kiltz and Tatsuaki Okamoto},
  booktitle={IEICE Transactions},
  year={2008}
}
Every public-key encryption scheme has to incorporate a certain amount of randomness into its ciphertexts to provide semantic security against chosen ciphertext attacks (IND-CCA). The difference between the length of a ciphertext and the embedded message is called the ciphertext overhead. While a generic brute-force adversary running in 2 steps gives a theoretical lower bound of t bits on the ciphertext overhead for IND-CPA security, the best known IND-CCA secure schemes demand roughly 2t bits… CONTINUE READING
13 Citations
26 References
Similar Papers

Citations

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

References

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

Chosen ciphertext security with optimal overhead

  • M. Abe, E. Kiltz, T. Okamoto
  • IACR ePrint Archive 2008/374, September 2
  • 2008
2 Excerpts

Similar Papers

Loading similar papers…