DeepAI AI Chat
Log In Sign Up

Homomorphic Encryption based on Hidden Subspace Membership

by   Uddipana Dowerah, et al.

In this paper, we propose a leveled fully homomorphic encryption scheme based on multivariate polynomial evaluation. We first identify a decision problem called the Hidden Subspace Membership (HSM) problem and show that it is related to the well-known Learning with Errors (LWE) problem. We show that an adversary against the LWE problem can be translated into an adversary against the HSM problem and on the contrary, solving the HSM problem is equivalent to solving the LWE problem with multiple secrets. We then show that the security of the proposed scheme rely on the hardness of the Hidden Subspace Membership problem. Further, we propose a batch variant of the scheme where multiple plaintext bits can be packed into a single ciphertext.


page 1

page 2

page 3

page 4


A Somewhat Homomorphic Encryption Scheme based on Multivariate Polynomial Evaluation

We propose a symmetric key homomorphic encryption scheme based on the ev...

Efficient Quantum Public-Key Encryption From Learning With Errors

Our main result is a quantum public-key encryption scheme based on the E...

Cryptanalysis of Three Quantum Money Schemes

We investigate the security assumptions behind three public-key quantum ...

Multi-Authority Ciphertext-Policy Attribute Based Encryption With Accountability

Attribute-based encryption (ABE) is a promising tool for implementing fi...

On the security of subspace subcodes of Reed-Solomon codes for public key encryption

This article discusses the security of McEliece-like encryption schemes ...

Shrunk subspaces via operator Sinkhorn iteration

A recent breakthrough in Edmonds' problem showed that the noncommutative...

Fuzzification-based Feature Selection for Enhanced Website Content Encryption

We propose a novel approach that utilizes fuzzification theory to perfor...