Privacy-Preserving Auction for Big Data Trading Using Homomorphic Encryption

 

Abstract:

Cyber-Physical Systems (smart grid, smart transportation, smart cities, etc.), driven by advances in Internet of Things (IoT) technologies, will provide the infrastructure and integration of smart applications to accelerate the generation and collection of big data to an unprecedented scale. As now a fundamental commodity in our current information age, such big data is a crucial key to competitiveness in modern commerce. In this paper, we address the issue of privacy preservation for data auction in CPS by leveraging the concept of homomorphic cryptography and secured network protocol design. Specifically, we propose a generic Privacy-Preserving Auction Scheme (PPAS), in which the two independent entities of Auctioneer and Intermediate Platform comprise an untrusted third-party trading platform. Via the implementation of homomorphic encryption and one-time pad, a winner in the auction process can be determined and all bidding information is disguised. Yet, to further improve the security of the privacy-preserving auction, we additionally propose an Enhanced Privacy-Preserving Auction Scheme (EPPAS) that leverages an additional signature verification mechanism. The feasibilities of both schemes are validated through detailed theoretical analyses and extensive performance evaluations, including assessment of the resilience to attacks. In addition, we discuss some open issues and extensions relevant to our scheme.

Existing System:

The existing auction schemes, we are not only focused on the efficiency and security of the platform, but also the integration of the third-party auction platform as a new concept to satisfy the demands of big data and CPS. Through our experiments, the proposed platform has demonstrated good performance, and through the application of homomorphic encryption, all the private information is encrypted during the auction process, demonstrably protecting both owner and bidder privacy.

Proposed System:

Basic Scheme: We propose a basic scheme denoted as the Privacy-Preserving Auction Scheme (PPAS) to enable auctions with encrypted bids. We provide a detailed description of the designed architecture and algorithms, an analysis of the auction scheme, and evaluate its performance via emulation. • Enhanced Scheme: Based on insights from our analysis of the PPAS scheme, we propose an Enhanced Privacy Preserved Auction Scheme (EPPAS), to improve the security and privacy of the auction. We provide the detailed architecture and algorithms of the improved EPPAS, analysis of the improved auction, and an additional performance evaluation and comparison. The evaluation results demonstrate the effectiveness, efficiency, and security of our proposed EPPAS. • Extension: As the proposed scheme is generic, and a variety of auction rules can be provisioned and more efficient cryptosystems can be applied, we address potential avenues of future research to meet the requirements of different data auctions.

Conclusion:

we have addressed the issue of protecting information privacy during the data auction in the thirdparty auction platform. We have leveraged the concept of homomorphic encryption to design a Privacy-Preserving Auction Scheme (PPAS). In order to carry out a privacypreserving auction, we selected a set of crypto-primitives and designed algorithms in our system to enable the efficiency of the auction process. To further improve the security and resistance to attacks of PPAS, we proposed the Enhanced Privacy-Preserving Auction Scheme (EPPAS). The prototypical system of the auction scheme has been implemented to conduct thorough experimental evaluation. The experimental results demonstrate that our proposed scheme is capable of ensuring the determination of an auction winner with a 100 % correct rate under normal operations and without leakage of private information. In addition, multiple attack scenarios against the auction were investigated and applied in our evaluation, and have been correctly detected and prevented. We also discussed some extensions of our designed system. Our generic framework can be further integrated with other cryptosystems and auction rules to improve the performance and the scope of the data auction.

REFERENCES

[1] R. van der Meulen, “8.4 billion connected ’things’ will be in use in 2017, up 31 percent from 2016,” 2017. [Online]. Available: https://www.gartner.com/newsroom/id/3598917

[2] J. A. Stankovic, “Research directions for the Internet of Things,” IEEE Internet of Things Journal, vol. 1, no. 1, pp. 3–9, Feb 2014.

[3] Q. Yang, D. An, R. Min, W. Yu, X. Yang, and W. Zhao, “Optimal PMU placement based defense against data integrity attacks in smart grid,” IEEE Transactions on Forensics and Information Security (T-IFS), vol. 12, no. 7, pp. 1735–1750, 2017.

[4] J. Lin, W. Yu, X. Yang, Q. Yang, X. Fu, and W. Zhao, “A real-time en-route route guidance decision scheme for transportation-based cyberphysical systems,” IEEE Transactions on Vehicular Technology, vol. 66, no. 3, pp. 2551–2566, March 2017.

[5] J. Lin, W. Yu, N. Zhang, X. Yang, H. Zhang, and W. Zhao, “A survey on Internet of Things: Architecture, enabling technologies, security and privacy, and applications,” IEEE Internet of Things Journal, vol. 4, no. 5, pp. 1125–1142, Oct 2017.

[6] F. Liang, W. Yu, D. An, Q. Yang, X. Fu, and W. Zhao, “A survey on big data market: Pricing, trading and protection,” IEEE Access, vol. 6, pp. 15 132–15 154, 2018.

[7] S. Yu, M. Liu, W. Dou, X. Liu, and S. Zhou, “Networking for big data: A survey,” IEEE Communications Surveys Tutorials, vol. 19, no. 1, pp. 531–549, Firstquarter 2017.

[8] M. Mohammadi, A. I. Al-Fuqaha, S. Sorour, and M. Guizani, “Deep learning for iot big data and streaming analytics: A survey,” CoRR, vol. abs/1712.04301, 2017. [Online]. Available: http://arxiv.org/abs/1712.04301

[9] C. Yi and J. Cai, “Two-stage spectrum sharing with combinatorial auction and stackelberg game in recall-based cognitive radio networks,” IEEE Transactions on Communications, vol. 62, no. 11, pp. 3740–3752, 2014.

[10] F. Wu, Q. Huang, Y. Tao, and G. Chen, “Towards privacy preservation in strategy-proof spectrum auction mechanisms for noncooperative wireless networks,” IEEE/ACM Transactions on Networking (TON), vol. 23, no. 4, pp. 1271–1285, 2015.

[11] Q. Yang, D. An, W. Yu, X. Yang, and X. Fu, “On stochastic optimal bidding strategy for microgrids,” in 2015 IEEE 34th International Performance Computing and Communications Conference (IPCCC), Dec 2015, pp. 1–8.

[12] D. An, Q. Yang, W. Yu, X. Yang, X. Fu, and W. Zhao, “SODA: Strategy-proof online double auction scheme for multimicrogrids bidding,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. PP, no. 99, pp. 1–14, 2017.

[13] V. S. S. Nadendla, S. K. Brahma, and P. K. Varshney, “Optimal spectrum auction design with 2-d truthful revelations under uncertain spectrum availability,” IEEE/ACM Transactions on Networking, vol. 25, no. 1, pp. 420–433, Feb 2017.

[14] Z. Feng, Y. Zhu, Q. Zhang, L. M. Ni, and A. V. Vasilakos, “TRAC: Truthful auction for location-aware collaborative sensing in mobile crowdsourcing,” in IEEE Conference on Computer Communications (INFOCOM), April 2014, pp. 1231–1239.

[15] C. Gentry, “Fully homomorphic encryption using ideal lattices,” in Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing, ser. STOC ’09. New York, NY, USA: ACM, 2009, pp. 169–178.

[16] P. Paillier et al., “Public-key cryptosystems based on composite degree residuosity classes,” in Eurocrypt, vol. 99. Springer, 1999, pp. 223–238.

[17] T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Transactions on Information Theory, vol. 31, no. 4, pp. 469–472, 1985.

[18] A. López-Alt, E. Tromer, and V. Vaikuntanathan, “On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption,” in Proceedings of the forty-fourth annual ACM symposium on Theory of computing. ACM, 2012, pp. 1219–1234.

[19] C. Gentry, A. Sahai, and B. Waters, “Homomorphic encryption from learning with errors: Conceptually-simpler, asymptoticallyfaster, attribute-based,” in Advances in Cryptology–CRYPTO 2013. Springer, 2013, pp. 75–92.

[20] Common Open Research Emulator, http://www.nrl.navy.mil/ itd/ncs/products/core.