Check out the new USENIX Web site.

next up previous
Next: Asymptotic efficiency Up: Efficiency Previous: Costs for protocol phases

Example costs

 

Let us assume we have m=4 auctioneers (so t=1, no single auctioneer can cheat or violate privacy), and let tex2html_wrap_inline1840 , so each point is 12 bytes. We will estimate the communication costs (in terms of rounds, messages, and bytes) for two sample auctions. We will assume that all bids must be verified immediately (this maximizes the number of messages needed during bid submission), that the leading digit of the selling price is non-zero (worst-case). Costs will be counted as the total of sent and received for both bytes and messages.

Example 1: Consider the case with n=1000 bidders, V=1024 possible prices, and base c=2 bid encoding (so d=10).

Example 2: Consider the case with n=50 bidders, V=1024 possible prices, and base c=4 bid encoding (so d=5).



next up previous
Next: Asymptotic efficiency Up: Efficiency Previous: Costs for protocol phases



Doug Tygar
Wed Jul 22 10:16:16 EDT 1998