Efficient computation outsourcing for inverting a class of homomorphic functions

Information Sciences

Volumn 286, Issue , 2014, Pages 19-28

  Zhang, Fangguo ^a   Ma, Xu ^b   Liu, Shengli ^c  

^a SUN YAT SEN UNIVERSITY   (China)

^b GUANGDONG POWER GRID CORPORATION   (China)

^c SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Computation outsourcing; Homomorphic function; Privacy; Security

Indexed keywords

CRYPTOGRAPHY; DATA PRIVACY; MOBILE DEVICES; OUTSOURCING;

CRITICAL PROBLEMS; CRYPTOGRAPHIC COMPUTATIONS; EFFICIENT COMPUTATION; FORMAL SECURITY ANALYSIS; GENERIC CONSTRUCTION; INPUT AND OUTPUTS; INTRINSIC PROPERTY; SECURITY;

COMPUTATIONAL EFFICIENCY;

EID: 84906655458     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2014.07.017     Document Type: Article

References (33)

1. M.J. Atallah, K.B. Frikken, Securely outsourcing linear algebra computations, in: 5th ACM Symposium on InformAtion, Computer and Communications Security - AISACCS 2010, 2010, pp. 48-59.
2. M.J. Atallah, K.N. Pantazopoulos, J.R. Rice, and E.H. Spafford Secure outsourcing of scientific computations Advan. Comp. 54 2001 216 272
3. B. Applebaum, Y. Ishai, E. Kushilevitz, From secrecy to soundness: efficient verification via secure computation, in: The 37th International Colloquium on Automata, Languages and Programming - ICALP 2010, 2010, pp. 152-163.
4. Amazon Elastic Compute Cloud .
5. D.J. Bernstein, T. Lange, Computing small discrete logarithms faster. Cryptology ePrint Archive, 2012 .
6. D. Boneh, E.J. Goh, K. Nissim, Evaluating 2-DNF formulas on ciphertexts, in: Theory of Cryptography-TCC 2005, 2005, pp. 325-341.
7. D. Benjamin and M.J. Atallah, Private and cheating-free outsourcing of algebraic computations, in: Proceedings of 6th Conference on Privacy, Security, and Trust - PST 2008, 2008, pp. 240-245.
8. L. Babai, Trading group theory for randomness, in: Proceedings of the 17th Annual ACM Symposium on Theory of Computing - STOC 1985, ACM, 1985, pp. 421-429.
9. M. Barbosa, P. Farshim, Delegatable homomorphic encryption with applicatoins to secure outsourcing of computation, in: Topics in Cryptology - CT-RSA 2012, LNCS 7178, 2012, pp. 296-312.
10. S. Benabbas, R. Gennaro, Y. Vahlis, Verifiable delegation of computation over large datasets, in: Advances in CryptologyCCRYPTO 2011, LNCS 6841, 2011, pp. 111-131.
11. Elwyn R. Berlekamp, Robert J. McEliece, and Henk C. van Tilborg On the inherent intractability of certain coding problems IEEE Trans. Inform. Theory 24 3 1978 384 386
12. H. Cohen A course in computational algebraic number theory Grad. Tests Math. 138 1996
13. X. Chen, J. Li, J. Ma, Q. Tang, W. Lou, New algorithms for secure outsourcing of modular exponentiations, in: 17th European Symposium on Research in Computer Security -ESORICS 2012, LNCS 7459, 2012, pp. 541-556.
14. K.M. Chung, Y. Kalai, S.P. Vadhan, Improved delegation of computation using fully homomorphic encryption, in: Advances in CryptologyCCRYPTO 2010, LNCS 6223, 2010, pp. 483-501.
15. Certicom ECC Challenge and .
16. F. Emekci, A. Methwally, D. Agrawal, A.E. Abbadi, Dividing secrets to secure data outsourcing, Inform. Sci. 263(1) (2014) 198-210.
17. R. Gennaro, C. Gentry, B. Parno, Non-interactive verifiable computing: computation outsourcing to untrusted workers, in: Advances in CryptologyCCRYPTO 2010, LNCS 6223, 2010, pp. 465-482.
18. M. Green, S. Hohenberger, and B. Waters Outsourcing the decryption of ABE ciphertexts USENIX 2011 2011 34-34
19. C. Gentry, Fully homomorphic encryption using ideal lattices, in: Proceedings of the 41st Annual ACM Symposium on Theory of Computing-STOC 2009, 2009, pp. 169-178.
20. S. Goldwasser, S. Micali, and C. Rackoff The knowledge complexity of interactive proof systems SIAM J. Comput. 18 1 1989 186 208
21. S. Goldwasser, Y.T. Kalai, G.N. Rothblum, Delegating computation: interactive proofs for muggles, in: Proceedings of the 40st Annual ACM Symposium on Theory of Computing-STOC 2008, 2008, pp. 113-122.
22. Seny Kamara, Payman Mohassel, Mariana Raykova, Outsourcing Multi-Party Computation. Cryptology ePrint Archive, 2011 .
23. M. Jakobsson, S. Wetzel, Secure server-aided signature generation, in: Public Key Cryptography - PKC 2001, LNCS 1992, 2001, pp. 383-401.
24. J. Kilian, A note on efficient zero-knowledge proofs and arguments, in: Proceedings of the 24st Annual ACM Symposium on Theory of ComputingSTOC 1992, 1992, pp. 723-732.
25. J. Kilian Improved efficient arguments Advances in CryptologyCCRYPTO 1995, LNCS 963 1995 311 324
26. C.H. Lim, and P.J. Lee More flexible exponentiation with precomputation Advances in CryptologyCCRYPTO 1994, LNCS 839 1994 95 107
27. S. Micali CS proofs (extended abstract) Proceeding of the IEEE Symposium on Foundations of Computer Science, 1994 1994 IEEE Computer Society Press 436 453
28. B. Parno, M. Raykova, V. Vaikuntanathan, How to delegate and verify in public: verifiable computation from attribute-based encryption, in: Theory of Cryptography-TCC 2012, LNCS 7194, 2012, pp. 422-439.
29. C. Papamanthou, Elaine Shi, R. Tamassia, Publicly Verifiable Delegation of Computation, Cryptology ePrint Archive, 2011 .
30. P. Mohassel, Efficient and Secure Delegation of Linear Algebra, Cryptology ePrint Archive, 2011 .
31. A. Sahai, H. Seyalioglu, and B. Waters Dynamic credentials andciphertext delegation for attribute-based encryption Advances in CryptologyC CRYPTO 2012, LNCS 7417 2012 199 217
32. Sun Utility Computing .
33. L. Wei, H. Zhu, Z. Cao, X. Dong, W. Jia, Y. Chen, and A.V. Vasilakos Security and privacy for storage and computation in cloud computing Inform. Sci. 258 2014 371 386