%0 Conference Proceedings
%T Verifiable and Private Oblivious Polynomial Evaluation
%+ Dhirubhai Ambani Institute of Information and Communication Technology (DA-IICT)
%+ Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS)
%A Lal Das, Manik
%A Gajera, Hardik
%A Gerault, David
%A Giraud, Matthieu
%A Lafourcade, Pascal
%Z Part 3: Cryptography
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 13th IFIP International Conference on Information Security Theory and Practice (WISTP)
%C Paris, France
%Y Maryline Laurent
%Y Thanassis Giannetsos
%I Springer International Publishing
%3 Information Security Theory and Practice
%V LNCS-12024
%P 49-65
%8 2019-12-11
%D 2019
%R 10.1007/978-3-030-41702-4_4
%K Delegation of computation
%K Verifiable computation
%K Private Polynomial Evaluation
%K Oblivious evaluation
%K Privacy
%Z Computer Science [cs]/Cryptography and Security [cs.CR]
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 11
%Z WG 11.2
%2 https://hal.science/hal-02412789/document
%2 https://hal.science/hal-02412789/file/main.pdf
%L hal-02412789
%U https://hal.science/hal-02412789
%~ PRES_CLERMONT
%~ CNRS
%~ LIMOS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC11
%~ IFIP-WISTP
%~ IFIP-WG11-2
%~ IFIP-LNCS-12024
%~ CLERMONT-AUVERGNE-INP
%~ TEST3-HALCNRS