Non-interactive Evaluation of Encrypted Elementary Functions

摘要：

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.

关键词： mobile code security Taylor series non-interactive evaluation of encrypted elementary functions homomorphism encryption

作者: Liang Chen Chengmin Gao Yong Xu

作者单位: School of Computer Science & Engineering,South China University of Technology,Guangzhou,China;Depart Department of Computer,Guangdong Police College,Guangzhou,China School of Computer Science & Engineering,South China University of Technology,Guangzhou,China

会议类型: 国际会议

会议名称: The Fifth International Conference on Information Assurance and Security(第五届信息保障与安全国际会议)

会议地点: 西安

会议语种:英文

页码: 45-48

在线出版日期: 2009-08-18（万方平台首次上网日期，不代表论文的发表时间）