![]() ![]() Among the Homomorphic Encryption techniques reviewed were Rivest, Shamir and Adleman (RSA), El Gamal cryptosystem, Goldwasser-Micali cryptosystem, Benaloh cryptosystem, Paillier cryptosystem and Fully Homomorphic Encryption (FHE). Firstly, we identify a Homomorphic Encryption technique that can work best for a spatial search by reviewing literature on Homomorphic Encryption techniques. Homomorphic Encryption and a Distributed Ring algorithm, to ensure data anonymity of both parties involved in a spatial search that is a data provider and a searcher. To achieve this, this paper proposes a protocol that puts into application. Preventing the decryption of data provided while providing aggregated results is the best solution for such scenarios. In another scenario, both the data provider and collector may seek anonymity. ![]() One end may be secure, for example, the one providing data, and yet the other end, for example, the one collecting data, may not be secure. The problem of lack of anonymity and confidentiality can be experienced by those who collect statistical data online as well as those who provide the data. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |