Efficient Sealed-Bid Auctions for Massive Numbers of Bidders with Lump Comparison
暂无分享,去创建一个
[1] Moni Naor,et al. Number-theoretic constructions of efficient pseudo-random functions , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[2] Adi Shamir,et al. PayWord and MicroMint: Two Simple Micropayment Schemes , 1996, Security Protocols Workshop.
[3] Kazue Sako,et al. An Auction Protocol Which Hides Bids of Losers , 2000, Public Key Cryptography.
[4] Markus Jakobsson,et al. Proving Without Knowing: On Oblivious, Agnostic and Blindolded Provers , 1996, CRYPTO.
[5] Andrew Chi-Chih Yao,et al. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[6] Hiroaki Kikuchi,et al. Multi-round Anonymous Auction Protocols , 1999 .
[7] Christian Cachin,et al. Efficient private bidding and auctions with an oblivious third party , 1999, CCS '99.
[8] Moni Naor,et al. Oblivious transfer and polynomial evaluation , 1999, STOC '99.
[9] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[10] Moni Naor,et al. Privacy preserving auctions and mechanism design , 1999, EC '99.
[11] Dan Boneh,et al. The Decision Diffie-Hellman Problem , 1998, ANTS.
[12] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.