Oblivious Multi-variate Polynomial Evaluation

Gerald Gavin 1 Marine Minier 2
2 SWING - Smart Wireless Networking
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
Abstract : n this paper, we propose a protocol for Oblivious Polynomial Evaluation (OPE) considering a multi-variate polynomial. There are two parties, Alice who has a secret multi-variate polynomial f and Bob who has an input x = (x 1,...,x T ). Thus, Bob wants to compute f(x) without any information leakage: Alice learns nothing about x and Bob learns only what can be inferred from f(x). In [4], the authors proposed a solution for this problem using Oblivious Transfer (OT) protocol only. In this paper, we propose efficient OPE protocols for the multi-variate case based upon additive and multiplicative homomorphic encryption schemes defined on the same domain. Our protocol only reveals the number of monomials.
Type de document :
Communication dans un congrès
Bimal K. Roy and Nicolas Sendrier. Progress in Cryptology - INDOCRYPT 2009, Dec 2009, New Delhi, India. 5922, pp.430-442, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-10628-6_28〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00524361
Contributeur : Marine Minier <>
Soumis le : jeudi 7 octobre 2010 - 16:39:08
Dernière modification le : vendredi 20 avril 2018 - 01:27:46

Identifiants

Citation

Gerald Gavin, Marine Minier. Oblivious Multi-variate Polynomial Evaluation. Bimal K. Roy and Nicolas Sendrier. Progress in Cryptology - INDOCRYPT 2009, Dec 2009, New Delhi, India. 5922, pp.430-442, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-10628-6_28〉. 〈inria-00524361〉

Partager

Métriques

Consultations de la notice

655