A Decentralized Private Data Transaction Pricing and Quality Control Method
- Publication Type:
- Conference Proceeding
- IEEE International Conference on Communications, 2019, 2019-May
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2019 IEEE. In the past few years, it has become increasingly popular to analyze the information obtained to develop services by conducting a decentralized survey of private data for specific populations. Privacy security requirements for data providers force operators to implement reasonable privacy protections. But increasing the investment in privacy protection will also lead to a decline in operator revenue. In this case, operators need to ensure the privacy and security requirements of users while ensuring the sustainability of customized services. To this end, We study the relationship between collecting data quality and operator strategy, quantifying the price of private data, and building a model to maximize operator profitability. Specifically, closed-form solutions for best privacy data prices and subscription fees are designed to maximize the gross profit of service providers. Also includes the collection of data quality factors to ensure that the user perceived quality of service can be guaranteed to a certain extent. Finally, we explored the relationship between spending, subscription fees, and maximum gross profit of carriers during the data collection phase, based on the distribution of different user groups' privacy attitudes. In particular, we also explored the relationship between adding additional noise and collecting data utility in a decentralized privacy protection scenario. The simulation results show that compared with the existing methods, the algorithm can maximize the collected data quality while ensuring the provider's privacy security requirements. In addition, we demonstrate the benefits of our dynamic pricing approach and its applicability to other private data pricing algorithms.
Please use this identifier to cite or link to this item: