On the Bringer–Chabanne EPIR protocol for polynomial evaluation
Chee, Yeow Meng
Zhang, Liang Feng
Date of Issue2012
School of Physical and Mathematical Sciences
Extended private information retrieval (EPIR) was defined by Bringer, Chabanne, Pointcheval and Tang at CANS 2007 and generalized by Bringer and Chabanne at AFRICACRYPT 2009. In the generalized setting, EPIR allows a user to evaluate a function on a database block such that the database can learn neither which function has been evaluated nor on which block the function has been evaluated and the user learns no more information on the database blocks except for the expected result. An EPIR protocol for evaluating polynomials over a finite field L was proposed by Bringer and Chabanne in [Lecture Notes in Comput. Sci. 5580, Springer (2009), 305-322]. We show that the protocol does not satisfy the correctness requirement as they have claimed. In particular, we show that it does not give the user the expected result with large probability if one of the coefficients of the polynomial to be evaluated is primitive in L and the others belong to the prime subfield of L.
Journal of mathematical cryptology
© 2012 De Gruyter. This paper was published in Journal of Mathematical Cryptology and is made available as an electronic reprint (preprint) with permission of De Gruyter. The paper can be found at the following official DOI: [http://dx.doi.org/10.1515/jmc-2012-0001]. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law.