一种基于多服务器的分布式电子拍卖方案  

A Distributed Electronic Auction Scheme Based on Multiple Servers

作　　者：刘玉[1] 薛开平[2] 

机构地区：[1]合肥学院管理系,合肥230601 [2]中国科学技术大学电子工程与信息科学系,合肥230027

出　　处：《计算机工程》2014年第5期120-123,共4页Computer Engineering

基　　金：国家自然科学基金资助项目(60903216);安徽省自然科学基金资助项目(090412048);安徽省优秀青年人才基金资助项目(2012SQRW127)

摘　　要：电子拍卖是传统拍卖的在线实现,其中,密封式电子拍卖由于其所具有的隐私保护和安全性受到广泛关注,但目前多数方案都是基于存在可信第三方假设的,而实际中很难建立可信的第三方。为此,基于LaGrange门限秘密共享体制和BIT承诺方法,设计一种多服务器参与的分布式电子拍卖方案。在投标阶段,投标者基于LaGrange门限秘密共享方案将投标结果分别提供给不同的拍卖服务器;在开标阶段,由不少于一定阈值的服务器提交结果,并基于BIT承诺方法得出最终投标者。该方案可避免单服务器的单点瓶颈,同时保护用户隐私,规定只有成功投标者的身份和投标价格才能被揭示。安全性和效率分析结果表明,该方案满足一个安全电子拍卖方案的要求,同时能节省计算开销和通信开销。Electronic auction is online realization of traditional actions. Due to its privacy protection and security, sealed-bid auction scheme attracts widespread attention. However, most of these auction schemes are based on the assumption of existing trusted third party, which is often difficult to be established in fact. Based on LaGrange threshold secret sharing scheme and BIT comment mechanism, a distributed electronic auction scheme with multiple servers is proposed in this paper. In the bidding phase, based on LaGrange threshold secret sharing scheme, the bidder computes fragmentations of the bidding result and separately gives them to different auction servers. In the opening phase, no less than a certain threshold of servers submit their fragmentations. The final success bidder can be verified by BIT commit based method. It not only prevents a single point of bottleneck of a single auction server, but also cuts down auction process computational overhead. The scheme ensures the protection of users’ privacy, only the identity of the final successful bidder and the relative bid price can be revealed. Analysis results of the security and performance show that it satisfies the requirements of a secure electronic auction scheme. Meanwhile, it can reduce the computation and communication overhead.

关 键 词：多拍卖服务器 分布式电子拍卖 密封式拍卖 BIT承诺 LaGrange门限秘密共享 投标者匿名 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]