Obfuscating Many-to-one Functional Re-encryption, and its Connection to Fully-Homomorphic Encryption
نویسندگان
چکیده
Following up on its first construction by Gentry (STOC 2009), fully-homomorphic encryption (FHE) has generated a multitude of different works, seeking both for new theoretical approaches as well as for more efficient instantiations. All existing FHE schemes, however, are tightly connected to specific assumptions, and no generic constructions are known. In this paper, we investigate generic constructions of FHE. Specifically, we introduce a new primitive, called Many-to-One Functional Re-encryption, which allows, given multiple messages encrypted under a public key for one encryption scheme, to produce an encryption of a function of these messages under another key— possibly for a different encryption scheme. We introduce a new notion of obfuscation for many-to-one functional re-encryption, and show that such obfuscation yields a generic transformation from a semantically-secure encryption scheme to leveled FHE. We further demonstrate that existing FHE schemes (both those that employ bootstrapping and relinearization) can be viewed as instantiations of this paradigm.
منابع مشابه
SESOS: A Verifiable Searchable Outsourcing Scheme for Ordered Structured Data in Cloud Computing
While cloud computing is growing at a remarkable speed, privacy issues are far from being solved. One way to diminish privacy concerns is to store data on the cloud in encrypted form. However, encryption often hinders useful computation cloud services. A theoretical approach is to employ the so-called fully homomorphic encryption, yet the overhead is so high that it is not considered a viable s...
متن کاملRe-encryption, Functional Re-encryption, and Multi-hop Re-encryption: A Framework for Achieving Obfuscation-Based Security and Instantiations from Lattices
In this work we define multiple relaxations to the definition of correctness in secure obfuscation. While still remaining meaningful, these relaxations provide ways to obfuscate many primitives in a more direct and efficient way. In particular, we first show how to construct a secure obfuscator for the re-encryption primitive from the Decisional Learning with Errors (DLWE) assumption, without g...
متن کاملOn the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption
We investigate the relationship between Functional Encryption (FE) and Fully Homomorphic Encryption (FHE), demonstrating that, under certain assumptions, a Functional Encryption scheme supporting evaluation on two ciphertexts implies Fully Homomorphic Encryption. We first introduce the notion of Randomized Functional Encryption (RFE), a generalization of Functional Encryption dealing with rando...
متن کاملKey Resynchronizing in Low Power Wide Area Networks
LPWANs are a class of technologies that have very low power consumption and high range of communication. Along with its various advantages, these technologies also have many limitations, such as low bandwidth, connectionless transmission and low processing power, which has challenged encryption methods in this technologies. One of the most important of these challenges is encryption. The very s...
متن کاملFully Homomorphic Encryption without bootstrapping
Gentry’s bootstrapping technique is the most famous method of obtaining fully homomorphic encryption. In previous work I proposed a fully homomorphic encryption without bootstrapping which has the weak point in the plaintext [1]. In this paper I propose the improved fully homomorphic encryption scheme on non-associative octonion ring over finite field without bootstrapping technique where the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013