摘要
为了实现投标者的身份匿名,给出了一个基于RSA函数的M+1电子拍卖方案,任何投标者不能否认所投的标书,未中标价不会被泄露。该方案执行开标算法至多需要p轮交互,至多2plog2t次模乘法运算,其中p是标价的个数,t是RSA公钥。计算量与投标者的数量无关,方案安全、高效,远高于现有拍卖方案的效率。
Security and privacy are the crucial condition in the seal-auction design. A new scheme for （M＋l）-st electronic sealed-bid auctions based on the RSA function is presented, which preserves losing bids and bidders＇ s anonymous identities. No bidder can repudiate his or her bid. In our scheme, opening bids requires at most p rounds of interactions and 2p logzt modular multiplications where p is the range of bids and t is the RSA public-key. The computational cost is independent of the number of bidders. The scheme is secure and much more efficient than the previous schemes.
出处
《计算机科学》
CSCD
北大核心
2008年第2期107-108,共2页
Computer Science
基金
国家自然科学基金资助项目(60473027)
关键词
电子拍卖
秘密分享
RSA函数
Electronic auction, Secret sharing, RSA function
