论文信息 - Verifiable Fully Homomorphic Encryption scheme

Verifiable Fully Homomorphic Encryption scheme

We construct a general Verifiable Fully Homomorphic Encryption, using the existed Fully Homomorphic Encryption schemes. The main appeal of the scheme is the verifiability of Evaluate function. Its security and other parameters are based on concrete Fully Homomorphic Encryption scheme.

[1] Craig Gentry,et al. Fully Homomorphic Encryption over the Integers , 2010, EUROCRYPT.

[2] Jonathan Katz,et al. Introduction to Modern Cryptography: Principles and Protocols , 2007 .

[3] Craig Gentry,et al. i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits , 2010, IACR Cryptol. ePrint Arch..

[4] Ivan Damgård,et al. Secure Two-Party Computation with Low Communication , 2012, IACR Cryptol. ePrint Arch..

[5] Mariana Raykova,et al. Outsourcing Multi-Party Computation , 2011, IACR Cryptol. ePrint Arch..

[6] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[7] Craig Gentry,et al. Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.

[8] Yael Tauman Kalai,et al. Improved Delegation of Computation using Fully Homomorphic Encryption , 2010, IACR Cryptol. ePrint Arch..

[9] Vinod Vaikuntanathan,et al. Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages , 2011, CRYPTO.

[10] Vinod Vaikuntanathan,et al. Efficient Fully Homomorphic Encryption from (Standard) LWE , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.