Match me if you can: matchmaking encryption and its applications (Q5918327)

A new matchmaking encryption (ME) has been proposed. The proposed scheme is new and interesting to the readers working in the area of research. The decryption process is robust against attacks. The proposed ME opens up new ways of secretly communicating and enables several new applications where both participants can specify fine-grained access policies to encrypted data. Security for ME has been presented theoretically and provides generic frameworks for constructing ME from functional encryption. These constructions require to face the technical challenge of simultaneously checking the policies chosen by S and R to avoid any leakage. The authors constructed an efficient identity-based scheme for equality policies, with provable security in the random oracle model under the bilinear Diffie-Hellman (BDH) assumption over bilinear groups. Implementation and evaluation of the proposed scheme are analyzed and provide experimental evidence construction is practical. The authors apply identity-based ME to a concrete use case to create an anonymous bulletin board over a Tor network.