Skip to Main content Skip to Navigation

Verifiable and Private Oblivious Polynomial Evaluation

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02412789
Contributor : Pascal Lafourcade <>
Submitted on : Friday, March 13, 2020 - 11:57:36 PM
Last modification on : Tuesday, March 17, 2020 - 3:48:19 AM

File

Identifiers

  • HAL Id : hal-02412789, version 1

Collections

Citation

Manik Lal Das, Hardik Gajera, Matthieu Giraud, Pascal Lafourcade, David Gerault. Verifiable and Private Oblivious Polynomial Evaluation. International Conference on Information Security Theory and Practice (WISTP'2019). Slides, Dec 2019, Paris, France. ⟨hal-02412789⟩

Share

Metrics

Record views

21

Files downloads

24