| 参考文献
［1］Boneh D,Goh E J,Nissim K.Evaluating 2-DNF Formulas on Ciphertexts［C］//Proceedings of the 2nd Theory of Cryptography Conference.Berlin,Germany:Springer,2005:325-341.
［2］Dijk M,Gentry C,Halevi S,et al.Fully Homomorphic Encryption over the Integers［C］//Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques.Berlin,Germany:Springer,2010:24-43.
［3］Gentry C,Halevi S,Vaikuntanathan V.A Simple BGN-type Cryptosystem from LWE［C］//Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques.Berlin,Germany:Springer,2010:506-522.
［4］闰世斗.云计算中认证与隐私保护技术的研究［D］.西安:西安电子科技大学,2011.
［5］Rivest R,Adleman L,Dertouzos M.On Data Banks and Privacy Homomorphisms［J］.Foundations of Secure Computations,1978,76(4):169-179.
［6］Regev O.New Lattice-based Cryptographic Construc-tion［J］.Journal of the ACM,2004,51(6):899-942.
［7］Damagard I,Jurik M.A Generalization,A Simplification and Some Applications of Paillier’s Probabilistic Public-key System［C］//Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography.Berlin,Germany:Springer,2001:119-136.
［8］Regev O.On Lattices,Learning with Errors,Random Linear Codes,and Cryptography［C］//Proceedings of the 37th Annual ACM Symposium on Theory of Computing.New York,USA:ACM Press,2005:84-93.
［9］Sander T,Young A,Yung M.Non-interactive Crypto Computing for NC1［C］//Proceedings of the 40th Annual Symposium on Foundations of Computer Science.Washington D.C.,USA:IEEE Computer Society,1999:554-556.
［10］Gentry C.Fully Homomorphic Encryption Using Ideal Lattices［C］//Proceedings of the 41st Annual ACM Symposium on Theory of Computing.New York,USA:ACM Press,2009:169-178.
［11］Smart P N,Vercauteren F.Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes［C］//Proceedings of the 13th International Con-ference on Pronctice and Theory in Public Key Cryptography.Berlin,Germany:Springer,2010:420-443.
［12］Brakerski Z,Vaikuntanathan V.Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages［C］//Proceedings of the 31st Annual Conference on Advances in Cryptology.Berlin,Germany:Springer,2011:505-524.
［13］Coron J S,Naccache D,Tibouchi M.Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers［C］//Pro-ceedings of the 31st International Conference on Theory and Application of Cryptographic Techniques.Berlin,Germany:Springer,2012:446-464.
［14］Brakerski Z.Fully Homomorphic Encryption Without Modulus Switching from Classical GapSVP［C］//Proceedings of the 32nd Cryptology Conference.Berlin,Germany:Springer,2012:868-886.
［15］Kushilevitz E,Ostrovsky R.Replicationis not Needed:Single Date Base,Computationally-private Information Retrieval［C］//Proceedings of Annual Symposium on Foundations of Computer Science.Washington D.C.,USA:IEEE Press,1997:364-373.
［16］Cachin C,Micali S,Stadler M.Computationally Private Information Retrieval with Polylogarithmic Com-munication［C］//Proceedings of International Con-ference on the Theory and Application of Cryptographic Techniques.Berlin,Germany:Springer,1999:402-444.
［17］Lipmaa H.An Oblivious Transfer Protocol with Log-squared Communication［C］//Proceedings of the 8th International Conference on Information Security.Berlin,Germany:Springer,2005:314-328.
［18］Gentry C.A Fully Homomorphic Encryption From Codes［D］.Palo Alto,USA:Stanford University,2009.
［19］Brakerski Z,Vaikuntanathany V.Efficient Fully Homo-morphic Encryption from (Standard) LWE［C］//Proceedings of the 54th Annual Symposium on Foundations of Computer Science.Washington D.C.,USA:IEEE Press,2011:109-138.
［20］Ajtai M.Generating Hard Instances of the Short Basis Problem［C］//Proceedings of the 26th International Colloquium on Automata,Languages and Programming.Berlin,Germany:Springer,1999:1-9.
编辑顾逸斐 |