Skip to main content

(SE-33)Intelligent ID-Based Threshold System by an Encryption and Decryption from Bilinear Pairing

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3682))

  • 1004 Accesses

Abstract

We suggest a new intelligent ID-based threshold secure system by an encryption and decryption protocol using (k, n)-threshold scheme which only k agents or more are engaged to reconstruct an encrypted data for a mobile intelligent system. Security issue protecting the network communication can be resolved by applying the Security Socket Layer. But the issue protecting the host against agent and the agent against malicious host can’t be resolve with this SSL. We aim that a protocol has to allow hosts to send and receive safely an encrypted data from the agents, even if some of the agents are compromised under the multi-agent roaming system. Since our secure system have the verification, the hosts and agents can be protected from each other.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

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. Cryptology ePrint Archive, Report 2003/164 available at http://eprint.iacr.org/2003/164 , PKC 2004

  2. Boldyreva, A.: Efficient Threshold Signature, Multisignature and Blind Signature Schemes Based on the Gap-Diffie-Hellman-Group Signature Scheme. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 31–46. Springer, Heidelberg (2001)

    Google Scholar 

  3. Boneh, D., Franklin, M.: Identity Based Encryption form the Weil Pairing. SIAM J. of Computing 32(3), 586–615 (2003) Extended Abstract in Crypto 2001

    Google Scholar 

  4. Boneh, D., Lynn, B., Shacham, H.: Short Signatures form the Weil Pairing. In: Proceedings of Asiacrypt 2001 (2001)

    Google Scholar 

  5. Boneh, D., Mironov, I. , Shoup, V.: A secure Signature Scheme form Bilinear Maps. In: CT-RSA-2003, pp. 98–110 (2003)

    Google Scholar 

  6. Chen, X., Zhang, F., Kim, K.: A New ID-Based Group Signature Scheme form Bilinear Pairings. Cryptology ePrint Archive, Report 2003/116, available at http://eprint.iacr.org/2003/116

  7. Cocks, C.: An Identity Based Encryption Scheme based on Quadratic Residues. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol. 2260, pp. 360–363. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Galbraith, S., Harrison, K., Soldera, D.: Implementing the Tate Pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 324–337. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Hess, F.: Efficient Identity Based Signature Schemes Based on Pairings. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 310–324. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Libert, B., Quisquater, J.J.: Efficient Revocation and Threshold Pairing Based Cryptosystems. In: PODC 2003, pp. 163–171 (2003)

    Google Scholar 

  11. Libert, B. , Quisquater, J.J.: New Identity Based Signcryption Schemes from Pairings. Cryptology ePrint Archive, Report 2003/023, available at http://eprint.iacr.org/2003/023

  12. Paterson, K.G.: ID-Based Signatures from Pairings on Elliptic Curves Electron. Lett. 38(18), 1025–1026 (2002), Also available at http://eprint.iacr.org/2002/004

  13. Sakai, R., Kasahara, M.: Cryptosystems Based on Pairing over Elliptic Curve SCIS 2003, 8c-1, Japan (January 2003), Also available at http://eprint.iacr.org/2003/054

  14. Sakai, R., Ohgihi, K., Kasahara, M.: Cryptosystems Based on Pairing. In: SCIS 2000-c20, Okinawa, Japan (January 2000)

    Google Scholar 

  15. Zhang, F., Safavi-Naini, R., Susilo, W.: Efficient Verifiably Encrypted Signature and Partially Blind Signature from Bilinear Pairings. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 191–204. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, Y.W., Choi, B.M. (2005). (SE-33)Intelligent ID-Based Threshold System by an Encryption and Decryption from Bilinear Pairing. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11552451_141

Download citation

  • DOI: https://doi.org/10.1007/11552451_141

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28895-4

  • Online ISBN: 978-3-540-31986-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics