Cryptanalysis of Chosen Symmetric Homomorphic Schemes
作者： Damian Vizár , Serge Vaudenay
DOI: 10.1556/012.2015.52.2.1311
关键词:
摘要: … To define an encryption scheme E, which is homomorphic in … Once we have computed H modulo p, we can “lift” it to a solution … , that in Algorithm 3.1 we need to solve the linear system …
core.ac.uk 
sci-hub.se 参考文章(15)
Dan Boneh, Craig Gentry, A fully homomorphic encryption scheme Stanford University. ,(2009)
Yacov Yacobi, Ernest F. Brickell, On privacy homomorphisms theory and application of cryptographic techniques. pp. 117- 125 ,(1987)
Ronald L Rivest, Len Adleman, Michael L Dertouzos, ON DATA BANKS AND PRIVACY HOMOMORPHISMS ,(1978)
Zvika Brakerski, Vinod Vaikuntanathan, Fully homomorphic encryption from ring-LWE and security for key dependent messages international cryptology conference. pp. 505- 524 ,(2011) , 10.1007/978-3-642-22792-9_29
Zvika Brakerski, Craig Gentry, Shai Halevi, Packed Ciphertexts in LWE-Based Homomorphic Encryption Public-Key Cryptography – PKC 2013. pp. 1- 13 ,(2013) , 10.1007/978-3-642-36362-7_1
A. C.-F. Chan, Symmetric-Key Homomorphic Encryption for Encrypted Data Processing international conference on communications. pp. 774- 778 ,(2009) , 10.1109/ICC.2009.5199505
Craig Gentry, Fully homomorphic encryption using ideal lattices Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09. pp. 169- 178 ,(2009) , 10.1145/1536414.1536440
Caroline Fontaine, Fabien Galand, A Survey of Homomorphic Encryption for Nonspecialists Eurasip Journal on Information Security. ,vol. 2007, pp. 15- ,(2007) , 10.1155/2007/13801
Don Coppersmith, Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities Journal of Cryptology. ,vol. 10, pp. 233- 260 ,(1997) , 10.1007/S001459900030
C. Castelluccia, E. Mykletun, G. Tsudik, Efficient aggregation of encrypted data in wireless sensor networks international conference on mobile and ubiquitous systems: networking and services. pp. 109- 117 ,(2005) , 10.1109/MOBIQUITOUS.2005.25