Skip to main content
SpringerLink
Log in

Using Undeniable Signature on Elliptic Curves to Verify Servers in Outsourced Computations

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

Abstract

When carrying out outsourced cryptographic computations, it is possible not only to have errors in server computations but also to interact with a malicious computing server. In this paper, we propose an undeniable signature protocol adapted for a group of points of elliptic curve. We also present an outsourced algorithm for elliptic curve point multiplication.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.

Similar content being viewed by others

REFERENCES

  1. Ch, R., Rao, K.V., and Vasumathi, D., Identity-based cryptosystem based on tate pairing, Global J. Comput. Sci. Technol., 2016, vol. 16, no. 5.

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

  3. 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.

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

  5. Ren, Y., Dong, M., Niu, Z., and Du, X., Noninteractive verifiable outsourcing algorithm for bilinear pairing with improved checkability, Secur. Commun. Networks, 2017, vol. 2017.

  6. Chaum, D. and Van Antwerpen, H., Undeniable signatures, Conference on the Theory and Application of Cryptology, New York, 1989, pp. 212–216.

  7. Jao, D. and Soukharev, V., Isogeny-based quantum-resistant undeniable signatures, International Workshop on Post-Quantum Cryptography, Cham, 2014, pp. 160–179.

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

  9. Aleksandrova, E.B., Shtyrkina, A.A., and Yarmak, A.V., Elliptic curves generation for isogeny-based cryptosystems, Autom. Control Comput. Sci., 2017, vol. 51, no. 8, pp. 928–935.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Peter the Great St. Petersburg Polytechnic University, 195251, St. Petersburg, Russia

    E. B. Aleksandrova & E. N. Shkorkina

Authors
  1. E. B. Aleksandrova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. N. Shkorkina
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. B. Aleksandrova.

Additional information

Translated by Yu. Kornienko

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Aleksandrova, E.B., Shkorkina, E.N. Using Undeniable Signature on Elliptic Curves to Verify Servers in Outsourced Computations. Aut. Control Comp. Sci. 52, 1160–1163 (2018). https://doi.org/10.3103/S0146411618080023

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords:

Search

Navigation