IACR News item: 16 December 2013
SANJIT CHATTERJEE AND M. PREM LAXMAN DAS
ePrint ReportThey defined several security notions for {\\PPE} and studied their relationship. They also proposed a concrete scheme which preserves
the orthogonality of encrypted vectors. The proposed construction is claimed to achieve the strongest security notion
of property preserving encryption, called {\\LoR} security. In this work, we take a critical look at the three security theorems in the context of {\\PPE} from~\\cite{PR12}. In particular, we show
that the Pandey-Rouselakis construction does not even satisfy the weakest notion of security for {\\PPE}. We also note that
their separation results between different notions of security for {\\PPE} stand vacuous in the absence of any concrete example. We fill up this gap in the separation results of~\\cite{PR12} by suggesting an example construction of
{\\PPE}.
Additional news items may be found on the IACR news page.