Security Notions for the VeraGreg Framework and Their Reductions

Result code in 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>

Alternative codes found

RIV/68407700:21240/20:00341148

Result on the web

<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>

Result language

angličtina

Original language name

Security Notions for the VeraGreg Framework and Their Reductions

Original language description

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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

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

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2020

Confidentiality

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

Article name in the collection

ISEA-ISAP 2020

ISBN

978-1-7281-6708-4

ISSN

—

e-ISSN

—

Number of pages

13

Pages from-to

8-20

Publisher name

IEEE Xplore

Place of publication

—

Event location

Guwahati

Event date

Feb 27, 2020

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—