CROct 9, 2013

Fully Homomorphic Encryption Scheme with Symmetric Keys

arXiv:1310.2452v13.725 citations
Originality Synthesis-oriented
AI Analysis

This work addresses the need for symmetric-key fully homomorphic encryption, which could benefit applications requiring private data processing in cloud environments, but it appears incremental as it adapts existing matrix-based methods to a symmetric context.

The authors tackled the problem of enabling fully homomorphic encryption with symmetric keys, which is less studied than public-key approaches, and proposed a matrix-based scheme that supports homomorphic evaluation for applications like private cloud data processing.

Homomorphic encryption has largely been studied in context of public key cryptosystems. But there are applications which inherently would require symmetric keys. We propose a symmetric key encryption scheme with fully homomorphic evaluation capabilities. The operations are matrix based, that is the scheme consists of mapping the operations on integers to operations on matrix. We also include a protocol which uses the proposed scheme for private data processing in clouds.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes