Skip to main content
SpringerLink
Log in
Book cover

International Conference on Information Security Practice and Experience

ISPEC 2007: Information Security Practice and Experience pp 329–343Cite as

Identity-Based Threshold Decryption Revisited

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 4464))

Abstract

We present an identity-based threshold decryption scheme, which is secure against adaptive chosen ciphertext attack (IND-CCA) in the random oracle and generic model (ROM+GM). In our scheme, a one-time Schnorr signature is used for public checkability of ciphertexts, and a new method was proposed to distribute the shares of the decryption key to decrease the number of bilinear pairings involved. Hence our scheme is more efficient than the recent proposals by Baek and Zheng in [1] and by Kiltz and Galindo in [13].

The work is supported by NSFC under the grant no. 60673077, 60573030, and the National 863 Project under grant no. 2006AA01Z422.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baek, J., Zheng, Y.: Identity-Based Threshold Decryption. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 262–276. Springer, Heidelberg (2004)

    Google Scholar 

  2. 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)

    Chapter  Google Scholar 

  3. Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 566–582. Springer, Heidelberg (2001)

    Google Scholar 

  5. Cocks, C.: An identity based encryption scheme based on quadratic residues. In: Proceedings of the 8th IMA International Confreence on Cryptography and Coding, pp. 8–26 (2001)

    Google Scholar 

  6. Chaum, D., Pedersen, T.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89–105. Springer, Heidelberg (1993)

    Google Scholar 

  7. Dodis, Y., Yung, M.: Exposure-resilience for free: the hierarchical id-based encryption case. In: Proceedings of IEEE security in Storage Workshop, pp. 45–52 (2002)

    Google Scholar 

  8. Fujisaki, E., Okamoto, T.: Secure Integration of Asymmetric and Symmetric Encryption Schemes. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 537–554. Springer, Heidelberg (1999)

    Google Scholar 

  9. Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solution to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–189. Springer, Heidelberg (1987)

    Google Scholar 

  10. Page, D.L., Smart, N.P., Granger, R.: High Security Pairing-Based Cryptography Revisited. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 480–494. Springer, Heidelberg (2006)

    Google Scholar 

  11. Hui, L.C.K., Lam, K.-Y.: Fast square-and-multiply exponentiation for RSA. Electron. Lett. 30(17), 1396–1397 (1994)

    Article  Google Scholar 

  12. Jakobsson, M.: A practical mix. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 448–461. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  13. Kiltz, E., Galindo, D.: Direct Chosen-Ciphertext Secure Identity-Based Key Encapsulation without Random Oracles, iacr.org/2006/034.ps.gz

    Google Scholar 

  14. Libert, B., Quisquater, J.: Efficient revocation and threshold pairing based cryptosystems. In: Principles of Distributed Computing (2003)

    Google Scholar 

  15. Lim, C.H., Lee, P.J.: Another method for attaining security against adaptively chosen ciphertext attacks. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, Springer, Heidelberg (1994)

    Google Scholar 

  16. Mao, W.: Modern Cryptography: Theory and Practice, pp. 528–530. Prentice Hall PTR, Englewood Cliffs (2004)

    Google Scholar 

  17. Nechaev, V.I.: Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes 55, 165–172 (1994)

    Article  MathSciNet  Google Scholar 

  18. Scott, M.: Implementing cryptographic pairings. In: 10th workshop on Elliptic Curve Cryptography (ECC 2006), September 18-20 (2006), http://www.cacr.math.uwaterloo.ca/conferences/2006/ecc2006/slides.html

  19. Shamir, A.: Identity-based cryptosystems and siganture schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  20. Shamir, A.: How to share a secret. Communications of the ACM 22, 612–613 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  21. Schnorr, C.P., Jacobsson, M.: Security of signed ElGamal encryption. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 73–88. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  22. Gennaro, R., Shoup, V.: Securing Threshold Cryptosystems against Chosen Ciphertext Attack. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 1–16. Springer, Heidelberg (1998)

    Google Scholar 

  23. Shoup, V., Genarro, R.: Securing Threshold Cryptosystems against Chosen Ciphertext Attacks. J. Cryptology 15(2), 75–96 (2002)

    MATH  MathSciNet  Google Scholar 

  24. Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 256–266. Springer, Heidelberg (2000)

    Google Scholar 

  25. Tsiounis, Y., Yung, M.: On the Security of El Gamal based Encryption. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol. 1431, pp. 117–134. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering,  

    Shengli Liu & Kefei Chen

  2. School of Information Security Engineering, Shanghai Jiao Tong University, Shanghai 200240, P.R. China

    Weidong Qiu

Authors
  1. Shengli Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kefei Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Weidong Qiu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ed Dawson Duncan S. Wong

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Liu, S., Chen, K., Qiu, W. (2007). Identity-Based Threshold Decryption Revisited. In: Dawson, E., Wong, D.S. (eds) Information Security Practice and Experience. ISPEC 2007. Lecture Notes in Computer Science, vol 4464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72163-5_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72163-5_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72159-8

  • Online ISBN: 978-3-540-72163-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation