Non-interactive Evaluation of Encrypted Elementary Functions

Author

Chen, Liang ; Gao, Chengmin ; Xu, Yong

Author_Institution

Sch. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou, China

Volume

2

fYear

2009

fDate

18-20 Aug. 2009

Firstpage

45

Lastpage

48

Abstract

Mobile code can be considered composing of functions. Sander et al implemented non-interactive evaluation of encrypted functions(non-interactive EEF) based on homomorphism. But their scheme is limited to encrypting polynomials in positive integer domain. There is no homomorphism that can securely implement non-interactive evaluation of encrypted elementary functions (non-interactive EEEF) in real domain now. In this paper, addition and multiplication homomorphism in real domain based on a modified ElGamal are proposed. Then using Taylor series we expand elementary functions approximately into polynomials, which can be encrypted and computed by the proposed homomorphism non-interactively. Then we implement non-interactive EEEF in real domain.

Keywords

codes; cryptography; polynomials; Taylor series; encrypted elementary function; mobile code; modified ElGamal; multiplication homomorphism; noninteractive evaluation; polynomial encryption; positive integer domain; Computer science; Computer security; Cryptography; Equations; Information security; Large-scale systems; Mobile computing; Polynomials; Resists; Taylor series; Taylor series; homomorphism encryption; mobile code security; non-interactive evaluation of encrypted elementary functions;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Assurance and Security, 2009. IAS '09. Fifth International Conference on

Conference_Location

Xi´an

Print_ISBN

978-0-7695-3744-3

Type

conf

DOI

10.1109/IAS.2009.36

Filename

5283443