Skip to main content
SpringerLink
Log in
Book cover

International Conference on Emerging Internetworking, Data & Web Technologies

EIDWT 2017: Advances in Internetworking, Data & Web Technologies pp 328–339Cite as

An Efficient and Secure Outsourcing Algorithm for Bilinear Pairing Computation

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes on Data Engineering and Communications Technologies ((LNDECT,volume 6))

Abstract

Bilinear pairing computation is one of the most important cryptographic primitives, which is widely used in the public key encryption schemes. However, it has been considered the most expensive operation in the pairing-based cryptographic protocols. In this paper, we present an efficient and secure outsourcing algorithm for bilinear maps based on one untrusted servers. The client could outsource expensive computation to the cloud and perform simple operation to obtain the great efficiency. We analyze the security of this algorithm and compare it with prior works in efficiency. It is argued that our algorithm is more efficient and practical than the state of the art.

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   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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

References

  1. Su, Z., Sun, C., Li, H., Ma, J.: A method for efficient parallel computation of Tate pairing. Int. J. Grid Util. Comput. 3, 43–52 (2012)

    Article  Google Scholar 

  2. Zhang, J., Zhang, F.: Linear threshold verifiable secret sharing in bilinear groups. Int. J. Grid Util. Comput. 4, 212–218 (2013)

    Article  Google Scholar 

  3. Sakai, R., Ohigishi, K., Kasahara, M.: Cryptosystems based on pairing. In: Symposium on Cryptography and Information Security, pp. 135–148 (2000)

    Google Scholar 

  4. Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Advances in Cryptology—CRYPTO 2001, pp. 213–229. Springer, Heidelberg (2001)

    Google Scholar 

  5. Luo, S., Chen, Z.: Hierarchical identity-based encryption without key delegation in decryption. Int. J. Grid Util. Comput. 5, 71–79 (2014)

    Article  Google Scholar 

  6. Sun, X., Jiang, Z., Zhou, M., Wang, Y.: Versatile identity-based signatures for authentication in multi-user settings. Int. J. Grid Util. Comput. 5, 156–164 (2014)

    Article  Google Scholar 

  7. Garg, S., Gentry, C., Halevi, S., Zhandry, M.: Fully secure attribute based encryption from multilinear maps. IACR Cryptology ePrint Archive 2014/622

    Google Scholar 

  8. Zhu, S., Yang, X.: Protecting data in cloud environment with attribute-based encryption. Int. J. Grid Util. Comput. 6, 91–97 (2015)

    Article  Google Scholar 

  9. Wee, H.: Dual system encryption via predicate encodings. In: Theory of Cryptography Conference, pp. 616–637. Springer, Heidelberg (2014)

    Google Scholar 

  10. Lewko, A., Okamoto, T., Sahai, A., Takashima, K., Waters, B.: Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 62–91. Springer, Heidelberg (2010)

    Google Scholar 

  11. Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 506–522. Springer, Heidelberg (2004)

    Google Scholar 

  12. Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 514–532. Springer, Heidelberg (2001)

    Google Scholar 

  13. Guo, S., Xu, H.: A secure delegation scheme of large polynomial computation in multi–party cloud. Int. J. Grid Util. Comput. 6, 1–7 (2014)

    Article  Google Scholar 

  14. Manoharan, M., Selvarajan, S.: An efficient methodology to improve service negotiation in cloud environment. Int. J. Grid Util. Comput. 6, 150–158 (2015)

    Article  Google Scholar 

  15. Khan, N., Al-Yasiri, A.: Cloud security threats and techniques to strengthen cloud computing adoption framework. Int. J. Inf. Technol. Web Eng. (IJITWE) 11, 50–64 (2016)

    Article  Google Scholar 

  16. Yuriyama, M., Kushida, T.: Integrated cloud computing environment with IT resources and sensor devices. Int. J. Space-Based Situated Comput. 1, 163–173 (2011)

    Article  Google Scholar 

  17. Mezghani, K., Ayadi, F.: Factors explaining IS managers attitudes toward cloud computing adoption. Int. J. Technol. Hum. Interact. (IJTHI) 12, 1–20 (2016)

    Article  Google Scholar 

  18. Sakurai, S.: Prediction of sales volume based on the RFID data collected from apparel shops. Int. J. Space-Based Situated Comput. 1, 174–182 (2011)

    Article  Google Scholar 

  19. Varaprasad, G., Murthy, G.S., Jose, J., D’Souza, R.J.: Design and development of efficient algorithm for mobile ad hoc networks using cache. Int. J. Space-Based Situated Comput. 1, 183–188 (2011)

    Article  Google Scholar 

  20. Morreale, P., Goncalves, A., Silva, C.: Mobile ad hoc network communication for disaster recovery. Int. J. Space-Based Situated Comput. 5, 178–186 (2015)

    Article  Google Scholar 

  21. Hohenberger, S., Lysyanskaya, A.: How to securely outsource cryptographic computations. In: Proceedings of the 2nd International Conference on Theory of Cryptography, pp. 264–282. Springer, Berlin (2005)

    Google Scholar 

  22. Tian, H., Zhang, F., Ren, K.: Secure bilinear pairing outsourcing made more efficient and flexible. In: Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security (2015)

    Google Scholar 

  23. Girault, M., Lefranc, D.: Server-aided verification: theory and practice. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 605–623. Springer, Heidelberg (2005)

    Google Scholar 

  24. Chevallier-Mames, B., Coron, J.S., McCullagh, N., Naccache, D., Scott, M.: Secure delegation of elliptic-curve pairing. In: International Conference on Smart Card Research and Advanced Applications, pp. 24–35. Springer, Heidelberg (2010)

    Google Scholar 

  25. Canard, S., Devigne, J., Sanders, O.: Delegating a pairing can be both secure and efficient. In: International Conference on Applied Cryptography and Network Security, pp. 549–565. Springer International Publishing (2014)

    Google Scholar 

  26. Chen, X., Susilo, W., Li, J., Wong, D.S., Ma, J., Tang, S., Tang, Q.: Efficient algorithms for secure outsourcing of bilinear pairings. Theor. Comput. Sci. 562, 112–121 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  27. Arabacı, O., Kiraz, M.S., Sertkaya, I., Uzunkol, O.: More efficient secure outsourcing methods for bilinear maps (2015)

    Google Scholar 

  28. Nguyen, P.Q., Shparlinski, I.E., Stern, J.: Distribution of modular sums and the security of the server aided exponentiation. In: Cryptography and Computational Number Theory, pp. 331–342. Birkhäuser, Basel (2001)

    Google Scholar 

  29. Goldreich, O.: The Foundation of Cryptography: Basic Applications, vol. 1, pp. 103–112. Cambridge University Press, Cambridge (2009)

    Google Scholar 

  30. Wang, Y., Wu, Q., Wong, D.S., Qin, B., Chow, S.S., Liu, Z., Tan, X.: Securely outsourcing exponentiations with single untrusted program for cloud storage. In: European Symposium on Research in Computer Security, pp. 326–343. Springer International Publishing (2014)

    Google Scholar 

Download references

Acknowledgments

This work was supported in part by the National Nature Science Foundation of China (Grant Nos. U1636114, 61402531, 61572521) and the Nature Science Basic Research Plan in Shaanxi Province of china (Grant Nos. 2014JM8300, 2014JQ8358, 2015JQ6231, 2016JQ6037).

Author information

Authors and Affiliations

  1. Department of Electronic Technology, Engineering University of Chinese People’s Armed Police Force, Xi’an, Shaanxi, China

    Xiaoshuang Luo, Xiaoyuan Yang & Xiangzhou Niu

  2. Key Laboratory of Network and Information Security, Chinese People’s Armed Police, Xi’an, Shaanxi, China

    Xiaoshuang Luo, Xiaoyuan Yang & Xiangzhou Niu

Authors
  1. Xiaoshuang Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaoyuan Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiangzhou Niu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaoyuan Yang .

Editor information

Editors and Affiliations

  1. Fukuoka Institute of Technology, Fukuoka, Japan

    Leonard Barolli

  2. School of Computer Sciences, Hubei University of Technology, Wuhan, China

    Mingwu Zhang

  3. Department of Electronic Technology, Key, Engineering University of CAPF, Xi’an, Xizang, China

    Xu An Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Luo, X., Yang, X., Niu, X. (2018). An Efficient and Secure Outsourcing Algorithm for Bilinear Pairing Computation. In: Barolli, L., Zhang, M., Wang, X. (eds) Advances in Internetworking, Data & Web Technologies. EIDWT 2017. Lecture Notes on Data Engineering and Communications Technologies, vol 6. Springer, Cham. https://doi.org/10.1007/978-3-319-59463-7_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59463-7_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59462-0

  • Online ISBN: 978-3-319-59463-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation