Privacy-Preserving Online Sharing Charging Pile Scheme with Different Needs Matching
Zhiyu Huang

TL;DR
This paper proposes a privacy-preserving online sharing scheme for charging piles that uses an improved Paillier encryption to match users with different needs efficiently while protecting user data.
Contribution
It introduces a novel matching mechanism based on homomorphic encryption that enhances efficiency over the original Paillier scheme and ensures user privacy.
Findings
The scheme effectively protects user privacy.
It achieves better efficiency than the original Paillier scheme.
It meets security requirements for data protection.
Abstract
With the development of electric vehicles, more and more electric vehicles have difficulties in parking and charging. One of the reasons is that the number of charging piles is difficult to support the energy supply of electric vehicles, and a large number of private charging piles have a long idle time, so the energy supply problem of electric vehicles can be solved by sharing charging piles. The shared charging pile scheme uses Paillier encryption scheme and improved scheme to effectively protect user data. The scheme has homomorphism of addition and subtraction, and can process information without decryption. However, considering that different users have different needs, the matching is carried out after calculating the needs put forward by users. This scheme can effectively protect users' privacy and provide matching mechanisms with different requirements, so that users can better…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
