Verifiable and Private Oblivious Polynomial Evaluation | Zendy

Hardik Gajera | Zendy; Matthieu Giraud | Zendy; David Gérault | Zendy; Manik Lal Das | Zendy; Pascal Lafourcade | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Verifiable and Private Oblivious Polynomial Evaluation

Author(s) -

Hardik Gajera,

Matthieu Giraud,

David Gérault,

Manik Lal Das,

Pascal Lafourcade

Publication year - 2020

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/978-3-030-41702-4_4

Subject(s) - verifiable secret sharing , homomorphic encryption , random oracle , computer science , polynomial , semantic security , scheme (mathematics) , delegate , theoretical computer science , discrete mathematics , oracle , polynomial ring , encryption , public key cryptography , mathematics , computer security , programming language , mathematical analysis , attribute based encryption , set (abstract data type)

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research