Homomorphic secret sharing for low degree polynomials

Russell W.F. Lai*, Giulio Malavolta, Dominique Schröder

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

16 Citations (Scopus)

Abstract


Original languageEnglish
Title of host publicationAdvances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
EditorsThomas Peyrin, Steven Galbraith
PublisherSpringer
Pages279-309
Number of pages31
ISBN (Print)9783030033316
DOIs
Publication statusPublished - 2018
MoE publication typeA4 Conference publication
EventInternational Conference on the Theory and Application of Cryptology and Information Security - Brisbane, Australia
Duration: 2 Dec 20186 Dec 2018
Conference number: 24

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11274 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on the Theory and Application of Cryptology and Information Security
Abbreviated titleASIACRYPT
Country/TerritoryAustralia
CityBrisbane
Period02/12/201806/12/2018

Funding

This kind of operations is supported by the encryption scheme since it is linearly homomorphic. Let I1 ⊂ {1, 2}3 be the set of valid indices for the server S1, let I2 := {1, 2}3 \ I1 be the set for S2, and let mi be the monomial indexed by the i-th set of indices. Exploiting the homomorphic properties of the encryption scheme each server computes This research is based upon work supported by the German research foundation (DFG) through the collaborative research center 1223, by the German Federal Ministry of Education and Research (BMBF) through the project PROMISE (16KIS0763), and by the state of Bavaria at the Nuremberg Campus of Technology (NCT). NCT is a research cooperation between the Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU) and the Technische Hochschule Nürnberg Georg Simon Ohm (THN).

Cite this