Identity-Based Threshold Decryption

  • Joonsang Baek
  • Yuliang Zheng
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2947)

Abstract

In this paper, we examine issues related to the construction of identity-based threshold decryption schemes and argue that it is important in practice to design an identity-based threshold decryption scheme in which a private key associated with an identity is shared. A major contribution of this paper is to construct the first identity-based threshold decryption scheme secure against chosen-ciphertext attack. A formal proof of security of the scheme is provided in the random oracle model, assuming the Bilinear Diffie-Hellman problem is computationally hard. Another contribution of this paper is, by extending the proposed identity-based threshold decryption scheme, to construct a mediated identity-based encryption scheme secure against more powerful attacks than those considered previously.

References

  1. 1.
    Baek, J., Zheng, Y.: Identity-Based Threshold Decryption. IACR ePrint Archive Report 2003/164Google Scholar
  2. 2.
    Bellare, M., Rogaway, P.: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In: Proceedings of the First ACM Conference on Computer and Communications Security 1993, pp. 62–73 (1993)Google Scholar
  3. 3.
    Bellare, M., Rogaway, P.: Optimal Asymmetric Encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 92–111. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  4. 4.
    Boneh, D., Ding, X., Tsudik, G., Wong, C.: A Method for Fast Revocation of Public Key Certificates and Security Capabilities. In: Proceedings of the 10th USENIX Security Symposium, USENIX (2001)Google Scholar
  5. 5.
    Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    Chaum, D., Perderson, T.: Wallet Databases with Observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89–105. Springer, Heidelberg (1993)Google Scholar
  7. 7.
    Ding, X., Tsudik, G.: Simple Identity-Based Cryptography with Mediated RSA. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 192–209. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  8. 8.
    Dodis, Y., Yung, M.: Exposure-Resilience for Free: The Hierarchical ID-based Encryption Case. In: Proceedings of IEEE Security in Storage Workshop 2002, pp. 45–52 (2002)Google Scholar
  9. 9.
    ElGamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Trans. Info. Theory 31, 469–472 (1985)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Fouque, P., Pointcheval, D.: Threshold Cryptosystems Secure Chosen-Ciphertext Attacks. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 351–368. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  11. 11.
    Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure Distributed Key Generation for Discrete-Log Based Cryptosystem. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 295–310. Springer, Heidelberg (1999)Google Scholar
  12. 12.
    Gentry, C., Silverberg, A.: Hierarchical ID-Based Cryptography. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 548–566. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  13. 13.
    Libert, B., Quisquater, J.: Efficient Revocation and Threshold Pairing Based Cryptosystems. In: Principles of Distributed Computing, PODC (2003)Google Scholar
  14. 14.
    Lim, C., Lee, P.: Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attack. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 410–434. Springer, Heidelberg (1994)Google Scholar
  15. 15.
    Menezes, J., Okamoto, T., Vanstone, S.A.: Reducing Elliptic Curve Logarithms to a Finite Field. IEEE Tran. on Info. Theory 31, 1639–1646 (1993)CrossRefMathSciNetGoogle Scholar
  16. 16.
    Shamir, A.: How to Share a Secret. Communications of the ACM 22, 612–613 (1979)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Shamir, A.: Identity-based Cryptosystems and Signature Schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985)CrossRefGoogle Scholar
  18. 18.
    Shoup, V., Gennaro, R.: Securing Threshold Cryptosystems against Chosen Ciphertext Attack. Journal of Cryptology 15, 75–96 (2002)MATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Joonsang Baek
    • 1
  • Yuliang Zheng
    • 2
  1. 1.School of Network ComputingMonash UniversityFrankstonAustralia
  2. 2.Dept. Software and Info. SystemsUNC CharlotteUSA

Personalised recommendations