DocumentCode :
2099005
Title :
The Algebra Homomorphic Encryption Scheme Based on Fermat´s Little Theorem
Author :
Xiang Guangli ; Cui Zhuxiao
Author_Institution :
Sch. of Comput. Sci. & Technol., Wuhan Univ. of Technol., Wuhan, China
fYear :
2012
fDate :
11-13 May 2012
Firstpage :
978
Lastpage :
981
Abstract :
In many cryptographic techniques, Homomorphic encryption has been taken attention widely for its special performance by scholars. Common cryptographic techniques can not directly operate on encrypted data, but homomorphic encryption can do, and the result of the operation is automatically encrypted. Homomorphic encryption will widely have a application fields in secure multiparty computation, electronic voting, secret text search, encrypting e-mail filtering, mobile code. Technology related with homomorphic encryption scheme will be briefly reviewed in this article on the basis of previous studies, and a new operation is defining - similar modular arithmetic that is used to achieve algebra homomorphic encryption shceme on the scope of a rational. Moreover, safety analysis of the shceme has been taken and further research has been pointed out.
Keywords :
algebra; cryptography; Fermat little theorem; algebra homomorphic encryption scheme; cryptographic techniques; e-mail filtering; electronic voting; mobile code; multiparty computation; safety analysis; secret text search; Additives; Algebra; Educational institutions; Encryption; Mobile communication; Algebra Homomorphism; Encryption; Fully Homomorphism; Similar Modular Arithmetic;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication Systems and Network Technologies (CSNT), 2012 International Conference on
Conference_Location :
Rajkot
Print_ISBN :
978-1-4673-1538-8
Type :
conf
DOI :
10.1109/CSNT.2012.208
Filename :
6200781
Link To Document :
بازگشت