Outsourcing computation of modular exponentiations in cloud computing

Cluster Computing

Volumn 16, Issue 4, 2013, Pages 787-796

  Ma, Xu ^a   Li, Jin ^b   Zhang, Fangguo ^a  

^a SUN YAT SEN UNIVERSITY   (China)

^b GUANGZHOU UNIVERSITY   (China)

Author keywords

Cloud computing; Modular exponentiation; Outsourcing computation; Security and privacy

Indexed keywords

CRYPTOGRAPHY; OUTSOURCING;

CRYPTOGRAPHIC OPERATIONS; EMERGING COMPUTING PARADIGM; MODULAR EXPONENTIATION; MODULAR EXPONENTIATIONS; PRE-COMPUTATION; SECURITY AND PRIVACY; STATE-OF-THE-ART ALGORITHMS; SUBSET SUM PROBLEMS;

CLOUD COMPUTING;

EID: 84888824020     PISSN: 13867857     EISSN: 15737543     Source Type: Journal    
DOI: 10.1007/s10586-013-0252-0     Document Type: Article

References (31)

1. Applebaum, B., Ishai, Y., Kushilevitz, E.: From secrecy to soundness: efficient verification via secure computation. In: ICALP 2010, pp. 152-163 (2010).
2. Armbrust, M., Fox, A., Griffith, R., Joseph, A., Katz, R., Konwinski, A., Lee, G., Patterson, D., Rabkin, A., Stoica, I., Zaharia, M.: Above the cloud: a Berkeley view of cloud computing. Berkeley University (2009).
3. Assuncao, M. D., Costanzo, A., Buyya, R.: A cost-benefit analysis of using cloud computing to extend the capacity of clusters. Clust. Comput. 13(3), 335-347 (2010).
4. Atallah, M. J., Frikken, K. B.: Securely outsourcing linear algebra computations. In: AISACCS 2010, pp. 48-59 (2010).
5. Babai, L.: Trading group theory for randomness. In: Proceeding of ACM Symposium on Theory of Computing (STOC), pp. 421-429 (1985).
6. Barbosa, M., Farshim, P.: Delegatable homomorphic encryption with applicatoins to secure outsourcing of computation. In: CT-RSA 2012. LNCS, vol. 7178, pp. 296-312. Springer, Heidelberg (2012).
7. Benabbas, S., Gennaro, R., Vahlis, Y.: Verifiable delegation of computation over large datasets. In: CRYPTO 2011. LNCS, vol. 6841, pp. 111-131. Springer, Heidelberg (2011).
8. Benjamin, D., Atallah, M. J.: Private and cheating-free outsourcing of algebraic computations. In: PST 2008, pp. 240-245 (2008).
9. Boyko, V., Peinado, M.: Speeding up discrete log and factoring based schemes via precomputation. In: EUROCRRYPTO 1998. LNCS, vol. 1403, pp. 221-232. Springer, Heidelberg (1998).
10. Chapman, C., Emmerich, W., Marquez, F. G., Clayman, S., Galis, A.: Software architecture definition for on-demand cloud provisioning. Clust. Comput. 15(2), 79-100 (2012).
11. Chaum, D., Pedersen, T. P.: Wallet database with observers. In: CRYPTO 1992. LNCS, vol. 740, pp. 89-105. Springer, Heidelberg (1993).
12. Chen, X., Li, J., Ma, J., Tang, Q., Lou, W.: New algorithms for secure outsourcing of modular exponentiations. In: ESORICS 2012. LNCS, vol. 7459, pp. 541-556. Springer, Heidelberg (2012).
13. Chung, K. M., Kalai, Y., Vadhan, S. P.: Improved delegation of computation using fully homomorphic encryption. In: CRYPTO 2010. LNCS, vol. 6223, pp. 483-501. Springer, Heidelberg (2010).
14. Coster, M. J., LaMacchia, B. A., Odlyzko, A. M., Schnorr, C. P., Stern, J.: Improved low-density subset sum algorithms. Comput. Complex. 2(2), 111-128 (1992).
15. Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: CRYPTO 2010. LNCS, vol. 6223, pp. 465-482. Springer, Heidelberg (2010).
16. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceeding of ACM Symposium on Theory of Computing (STOC), pp. 169-178 (2009).
17. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186-208 (1989).
18. Goldwasser, S., Kalai, Y. T., Rothblum, G. N.: Delegating computation: interactive proofs for muggles. In: Proceeding of ACM Symposium on Theory of Computing (STOC), pp. 113-122 (2008).
19. Golle, P., Mironov, I.: Uncheatable distributed computation. In: CT-RSA 2001. LNCS, vol. 2020, pp. 425-550. Springer, Heidelberg (2001).
20. Green, M., Hohenberger, S., Waters, B.: Outsourcing the decryption of ABE ciphertexts. In: Proceeding of the USENIX Security Symposium (2011).
21. Hohenbergera, S., Lysyanskaya, A.: How to securely outsource cryptographic computations. In: TCC 2005. LNCS, vol. 3378, pp. 264-282. Springer, Heidelberg (2005).
22. Horowitz, E., Sahni, S.: Computing partitions with applications to the knapsack problem. J. ACM 21(2), 277-292 (1974).
23. Jakobsson, M., Wetzel, S.: Secure server-aided signature generation. In: PKC 2001. LNCS, vol. 1992, pp. 383-401. Springer, Heidelberg (2001).
24. Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: Proceeding of ACM Symposium on Theory of Computing (STOC), pp. 723-732 (1992).
25. Kilian, J.: Improved efficient arguments. In: CRYPTO 1995. LNCS, vol. 963, pp. 311-324. Springer, Heidelberg (1995).
26. Matsumoto, T., Kato, K., Iami, H.: Speeding up secret computations with insecure auxiliary devices. In: CRYPTO 1990. LNCS, vol. 403, pp. 497-506. Springer, Heidelberg (1990).
27. Micali, S.: CS proofs (extended abstract). In: Proceeding of the 35th IEEE Symposium on Foundations of Computer Science, pp. 436-453 (1994).
28. Papamanthou, C., Shi, E., Tamassia, R.: Publicly verifiable delegation of computation. http://eprint. iacr. org/2011/587.
29. Parno, B., Raykova, M., Vaikuntanathan, V.: How to delegate and verify in public: verifiable computation from attribute-based encryption. In: TCC 2012. LNCS, vol. 7194, pp. 422-439 (2012).
30. Sahai, A., Seyalioglu, H., Waters, B.: Dynamic credentials and ciphertext delegation for attribute-based encryption. In: CRYPTO 2012. LNCS, vol. 7417, pp. 199-217. Springer, Heidelberg (2012).
31. Schnorr, C. P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66(1-3), 181-199 (1994).