期刊文献+

一个具有最小泄漏的可公开验证M+1电子拍卖 被引量:5

A publicly verifiable (M+1)-st auction with minimal leakage
下载PDF
导出
摘要 目前绝大多数电子拍卖方案中,如果第三方勾结,那么投标者的标价不再保密。但是,对于 M+1 拍卖,在任何情况下保持标价的秘密性是非常重要的,因为标价反映了投标者对商品的真实评价,它们很可能是投标者重要的商业秘密。文章提出这样一种 M+1 拍卖,泄漏的只是中标价,其余标价及其相互关系在任何勾结情况下都是保密的,而且,标价的正确性可以公开验证,方案的效率远远高于最近 Brandt 提出的方案。方案具有兼容性,支持第一价位拍卖、Vickrey 拍卖和一般的 M+1 拍卖。 In the most of existing cryptographic auctions, the bidders’ bids no longer remain confidential if the third parts collude. However, for (M+1)-st auctions, 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 commercial secrets. This paper proposes cryptographic (M+1)-st auctions meeting such requirements. The only leakage is the selling price while the other bids and their relation keep confidential in any collusion. The scheme is more efficient than the recently proposed scheme due to Brandt. Our proposal enjoys compatibility with supporting the first-price auction, Vickrey auction and generic (M+1) -st auction.
出处 《通信学报》 EI CSCD 北大核心 2005年第1期12-16,共5页 Journal on Communications
基金 国家"973"重大基金资助项目(G19990358-01) 国家自然科学基金资助项目(60073052)
关键词 M+1密封拍卖 安全多方计算 零知识证明 隐私保护 M+1)-st auction secure multi-party computation zero-knowledge proof privacy protection
  • 相关文献

参考文献11

  • 1伍前红,朱晓妍,王育民.基于RSA函数的实用电子拍卖方案[J].西安电子科技大学学报,2003,30(6):788-791. 被引量:5
  • 2伍前红,张键红,王育民.一个高效的匹配协议[J].通信学报,2004,25(8):139-144. 被引量:3
  • 3ABE 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.
  • 4CHIDA 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.
  • 5KIKUCHI 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.
  • 6BRANDT E Secure and Private Auctions Without Auctioneers [R].Technical Report FKI-245-02, Instimt fu Informatik, Technische University Muhen, 2002.
  • 7FUJISAKI 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.
  • 8Schnorr. Efficient signature generation by smart cards[J]. Journal of Cryptology, 1991, 4(3): 161-174.
  • 9CHAUM D, PEDERSEN T R. Wallet databases with observers [A].Advances in Cryptology-CRYPTO'92[C]. Berlin: Springer-Verlag,1993.89-105.
  • 10WU Q, ZHANG J, WANG Y. Praclical t-out-n oblivious transfer and ils applicafioa[Al. ICICS'03 [C]. Berlin: Spdnger-Verlag, 2003. 226-237.

二级参考文献12

  • 1SCHNORR C P. Efficient signature generation by smart cards[J]. Journal of Cryptology, 1991, 4(3): 161-174.
  • 2OKAMOTO T. Provably secure and practical identification schemes and corresponding signature schemes[A]. Advances in Cryptology--CRYPTO'92 [C]. Berlin: Springer-verlag, 1993.31-53.
  • 3YAO A. Protocols for secure computations[A]. Proc 23rd IEEE Symposium on Foundations of Computer Science (FOCS'82)[C].IEEE Computer Society, 1982. 160-164.
  • 4YAO A. How to generate and exchange secrets[A]. Proc 27th IEEE Symposium on Foundations of Computer Science (FOCS'86)[C].1986. 162-167.
  • 5SALOMAA A. Public-Key Cryptography[M]. Springer-Verlag, 1990.
  • 6JAKOBSSON M, YUNG M. Proving without knowing: on oblivious, agnostic and blindfolded provers[A]. Advances in Cryptology-CRYPTO'96[C]. 1996. 218-229.
  • 7Fabrice Boudot [EB/OL].http:www.informatik.uni-trier.de/~ley/db/indices/a-tree/b/Boudot:Fabrice.html.
  • 8FUJISAKI E, OKAMOTO T. Statistical zero knowledge protocols to prove modular polynomial relations[A]. Proceedings of CRYPTO'97[C], Berlin, Springer-verlag, 1997.16-30.
  • 9BONEH D. The decision diffie-hellman problem[A]. Third Algorithmic Number Theory Symposium, Volume 1423 of Lecture[C].1993.88-102.
  • 10CHAUM D, EVERTSE J H, GRAAF V D J. An improved protocol for demonstrating possession of discrete logarithm and some generalizations[A]. Proceedings of EUROCRYPT' 87[C]. Berlin: Springer-verlag, 1998. 127-141.

共引文献6

同被引文献49

引证文献5

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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