Homomorphic Data Isolation for Hardware Trojan Protection

The interest in homomorphic encryption/decryption is increasing due to its excellent security properties and operating facilities. It allows operating on data without revealing its content. In this work, we suggest using homomorphism for Hardware Trojan protection. We implement two partial homomorphic designs based on ElGamal encryption/decryption scheme. The first design is a multiplicative homomorphic, whereas the second one is an additive homomorphic. We implement the proposed designs on a low-cost Xilinx Spartan-6 FPGA. Area utilization, delay, and power consumption are reported for both designs. Furthermore, we introduce a dual-circuit design that combines the two earlier designs using resource sharing in order to have minimum area cost. Experimental results show that our dual-circuit design saves 35% of the logic resources compared to a regular design without resource sharing. The saving in power consumption is 20%, whereas the number of cycles needed remains almost the sam

Encrypted statistical machine learning: new privacy preserving methods

We present two new statistical machine learning methods designed to learn on fully homomorphic encrypted (FHE) data. The introduction of FHE schemes following Gentry (2009) opens up the prospect of privacy preserving statistical machine learning analysis and modelling of encrypted data without compromising security constraints. We propose tailored algorithms for applying extremely random forests, involving a new cryptographic stochastic fraction estimator, and na\"{i}ve Bayes, involving a semi-parametric model for the class decision boundary, and show how they can be used to learn and predict from encrypted data. We demonstrate that these techniques perform competitively on a variety of classification data sets and provide detailed information about the computational practicalities of these and other FHE methods.Comment: 39 page

Integrated Security Protocol for Electronic Election System

Electronic election systems are a sensitive application and security is a major concern. This process should be ensured to maintain the integrity and confidentiality of the casted votes and voters authentication before they casts their votes. Besides security, other issues need to be considered such as; simplicity, reliability, convenience, flexibility, mobility and cost. In this paper, an integrated security protocol and a prototype of a web-based electronic election system is proposed by integrating two techniques; the first technique is a new zero knowledge mutual authentication protocol based on Diffie-Hellman (D-H ZKP) key exchange algorithm, to enforce a mutual authentication between the election authority server and the voters and exchange secret key securely. The second technique is homomorphic encryption scheme to encrypt all the votes and perform the calculation of the votes without revealing any information about it to ensure the secrecy of the votes and maintain the confidentiality. The proposed protocol provides secure voting over the Internet and maintains the requirements of the election process. Keywords: E-election, D-H ZKP, Homomorphic Encryption