IACR News item: 30 May 2014
Avradip Mandal, Arnab Roy
ePrint ReportWe develop a relational hash scheme for discovering linear relations among bit-vectors (elements of $\\FF_2^n$) and $\\FF_p$-vectors. Using these linear relational hash schemes we develop relational hashes for detecting proximity in terms of hamming distance. These proximity relational hashing scheme can be adapted to a privacy preserving biometric authentication scheme.
We also introduce the notion of \\emph{relational encryption}, which is a regular semantically secure public key encryption for any adversary which only has access to the public key. However, a semi-trusted entity can be given a relational key using which it can discover relations among ciphertexts, but still cannot decrypt and recover the plaintexts.
Additional news items may be found on the IACR news page.