![]() Due to the absence of any concrete path connected by trustful nodes, these types of networks suffer from a number of security issues. There exists no predefined path between the source and destination. Opportunistic networks contain mobile nodes which deliver messages in a hop-by-hop fashion using opportunistic connectivity created due to device proximity. (almost) linear in the number of contacts. Related cryptographic techniques, such as Private Set Intersection and Secret Handshakes, are unsuitable in this context.Įxperimental analysis attests to the practicality of our technique, which achieves computational and communication overhead Treatment of the problem, we define the privacy-protecting contact-hiding property and prove it for our solution, under the RSA assumption in the Random Oracle Model (ROM). We present an efficient and provably secure construction, that (i) prevents arbitrary list manipulationīy means of contact certification, and (ii) guarantees user authentication and revocability. In this paper, we introduce Private Contact Discovery, a novel cryptographic primitive that lets two users, on input their respective contact lists, learn their common contacts Social relationships, want to assess their social proximity by discovering mutual contacts. ![]() ![]() One common problem occurs when two unfamiliar users, in the process of establishing The increasing use of computing devices for social interactions propels the proliferation of online social applications, yet, ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |