IACR News item: 11 April 2015
Paolo D\'Arco, Maria Isabel Gonzalez Vasco, Angel L. Perez del Pozo, Clauido Soriente
ePrint Report- prove that it is impossible to realize an unconditionally secure set intersection protocol (size-hiding or not);
- prove that unconditionally secure size-hiding set intersection is possible in a model where a set up authority provides certain information to the two parties and disappears;
- provide several new computationally secure size-hiding set intersection protocols.
Regarding the latter, in particular we provide a new generic construction without random oracles for the unbalanced setting,
where only the client gets the intersection and hides the size of its set of secrets. The main tool behind this design are smooth projective hash functions for languages derived from perfectly-binding commitments. We stand on the seminal ideas of Cramer-Shoup and Gennaro-Lindell, which have already found applications in several other contexts, such as password-based authenticated key exchange and oblivious transfer.
Additional news items may be found on the IACR news page.