Cryptology ePrint Archive: Report 2012/637

Efficient Methods for Practical Fully Homomorphic Symmetric-key Encrypton, Randomization and Verification

Aviad Kipnis and Eliphaz Hibshoosh

Abstract: We present high performance non-deterministic fully-homomorphic methods for practical randomization of data (over commutative ring), and symmetric-key encryption of random mod-N data (over ring of reidues mod-N) well suited for crypto applications. These methods secure, for example, the multivariate input or the coefficients of a polynomial function running in an open untrusted environment. We show that random plaintext is the sufficient condition for proof of security for the homomorphic encryption. The efficient nature of the methods - one large-numbers multiplication per encryption and six for the product of two encrypted values - motivates and enables the use of low cost collaborative security platforms for crypto applications such as keyed-hash or private key derivation algorithms. Such a platform is comprised of a low-cost and low performance security element supported by an untrusted high performance server running the homomorpic algorithms. The methods employed may also provide enhanced protection for some existing crypto algorithms against certain attacks. Specifically, it is shown how to secure OSS public-key signature against Pollard attack. Further, we demonstrate how the homomorphic randomization of data can offer protection for an AES-key against side-channel attacks. Finally, the methods provide both fault detection and verification of computed-data integrity.

Category / Keywords: secret-key cryptography / Practical homomorphic encryption and randomization, OSS digital signature, HMAC, verification of computation

Date: received 8 Nov 2012

Contact author: akipnis at nds com

Available format(s): PDF | BibTeX Citation

Version: 20121111:161947 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]