VeraGreg: A Framework for Verifiable Privacy-Preserving Data Aggregation

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00331176" target="_blank" >RIV/68407700:21230/18:00331176 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/TrustCom/BigDataSE.2018.00275" target="_blank" >http://dx.doi.org/10.1109/TrustCom/BigDataSE.2018.00275</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/TrustCom/BigDataSE.2018.00275" target="_blank" >10.1109/TrustCom/BigDataSE.2018.00275</a>

Jazyk výsledku

angličtina

Název v původním jazyce

VeraGreg: A Framework for Verifiable Privacy-Preserving Data Aggregation

Popis výsledku v původním jazyce

A lot of effort has been made to devise a scheme for verifiable and privacy-preserving outsourcing of arbitrary computations. However, such schemes rely on Fully Homomorphic Encryption which is still far from practical. In our work, we instead focus solely on encryption schemes with single homomorphic operation, in particular addition. We define a rigorous framework that gives the data originator a possibility to check what values have been incorporated within provided homomorphic aggregate. We also propose a practical scheme that instantiates this framework and prove that it achieves Indistinguishability under Non-Adaptive Chosen Ciphertext Attack (IND-CCA1). The definition of our framework led us further to a straightforward modification of the security notions of Non-Malleability (NM) and Adaptive Chosen Ciphertext Attack (CCA2). Our modification aims at preventing trivial breach which is by principle unavoidable for plain homomorphic encryption. With our enhancement, the notions of security can serve as a novel security goal for any future verifiable homomorphic schemes.

Název v anglickém jazyce

VeraGreg: A Framework for Verifiable Privacy-Preserving Data Aggregation

Popis výsledku anglicky

A lot of effort has been made to devise a scheme for verifiable and privacy-preserving outsourcing of arbitrary computations. However, such schemes rely on Fully Homomorphic Encryption which is still far from practical. In our work, we instead focus solely on encryption schemes with single homomorphic operation, in particular addition. We define a rigorous framework that gives the data originator a possibility to check what values have been incorporated within provided homomorphic aggregate. We also propose a practical scheme that instantiates this framework and prove that it achieves Indistinguishability under Non-Adaptive Chosen Ciphertext Attack (IND-CCA1). The definition of our framework led us further to a straightforward modification of the security notions of Non-Malleability (NM) and Adaptive Chosen Ciphertext Attack (CCA2). Our modification aims at preventing trivial breach which is by principle unavoidable for plain homomorphic encryption. With our enhancement, the notions of security can serve as a novel security goal for any future verifiable homomorphic schemes.

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

N - Vyzkumna aktivita podporovana z neverejnych zdroju

Rok uplatnění

2018

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

2018 17th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/ 12th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE)

ISBN

978-1-5386-4387-7

ISSN

—

e-ISSN

2324-9013

Počet stran výsledku

6

Strana od-do

1820-1825

Název nakladatele

IEEE

Místo vydání

—

Místo konání akce

New York

Datum konání akce

31. 7. 2018

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

WRD - Celosvětová akce

Kód UT WoS článku

000495072100265