Skip to main content
Log in

Tripartite outsoursing key-agreement protocol on bilinear pairings

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

The implementation of cryptographic protocols in systems with resource-constrained devices and possible transfer of laborious calculations to a cloud server is considered. In this case, the device performs “simple” arithmetic operations. A tripartite key-agreement with two servers and the model with one malicious computer is proposed.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Hohenberger, S. and Lysyanskaya, A., How to securely outsource cryptographic computations, Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005, 2005, pp. 264–282.

    Chapter  Google Scholar 

  2. Chevallier-Mames, B., Coron, J, S., McCullagh, N., Naccache, D., and Scott, M., Secure delegation of elliptic-curve pairing, Cryptol. ePrint Arch., 2005, no. 150.

    Google Scholar 

  3. Kang, B.G., Lee, M.S., and Park, J.H., Efficient Delegation of Pairing Computation, 2005.

    Google Scholar 

  4. Canard, S., Devigne, J., and Sanders, O., Delegating a pairing can be both secure and efficient, in Applied Cryptography and Network Security: Lecture Notes in Computer Science, Springer International Publishing, 2014, pp. 549–565.

    Google Scholar 

  5. Chen, X., Susilo, W., Li, J., Wong, D.S., Ma, J., Tang, S., and Tang, Q., Efficient algorithms for secure outsourcing of bilinear pairings, Theor. Comput. Sci., 2015, vol. 562, pp. 112–121.

    Article  MathSciNet  MATH  Google Scholar 

  6. Tian, H., Zhang, F., and Ren, K., Secure bilinear pairing outsourcing made more efficient and flexible, ASIA CCS’15: Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security, 2015, pp. 417–426.

    Google Scholar 

  7. Chen, X., Li, J., Ma, J., Tang, Q., and Lou, W., New algorithms for secure outsourcing of modular exponentiations, Computer Security–ESORICS 2012: 17th European Symposium on Research in Computer Security, 2012, pp. 541–556.

    Chapter  Google Scholar 

  8. Arabaci, O., Kiraz, M.S., Sertkaya, I., and Uzunkol, O., More efficient secure outsourcing methods for bilinear maps, Cryptol. ePrint Arch., 2016, no. 960.

    Google Scholar 

  9. Joux, A., A one round protocol for tripartite Diffie-Hellman, J. Cryptol., 2004, vol. 17, no. 4, pp. 263–276.

    Article  MathSciNet  MATH  Google Scholar 

  10. Chaum, D. and Antwerpen, van, H., Undeniable signatures, Lect. Notes Comput. Sci., 1990, no. 435, pp. 212–216.

    Article  MATH  Google Scholar 

  11. Lin, X.J., Sun, L., Qu, H., and Zhang, X., New approaches for secure outsourcing algorithm for modular exponentiations, Cryptol. ePrint Arch., 2016, no. 045.

    Google Scholar 

  12. Tian, H., Zhang, F., and Ren, K., Secure bilinear pairing outsourcing made more efficient and flexible, ASIA CCS’15: Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security, 2015, pp. 417–426.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to E. B. Aleksandrova.

Additional information

Original Russian Text © E.B. Aleksandrova, E.N. Shkorkina, 2016, published in Problemy Informatsionnoi Bezopasnosti, Komp’yuternye Sistemy.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Aleksandrova, E.B., Shkorkina, E.N. Tripartite outsoursing key-agreement protocol on bilinear pairings. Aut. Control Comp. Sci. 50, 796–801 (2016). https://doi.org/10.3103/S0146411616080277

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411616080277

Keywords

Navigation