当前位置: X-MOL 学术Comput. Secur. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Tree Structure-based Improved Blockchain Framework for a Secure Online Bidding System
Computers & Security ( IF 4.8 ) Pub Date : 2021-03-01 , DOI: 10.1016/j.cose.2020.102147
Aaliya Sarfaraz , Ripon K. Chakrabortty , Daryl L. Essam

Abstract The BlockChain (BC) is considered as one of the most exciting developments in information and communication technology in the past decade and is widely known as a crypto intensive phenomenon. Achieving an efficient solution (e.g., decentralization, immutability, security, and transparency) using BC requires a considerable range of factors, such as: scalability, security, and privacy, which have a profound role in determining an overall solution’s performance. Meanwhile, digital auctioning is one of the cornerstones of the modern Internet economy. Many of the existing auctions are open-bid auction systems where all bids are made open to either party. E-auctions rely on human resources, and often require the services of a third-party intermediary, which leads to a high cost in terms of money and time, and there is no guarantee that the third party is trustworthy. Moreover, BC’s efficiency is a big challenge for large databases, particularly when the bidding system encompasses multiple options with geographically dispersed users. To address these issues, this paper proposes a BC-based framework for an open-bid auction system, for which privacy and security constraints are considered with different cryptographic primitives. The novelty of this framework derives from an enhanced approach for integrating BC structures by replacing the original chain structure with a tree structure. Throughout the online world, user privacy is a primary concern, because the electronic environment enables the collection of personal data. Hence this paper proposes a suitable cryptographic protocol for an open-bid auction atop BC. Here, the primary aim is to achieve security and privacy with greater efficiency, which largely depends on the effectiveness of the encryption algorithms used by BC. Essentially this paper considers Elliptic Curve Cryptography (ECC) and a dynamic cryptographic accumulator encryption algorithm to enhance security between auctioneer and bidder. The proposed e-bidding scheme and the findings from this study should foster further growth of BC strategies.

中文翻译:

用于安全在线投标系统的基于树结构的改进区块链框架

摘要 区块链(BC)被认为是过去十年信息和通信技术中最令人兴奋的发展之一,被广泛认为是一种加密密集型现象。使用 BC 实现有效的解决方案(例如,去中心化、不变性、安全性和透明性)需要相当多的因素,例如:可扩展性、安全性和隐私,它们在决定整体解决方案的性能方面具有深远的作用。同时,数字拍卖是现代互联网经济的基石之一。许多现有的拍卖是公开出价拍卖系统,其中所有出价都向任何一方开放。电子拍卖依赖人力资源,往往需要第三方中介的服务,导致金钱和时间成本高,并且不能保证第三方是值得信赖的。此外,BC 的效率对于大型数据库来说是一个很大的挑战,特别是当投标系统包含多个选项且用户在地理上分散时。为了解决这些问题,本文提出了一个基于 BC 的公开竞价拍卖系统框架,该框架考虑了不同密码原语的隐私和安全约束。该框架的新颖之处在于通过用树结构替换原始链结构来集成 BC 结构的增强方法。在整个在线世界中,用户隐私是首要问题,因为电子环境可以收集个人数据。因此,本文为 BC 上的公开竞价拍卖提出了一种合适的加密协议。这里,主要目标是以更高的效率实现安全和隐私,这在很大程度上取决于 BC 使用的加密算法的有效性。本质上,本文考虑了椭圆曲线密码术 (ECC) 和动态密码累加器加密算法,以增强拍卖人和投标人之间的安全性。拟议的电子投标计划和本研究的结果应促进 BC 策略的进一步发展。
更新日期:2021-03-01
down
wechat
bug