Private Matching Based On IBE And Its Application In Ad Hoc Networks

Agrawal,Evfimievski,and Srikant formally presented a paper that explores the following private matching problem:two parties each have a database and they wish to determine common entries without revealing any information about entries only found in one database.Due to its practical significance,such problems generated significant interest in the research community.The private matching problem is a practical,constrained case of the more general challenge of secure multi-party computation.We first review the background and related work;In order to understand the PM problem more clearly,we introduce more about Secure Multi-Party Computation; And another technical skill:Identity-Based Encryption.Next we study the problem of how to protect users' privacy as well as enforce the protocol's correctness,proposing Identity Based Private Matching Protocol(IBPM).Then we put forward our work to the multiparty setting,the work has morc practical significance.Using the Bloom Filter,we implement IBPM protocol in the multiparty setting.The using of Bloom Filter would return the False Positive Rate, but we can ensure that the probability of getting false positive would be set to very low that could still be useful to a lot of applications.We implement Multiparty Identity Based Private Matching Protocol in Ad hoc Networks.We make some modifications from the original protocol to adapt to Ad hoc Networks.Finally we conclude our work and we also point out a number of additional challenges for future work.