【摘要】 给出了一个基于RSA函数的密封电子拍卖方案,任何投标者不能否认所投的标书,未中标价不会被泄露,可以实现投标者的身份匿名.该方案执行开标算法至多需要「log2p 轮交互,至多「2log2tlog2p 次模乘法运算,其中p是标价的范围,t是RSA公钥.计算量与投标者的数量无关.其典型实现在最坏的情况下只需119次模乘法运算,远高于现有拍卖方案的效率.更多还原

【Abstract】 A new scheme for 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 ?log2 p? rounds of interactions and ?2 log2 t log2 p? 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. In the classical implementation, our scheme requires at most 119 modular multiplications. It is much more efficient than the previous schemes.更多还原