计算机工程
計算機工程
계산궤공정
COMPUTER ENGINEERING
2014年
5期
120-123
,共4页
多拍卖服务器%分布式电子拍卖%密封式拍卖%BIT承诺%LaGrange门限秘密共享%投标者匿名
多拍賣服務器%分佈式電子拍賣%密封式拍賣%BIT承諾%LaGrange門限祕密共享%投標者匿名
다박매복무기%분포식전자박매%밀봉식박매%BIT승낙%LaGrange문한비밀공향%투표자닉명
multiple auction servers%distributed electronic auction%sealed-bid auction%BIT commitment%LaGrange threshold secret sharing%bidder anonymity
电子拍卖是传统拍卖的在线实现，其中，密封式电子拍卖由于其所具有的隐私保护和安全性受到广泛关注，但目前多数方案都是基于存在可信第三方假设的，而实际中很难建立可信的第三方。为此，基于LaGrange门限秘密共享体制和BIT承诺方法，设计一种多服务器参与的分布式电子拍卖方案。在投标阶段，投标者基于LaGrange门限秘密共享方案将投标结果分别提供给不同的拍卖服务器；在开标阶段，由不少于一定阈值的服务器提交结果，并基于 BIT 承诺方法得出最终投标者。该方案可避免单服务器的单点瓶颈，同时保护用户隐私，规定只有成功投标者的身份和投标价格才能被揭示。安全性和效率分析结果表明，该方案满足一个安全电子拍卖方案的要求，同时能节省计算开销和通信开销。
電子拍賣是傳統拍賣的在線實現，其中，密封式電子拍賣由于其所具有的隱私保護和安全性受到廣汎關註，但目前多數方案都是基于存在可信第三方假設的，而實際中很難建立可信的第三方。為此，基于LaGrange門限祕密共享體製和BIT承諾方法，設計一種多服務器參與的分佈式電子拍賣方案。在投標階段，投標者基于LaGrange門限祕密共享方案將投標結果分彆提供給不同的拍賣服務器；在開標階段，由不少于一定閾值的服務器提交結果，併基于 BIT 承諾方法得齣最終投標者。該方案可避免單服務器的單點瓶頸，同時保護用戶隱私，規定隻有成功投標者的身份和投標價格纔能被揭示。安全性和效率分析結果錶明，該方案滿足一箇安全電子拍賣方案的要求，同時能節省計算開銷和通信開銷。
전자박매시전통박매적재선실현，기중，밀봉식전자박매유우기소구유적은사보호화안전성수도엄범관주，단목전다수방안도시기우존재가신제삼방가설적，이실제중흔난건립가신적제삼방。위차，기우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.
