Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles

By Dan Boneh, Xavier Boyen, and Shai Halevi.

In Topics in Cryptology (CT-RSA 2006), volume 3860 of Lecture Notes in Computer Science, pages 226-243. Springer, 2006.

Abstract

We present a non-interactive chosen ciphertext secure threshold encryption system. The proof of security is set in the standard model and does not use random oracles. Our construction uses the recent identity based encryption system of Boneh and Boyen and the chosen ciphertext secure construction of Canetti, Halevi, and Katz.

Material

- published paper (PS) (PDF) © Springer-Verlag
- updated version (PS) (PDF)
- presentation slides (HTML)

Reference

@InProceedings{Boneh+Boyen+Halevi:CTRSA-2006:threshold,
  author = {Dan Boneh and Xavier Boyen and Shai Halevi},
  title = {Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles},
  booktitle = {Topics in Cryptology---CT-RSA 2006},
  series = {Lecture Notes in Computer Science},
  volume = {3860},
  pages = {226--243},
  publisher = {Berlin: Springer-Verlag},
  year = {2006},
  note = {Available at \url{http://www.cs.stanford.edu/~xb/ctrsa06/}}
}