The week's pick
Reseach Article
Verifiable Delegation of Computation through Fully Homomorphic Encryption
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 97 - Number 15 |
| Year of Publication: 2014 |
| Authors: Alpana Vijay, Vijay Kumar Sharma |
10.5120/17087-7544
|
Alpana Vijay, Vijay Kumar Sharma . Verifiable Delegation of Computation through Fully Homomorphic Encryption. International Journal of Computer Applications. 97, 15 ( July 2014), 35-40. DOI=10.5120/17087-7544
Abstract
Delegating or outsourcing of computation is a prominent feature of cloud computing. It can be made secure through fully homomorphic encryption which allows processing of encrypted data. Verifiability of results is essential where a service-provider cannot be trusted. Since it is mostly used by lightweight devices, so mechanisms are required to verify the results of computations efficiently. In this paper protocols for VDoC are discussed, which focus on verification of aspects of computation other than the results, namely depth and complexity of delegated function which are useful when a user wants to verify amount charged by the service provider. A symmetric-key homomorphic scheme for encryption is being used. The protocols have a real-world relevance and the runtime are small enough for practical feasibility.
References
- R. Gennaro, C. Gentry, and B. Parno. "Non-interactive verifiable computing: Outsourcing computation to untrusted workers. " In Tal Rabin, editor, CRYPTO, volume 6223 of Lecture Notes in Computer Science, pages 465-482. Springer, 2010.
- S. Goldwasser, H. Lin and A. Rubinstein. "Delegation of Computation without Rejection Problem from Designated Verifier CS-Proofs. " IACR Cryptology ePrint Archive, 2012:455, 2012.
- D. Fiore and R. Gennaro. "Publicly verifiable delegation of large polynomials and matrix computations, with applications. " IACR Cryptology ePrint Archive, 2012:281, 2012
- Ran Canetti, Ben Riva, Guy N. Rothblum: Two Protocols for Delegation of Computation. Information Theoretic Security - 6th International Conference, ICITS 2012, Montreal, QC, Canada, August 15-17, 2012. Proceedings. Springer 2012 Lecture Notes in Computer Science. pg 37-61
- M. Backes, D. Fiore and R. M. Reischuk. "Verifiable Delegation of Computation on Outsourced Data. " IACR Cryptology ePrint Archive, 2013:469, 2013.
- C. Gentry. "A Fully Homomorphic Encryption scheme. " Dissertation. Sep 2009. Available at https://crypto. stanford. edu/craig/craig-thesis. pdf.
- K. -M. Chung, Y. Kalai, and S. P. Vadhan. "Improved delegation of computation using fully homomorphic encryption. " In T. Rabin, editor, Advances in Cryptology – CRYPTO 2010, volume 6223 of Lecture Notes in Computer Science, pp 483–501, Springer.
- Fangyuan Jin; Yanqin Zhu; Xizhao Luo, "Verifiable Fully Homomorphic Encryption scheme," Consumer Electronics, Communications and Networks (CECNet), 21-23 April 2012 2nd International Conference Proceedings, pp. 743,746.
- M. Barbosa and P. Farshim. "Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation. " Proceedings of The Cryptographers' Track at the RSA Conference 2012, San Francisco, CA, USA, February 27 – March 2, 2012. pg 296-312.
- A. Vijay, T Sharma and R Modi. "Verifiable Delegation of Computation to Untrusted Clouds: Approaches and Open Problems. " 1st Interntaional Conference on Emerging Trends in Engineering and Applied Science, 2013.
- M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan. "Fully homomorphic encryption over the integers", Proceedings of Eurocrypt-10, Lecture Notes in Computer Science, vol 6110,. Springer, pp 24-43, 2010.
Index Terms
Keywords