All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

VeraGreg: A Framework for Verifiable Privacy-Preserving Data Aggregation

The result's identifiers

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

  • Result on the web

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    VeraGreg: A Framework for Verifiable Privacy-Preserving Data Aggregation

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

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

Result continuities

  • Project

  • Continuities

    N - Vyzkumna aktivita podporovana z neverejnych zdroju

Others

  • Publication year

    2018

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    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

  • Number of pages

    6

  • Pages from-to

    1820-1825

  • Publisher name

    IEEE

  • Place of publication

  • Event location

    New York

  • Event date

    Jul 31, 2018

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000495072100265