出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：In this paper, we investigate a simple but effective coding mechanism, namely CodingOpportunistically (COPE) [1], and the privacy violations which are likely to happen to COPE.The COPE data, from the source node through the network to its destination node, can be easilylearned by the surrounding nodes, particularly, intersecting nodes and neighbour nodes. Thisleads to a serious consequence in leaking the node identity and its private data. In order to copewith the mentioned issues, we can apply cryptographic schemes. However, the security solutionsoften exploit the public key schemes which nowadays run more slowly and give the longerencrypted values as the effects of the key size increase to guarantee the algorithm complexity.Hence, while the coding mechanism aims to decrease the bandwidth consumption byaggregating (i.e., coding) multiple packets in the network, the security solutions increase thedata quantity. However, a necessary needs of combining data coding mechanism andcryptographic algorithm is raised for both preserving privacy and optimizing bandwidth use atthe same time as mentioned above. In this paper we thus propose SCOPE, a lightweight privacypreserving approach able to support nodes running the COPE protocol in a secret way, byadopting the Elliptic Curve Cryptography (ECC) homomorphic encryption algorithm. Theproposal’s effectiveness and efficiency are proved through a variety of experiments.
