Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption
verfasst von : Jonathan Katz, Aishwarya Thiruvengadam, Hong-Sheng Zhou
Erschienen in: Public-Key Cryptography – PKC 2013
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Fully homomorphic encryption (FHE) is a form of public-key encryption that enables arbitrary computation over encrypted data. The past few years have seen several realizations of FHE under different assumptions, and FHE has been used as a building block in many cryptographic applications.
Adaptive security
for public-key encryption schemes is an important security notion proposed by Canetti et al. It is intended to ensure security when encryption is used within an interactive protocol and parties may be
adaptively
corrupted by an adversary during the course of the protocol execution. Due to the extensive applications of FHE to protocol design, it is natural to understand whether adaptively secure FHE is achievable.
In this paper we show two contrasting results in this direction. First, we show that adaptive security is
impossible
for FHE satisfying the (standard)
compactness
requirement. On the other hand, we show a construction of adaptively secure FHE that is not compact, but that does achieve circuit privacy.