Verifiable and Private Oblivious Polynomial Evaluation - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Verifiable and Private Oblivious Polynomial Evaluation

Résumé

It is a challenging problem to delegate the computation of a polynomial on encrypted data to a server in an oblivious and verifiable way. In this paper, we formally define Verifiable and Private Oblivious Polynomial Evaluation (VPOPE) scheme. We design a scheme called Verifiable IND-CFA Paillier based Private Oblivious Polynomial Evaluation (VIP-POPE). Using security properties of Private Polynomial Evaluation (PPE) schemes and Oblivious Polynomial Evaluation (OPE) schemes, we prove that our scheme is proof unforgeability, indistinguisha-bility against chosen function attack, and client privacy-secure under the Decisional Composite Residuosity assumption in the random oracle model.
Fichier principal
Vignette du fichier
main.pdf (455.14 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-02412789 , version 1 (13-03-2020)

Licence

Paternité

Identifiants

Citer

Manik Lal Das, Hardik Gajera, David Gerault, Matthieu Giraud, Pascal Lafourcade. Verifiable and Private Oblivious Polynomial Evaluation. 13th IFIP International Conference on Information Security Theory and Practice (WISTP), Dec 2019, Paris, France. pp.49-65, ⟨10.1007/978-3-030-41702-4_4⟩. ⟨hal-02412789⟩
162 Consultations
360 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More