×

Efficient computation outsourcing for inverting a class of homomorphic functions. (English) Zbl 1355.68079

Summary: The rise of cloud computing and the proliferation of mobile devices make computation outsourcing popular. However, the servers are not fully trusted, and a critical problem is the verifiability and privacy of such computations. Although some computation outsourcing schemes provided a general method, the complicated cryptographic tools involved result in great inefficiency. The existing efficient computation outsourcing schemes however aim only at a specific computation task, lacking in generality. In this paper, we show how to construct a generic outsourcing computation scheme for inverting a class of homomorphic functions with computation disequilibrium. Extensive analysis shows that many cryptographic computations fall into this category. The formal security analysis proves that our scheme satisfies verifiability, input and output privacy in information-theoretic sense. Since the construction of our scheme tactfully takes advantage of the intrinsic property of the computation task being outsourced, no public key operations are used in the scheme, thus our solution clearly outperforms the existing schemes in terms of efficiency. In addition, we instantiate our generic construction with concrete examples, and the experimental result testifies the efficiency of our construction.

MSC:

68P25 Data encryption (aspects in computer science)
94A60 Cryptography

Software:

Amazon EC2
Full Text: DOI

References:

[2] Atallah, M. J.; Pantazopoulos, K. N.; Rice, J. R.; Spafford, E. H., Secure outsourcing of scientific computations, Advan. Comp., 54, 216-272 (2001)
[11] Berlekamp, Elwyn R.; McEliece, Robert J.; van Tilborg, Henk C., On the inherent intractability of certain coding problems, IEEE Trans. Inform. Theory, 24, 3, 384-386 (1978) · Zbl 0377.94018
[12] Cohen, H., A course in computational algebraic number theory, Grad. Tests Math., 138 (1996)
[18] Green, M.; Hohenberger, S.; Waters, B., Outsourcing the decryption of ABE ciphertexts, USENIX 2011 (2011), 34-34
[20] Goldwasser, S.; Micali, S.; Rackoff, C., The knowledge complexity of interactive proof systems, SIAM J. Comput., 18, 1, 186-208 (1989) · Zbl 0677.68062
[25] Kilian, J., Improved efficient arguments, Advances in CryptologyCCRYPTO 1995, LNCS, 963, 311-324 (1995) · Zbl 0876.94030
[26] Lim, C. H.; Lee, P. J., More flexible exponentiation with precomputation, Advances in CryptologyCCRYPTO 1994, LNCS, 839, 95-107 (1994) · Zbl 0939.94537
[27] Micali, S., CS proofs (extended abstract), (Proceeding of the IEEE Symposium on Foundations of Computer Science, 1994 (1994), IEEE Computer Society Press), 436-453
[31] Sahai, A.; Seyalioglu, H.; Waters, B., Dynamic credentials andciphertext delegation for attribute-based encryption, Advances in CryptologyC CRYPTO 2012, LNCS, 7417, 199-217 (2012) · Zbl 1296.94139
[33] Wei, L.; Zhu, H.; Cao, Z.; Dong, X.; Jia, W.; Chen, Y.; Vasilakos, A. V., Security and privacy for storage and computation in cloud computing, Inform. Sci., 258, 371-386 (2014)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.