期刊文献+

一种保护标价安全的电子拍卖方案 被引量:6

A Practical Electronic Auction with Bids Confidential
下载PDF
导出
摘要 电子拍卖的一个热点问题是保护标价的秘密性,因为存在第三方不可信任或相互勾结·提出了一个实用的保护标价安全的电子拍卖方案,除了中标价以外,它在任何勾结攻击情况下都能保证投标者标价的秘密性,可以公开验证中标价的正确性,效率远远高于最近Brandt提出的方案·其实现只需要O(log2v)轮通信,其中v是标价的范围·投标者注册使用数字签名后能保证协议的不可伪造性、抗重放攻击性和不可否认性·协议中使用零知识证明的安全性保证了系统的鲁棒性· In most of the existing cryptographic auctions, the bidders' bids no longer remain confidential if the third parts collude. However, keeping the bids secret in any case is vital to the bidders because the bids are their true evaluations of the commodities and these evaluations may be their critical secrets. A Practical sealed electronic auction scheme of keeping bidders' bids confidential is proposed. No bid is revealed to anyone except the selling price even there exists serious collusion. Any one can verify that bidders follow the protocol to cast their bids and the winning price is correctly resolved according to opening rules. Also, the scheme is much more efficient than the recent publicly verifiable auctions by Brandt. In its typical implementation, the scheme requires at most O (log2 υ) rounds of communication, where υ is the range of bidding space. Non-forgery, replay-attack resistance and non-repudiation are achieved by the signature with temporary public key after registration by bidders. And the robustness of the system is based on the zero knowledge proof.
出处 《计算机研究与发展》 EI CSCD 北大核心 2006年第1期28-32,共5页 Journal of Computer Research and Development
基金 国家自然科学基金项目(60473027) 陕西省自然科学研究计划基金项目(2003F37)
关键词 密封拍卖 安全多方计算 零知识证明 鲁棒性 sealed auction secure multi-party computation (MPC) zero-knowledge proof (ZKP) robustness
  • 相关文献

参考文献1

二级参考文献11

  • 1伍前红,张键红,王育民.一个高效的匹配协议[J].通信学报,2004,25(8):139-144. 被引量:3
  • 2ABE M, SUZUKI K. M+l-st price auction using homomoqahic encryption[A]. Proceedings of the 5th International Conference on Public Key Cryptography (PKC-02)[C]. Bettin: Slatinger-Verlag, 2002. ll5-124.
  • 3CHIDA K, KOBAYASHI K, MORITA H. Efficient sealed-bid auctions for massive numbers of bidders with lump comparison [A]. Proceedings of the International Information Security Conference (ISC) 2001[C].Berlin: Springer-Verlag, 2001.408-419.
  • 4KIKUCHI H, HOTFA S, ABE K, NAKANISHI S. Resolving winner and winning bid without revealing privacy of bids [A]. Proceedings of the International Workshop on Next Generation Intemet (NGITA)2000[C]. Tokyo: IEEE Press, 2000. 307-312.
  • 5BRANDT E Secure and Private Auctions Without Auctioneers [R].Technical Report FKI-245-02, Instimt fu Informatik, Technische University Muhen, 2002.
  • 6FUJISAKI E, OKAMOTO T. Statistical zero knowledge protocols to prove modular polynomial relations[A]. Proceedings of Cryptology-CRYPTO'97[C]. Berlin: Springer-Verlag, 1997. 16-30.
  • 7Schnorr. Efficient signature generation by smart cards[J]. Journal of Cryptology, 1991, 4(3): 161-174.
  • 8CHAUM D, PEDERSEN T R. Wallet databases with observers [A].Advances in Cryptology-CRYPTO'92[C]. Berlin: Springer-Verlag,1993.89-105.
  • 9WU Q, ZHANG J, WANG Y. Praclical t-out-n oblivious transfer and ils applicafioa[Al. ICICS'03 [C]. Berlin: Spdnger-Verlag, 2003. 226-237.
  • 10YAO A. Protocols for secure computation [A]. Proc of the 23rd IEEE.Symposium on Foundations of Computer Science (FOCS) [C].California, 1982.160-164.

共引文献4

同被引文献64

引证文献6

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部