Skip to main content
Springer Nature Link
Log in

Efficient outsourcing schemes of modular exponentiations with checkability for untrusted cloud server

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

Modular exponentiation is one of basic operations among most of current cryptosystems. In previous work, in order to detect the dishonest behavior of cloud servers, modular exponentiations can only be securely outsourced by using two untrusted cloud servers. However, these results cannot resist the collusion attack by the untrusted cloud servers. In this paper, we present two secure outsourcing schemes for modular exponentiations, which enable users to securely outsource modular exponentiations to a single untrusted cloud server and detect the dishonest behavior of untrusted cloud server. The first one is a secure outsourcing scheme for variable base-variable exponent modular exponentiation, while the second is for simultaneous modular exponentiations. Compared with other proposed schemes, our outsourcing schemes are superior in both efficiency and checkability. Moreover, our schemes are secure without any cryptographic assumptions. In addition, we give two applications for our outsourcing schemes, one is to construct an outsourcing scheme for Cramer–Shoup encryptions, and the other is to design an outsourcing scheme for Schnorr signatures.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Ateniese G, Demedeiros B (2004) Identity-based Chameleon hash and applications. In: Proceedings of financial cryptography, LNCS, vol 3110, Springer, Berlin, pp 164–180

  • Brickell E, Gordon D, McCurley K, Wilson D (1992) Fast exponentiation with precomputation. In: Proceedings of advances in cryptology-EUROCRYPT 1992, LNCS, vol 658, Springer, Berlin, pp 200–207

  • Boyko V, Peinado M, Venkatesan R (1998) Speeding up discretelog and factoring based schemes via precomputations. In: Nyberg K (ed) EUROCRYPT 1998, LNCS, vol 1403, Springer, Berlin, pp 221–235

  • Chaum D, Pedersen T (1992) Wallet databases with observers. In: Proceedings of advances in cryptology-CRYPTO’92, LNCS, vol 740, Springer, Berlin, pp 89–105

  • Chevallier-Mames B, Coron J, McCullagh N, Naccache D, Scott M (2010) Secure delegation of elliptic-curve pairing. In: Proceedings of lecture notes computer science, LNCS, vol 6035, Springer, Heidelberg, pp 24–35

  • Chen XF, Li J, Ma J, Tang Q, Lou W (2014) New algorithms for secure outsourcing of modular exponentiations. IEEE Trans Parallel Distrib Syst 9(25):2386–2396

    Article  Google Scholar 

  • Chen XF, Zhang FG, Kim K (2004) Chameleon hashing without key exposure. In: Proceedings of information security, LNCS, vol 3225, Springer, Berlin, pp 87–98

  • Chen XF, Zhang FG, Susilo W, Tian HB, Li J, Kim K (2014a) Identity-based Chameleon hashing and signatures without key exposure. Inf Sci 265:198–210

    Article  Google Scholar 

  • Dijk M, Clarke D, Gassend B, Suh G, Srinivas S (2006) Speeding up exponentiation using an untrusted computational resource. Designs Codes Cryptogr 2(39):253–273

    Article  Google Scholar 

  • Fischlin M, Fischlin R (2009) Efficient non-malleable commitment schemes. J Cryptol 4(22):530–571

    Article  MathSciNet  Google Scholar 

  • Gennaro R (2004) Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacks. In: Proceedings of advances in cryptology-CRYPTO 2004, LNCS, vol 3152, Springer, Berlin, pp 220–236

  • Garay J, MacKenzie P, Yang K (2003) Strengthening zero-knowledge protocols using signatures. In: Proceedings of advances in cryptology-EUROCRYPT 2003, LNCS, vol 2656, Springer, Berlin, pp 177–194

  • Girault M, Lefranc D (2005) Server-aided verification: theory and practice. In: Proceedings of advances in cryptology-ASIACRYPT 2005, LNCS, vol 3788, Springer, Berlin, pp 605–623

  • Hohenbergera S, Lysyanskaya A (2005) How to securely outsource cryptographic computations. In: Proceedings of theory of cryptography, lecture notes in computer science, vol 3378, Springer, Berlin, pp 264–282

  • Jakobsson M, Wetzel S (2001) Secure server-aided signature generation. In: Proceedings of public key cryptography, lecture notes in computer science, vol 1992, Springer, Berlin, pp 383–401

  • Kawaumura S, Shimbo A (1993) Fast server-aided secret computation protocols for modular exponentiation. IEEE J Sel Areas Commun 5(11):778–784. doi:10.1109/49.223880

    Article  Google Scholar 

  • Krawczyk H, Rabin T (2000) Chameleon hashing and signatures. In: Proceedings of the 7th annual network and distributed system security symposium (NDSS), pp 143–154

  • Kiani SL, Anjum A, Antonopoulos N, Knappmeyer M (2014) Context-aware service utilisation in the clouds and energy conservation. J Ambient Intell Humaniz Comput 1(5):111–131. doi:10.1007/s12652-012-0131-1

    Article  Google Scholar 

  • Lim C, Lee P (1994) More flexible exponentiation with precomputation. In: Proceedings of advances in cryptology-CRYPTO 1994, LNCS, vol 839, Springer, Berlin, pp 95–107

  • Li J, Chen XF, Li J, Jia C, Ma J, Lou W (2013) Fine-grained access control based on outsourced attribute-based encryption. In: Proceedings of computer security-ESORICS 2013, LNCS, vol 8134, Springer, Berlin, pp 592–609

  • Li J, Zhang FG, Wang Y (2006) A new hierarchical ID-based cryptosystem and CCA-secure PKE. In: Proceedings of emerging directions in embedded and ubiquitous computing, LNCS, vol 4097, Springer, Berlin, pp 362–371

  • Matsumoto T, Kato K, Imai H (1988) Speeding up secret computations with insecure auxiliary devices. In: Proceedings of crypto’1988, LNCS, vol 403, pp 497–506

  • Ma X, Li J, Zhang FG (2013) Outsourcing computation of modular exponentiations in cloud computing. Clust Comput 4(16):787–796

    Article  Google Scholar 

  • Menezes A, Van Oorschot P, Vanstone S (1996) Handbook of applied cryptography, CRC Press Inc, New York

  • Nguyen PQ, Shparlinski IE, Stern J (2001) Distribution of modular sums and the security of server aided exponentiation. Cryptography and Computational Number Theory, Progress in Computer Science and Applied Logic, vol 20, pp 331–342, Birkhauser Basel

  • De RP (1994) Efficient exponentiation using precomputation and vector addition chanis. In: Proceedings of advances in cryptology-EUROCRYPTO 1994, LNCS, vol 950, Springer, Berlin, pp 389–399

  • Wu W, Mu Y, Susilo W, Huang X (2008) Server-aided verification signatures: definitions and new constructions. In: Proceedings of provable security, LNCS, vol 5324, Springer, Berlin, pp 141–155

  • Xiang C, Tang CM (2014) Verifiable and secure outsourcing scheme of exponentiation and its application in wireless sensor network. Int J Distrib Sens Netw. http://www.hindawi.com/journals/ijdsn/aip/. Accepted 27 Aug 2014

  • Yao C, Xu L, Huang XY, Liu JK (2014) A secure remote data integrity checking cloud storage system from threshold encryption. J Ambient Intell Humaniz Comput 5(6):857–865. doi:10.1007/s12652-014-0236-9

    Article  Google Scholar 

Download references

Acknowledgments

This work is supported in part by the National Natural Science Foundation of China under Grant No. 11271003, the National Research Foundation for the Doctoral Program of Higher Education of China under Grant No. 20134410110003, High Level Talents Project of Guangdong, Guangdong Provincial Natural Science Foundation under Grant No. S2012010009950, the Project of Department of Education of Guangdong Province under Grant No. 2013KJ-CX0146, and the Natural Science Foundation of Bureau of Education of Guangzhou under Grant No. 2012A004.

Author information

Authors and Affiliations

  1. College of Mathematics and Information Science, Guangzhou University, Guangzhou, 510006, China

    Can Xiang & Chunming Tang

  2. Key Laboratory of Mathematics and Interdisciplinary Sciences of Guangdong Higher Education Institutes, Guangzhou University, Guangzhou, 510006, China

    Chunming Tang

  3. State Key Laboratory of Information Security, Beijing, 100093, China

    Chunming Tang

Authors
  1. Can Xiang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Chunming Tang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Chunming Tang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xiang, C., Tang, C. Efficient outsourcing schemes of modular exponentiations with checkability for untrusted cloud server. J Ambient Intell Human Comput 6, 131–139 (2015). https://doi.org/10.1007/s12652-014-0254-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-014-0254-7

Keywords