Security Notions for the VeraGreg Framework and Their Reductions

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F20%3A00341148" target="_blank" >RIV/68407700:21230/20:00341148 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/68407700:21240/20:00341148

Výsledek na webu

<a href="https://doi.org/10.1109/ISEA-ISAP49340.2020.234994" target="_blank" >https://doi.org/10.1109/ISEA-ISAP49340.2020.234994</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/ISEA-ISAP49340.2020.234994" target="_blank" >10.1109/ISEA-ISAP49340.2020.234994</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Security Notions for the VeraGreg Framework and Their Reductions

Popis výsledku v původním jazyce

Homomorphic encryption enables computations with encrypted data, however, in its plain form, it does not guarantee that the computation has been performed honestly. For the Fully Homomorphic Encryption (FHE), a verifiable variant emerged soon after the introduction of FHE itself, for a single-operation homomorphic encryption (HE), particular verifiable variant has been introduced recently, called the VeraGreg Framework. In this paper, we identify a weakness of List Non-Malleability as defined for the VeraGreg framework—an analogy to the classical Non-Malleability—and define a stronger variant, which addresses the weakness and which we show not to be strengthenable any more. Next, we suggest a decomposition of the abstract VeraGreg framework, introduce novel notions of security for the resulting components and show some reductions between them and/or their combinations. We conjecture that VeraGreg achieves the strongest (and desirable) security guarantee if and only if its building blocks achieve certain, much more tangible properties. Finally, we suggest a simplification to the original VeraGreg instantiation, which now relies on hardness of particular kind of the famous Shortest Vector Problem for lattices.

Název v anglickém jazyce

Security Notions for the VeraGreg Framework and Their Reductions

Popis výsledku anglicky

Homomorphic encryption enables computations with encrypted data, however, in its plain form, it does not guarantee that the computation has been performed honestly. For the Fully Homomorphic Encryption (FHE), a verifiable variant emerged soon after the introduction of FHE itself, for a single-operation homomorphic encryption (HE), particular verifiable variant has been introduced recently, called the VeraGreg Framework. In this paper, we identify a weakness of List Non-Malleability as defined for the VeraGreg framework—an analogy to the classical Non-Malleability—and define a stronger variant, which addresses the weakness and which we show not to be strengthenable any more. Next, we suggest a decomposition of the abstract VeraGreg framework, introduce novel notions of security for the resulting components and show some reductions between them and/or their combinations. We conjecture that VeraGreg achieves the strongest (and desirable) security guarantee if and only if its building blocks achieve certain, much more tangible properties. Finally, we suggest a simplification to the original VeraGreg instantiation, which now relies on hardness of particular kind of the famous Shortest Vector Problem for lattices.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2020

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

ISEA-ISAP 2020

ISBN

978-1-7281-6708-4

ISSN

—

e-ISSN

—

Počet stran výsledku

13

Strana od-do

8-20

Název nakladatele

IEEE Xplore

Místo vydání

—

Místo konání akce

Guwahati

Datum konání akce

27. 2. 2020

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—