A privacy preservation data collection and access control using entropy-based conic curve

Abstract

Because significantly complex crypto procedures such as holomorphic encryption are robotically applied, despite the fact that consumer gadgets under our software circumstances are not, computational overhead is outrageously high. Simply hiding customers with the aid of nameless communications to act to protect the server and adversaries from linking suggestions made with the aid of the same customer makes the traditional method, which computes with the aid of any server based on the amount of provided services, impossible, and customers with charge features widely publicised with the aid of the server cause additional security concerns, impossible. To overcome the above existing drawbacks, this research study presents a Privacy Preservation Data Collection and Access Control Using Entropy-Based Conic Curve. To safeguard the identity of clients and their requests, EBCC employs a unique group signature technic and an asymmetric cryptosystem. First, we ought to implement our EBCC method for data acquisition while maintaining privacy. Second, we consider looking at the properties of secure multiparty computation. EBCC employs lightweight techniques in encryption, aggregation, and decryption, resulting in little computation and communication overhead. Security research suggests that the EBCC is safe, can withstand collision attacks, and can conceal consumer distribution, which is required for fair balance checks in credit card payments. Finally, the results are analysed to illustrate the proposed method performance in addition to the more traditional ABC, AHRPA, ECC, and RSA methods. The proposed work should be implemented in JAVA.