Multi-bit homomorphic encryption based on learning with errors over rings
暂无分享,去创建一个
[1] Ron Steinfeld,et al. Faster Fully Homomorphic Encryption , 2010, ASIACRYPT.
[2] Andrej Bogdanov,et al. Homomorphic encryption from codes , 2011, IACR Cryptol. ePrint Arch..
[3] Ronald L. Rivest,et al. ON DATA BANKS AND PRIVACY HOMOMORPHISMS , 1978 .
[4] Oded Regev,et al. On lattices, learning with errors, random linear codes, and cryptography , 2005, STOC '05.
[5] Chris Peikert,et al. On Ideal Lattices and Learning with Errors over Rings , 2010, JACM.
[6] Chris Peikert,et al. On Ideal Lattices and Learning with Errors over Rings , 2010, EUROCRYPT.
[7] Craig Gentry,et al. Fully Homomorphic Encryption over the Integers , 2010, EUROCRYPT.
[8] Chris Peikert,et al. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract , 2009, STOC '09.
[9] Craig Gentry,et al. A Simple BGN-Type Cryptosystem from LWE , 2010, EUROCRYPT.
[10] Vinod Vaikuntanathan,et al. Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages , 2011, CRYPTO.
[11] Michael Schneider,et al. Estimating the Security of Lattice-based Cryptosystems , 2010, IACR Cryptol. ePrint Arch..
[12] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[13] Frederik Vercauteren,et al. Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes , 2010, Public Key Cryptography.
[14] Craig Gentry,et al. Trapdoors for hard lattices and new cryptographic constructions , 2008, IACR Cryptol. ePrint Arch..
[15] Ron Rothblum,et al. Homomorphic Encryption: from Private-Key to Public-Key , 2011, Electron. Colloquium Comput. Complex..