Multi-round anonymous auction protocols

IEICE Transactions on Information and Systems

Volumn E82-D, Issue 4, 1999, Pages 769-777

  Kikuchi, Hiroaki ^a   Hakavy, Michael ^c   Tygar, Doug ^b  

^a TOKAI UNIVERSITY   (Japan)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c NONE

Author keywords

Anonymity; Auction; Communication cost; Multiparty computation

Indexed keywords

ANONYMITY; COMMUNICATION COST; MULTI ROUND ANONYMOUS AUCTION PROTOCOLS; MULTIPARTY COMPUTATION;

BANDWIDTH; DIGITAL ARITHMETIC; INTERNET; REAL TIME SYSTEMS;

NETWORK PROTOCOLS;

EID: 0033338140     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. D. Boneh and M. Franklin, "Efficient generation of shared RSA keys," Advances in Cryptology -CRYPTO'97, Springer-Verlag, pp.425-439, 1997.
2. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway, "Security with Low communication overhead," Crytpo '90, pp.62-76, 1990.
3. M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," STOC88, pp.1-10, 1998.
4. D. Beaver, S. Michali, and P. Rogaway, "The round complexity of secure protocols," STOC, pp.503-513, 1990.
5. D. Beaver and S. Goldwasser, "Multiparty computation with faulty majority," Proc. of FOCS, pp.468-473, 1989.
6. D. Chaum, C. Crepeau, and I. Damgard, "Multiparty unconditionally secure protocols," STOC88, pp. 11-19, 1988.
7. D. Chaum, I. Damgard, and J. van de Graaf, "Multiparty computations ensuring privacy of each Party's input and correctness of the result," CRYPTO '87, LNCS 298, pp.87-119, 1987.
8. D. Clark, "Internet cost allocation and pricing," Internet Economics, MIT Press, 1997.
9. D. Chaum, "The dining cryptographer problem: Unconditional sender and receiver untraceability," Journal of Cryptology, vol.1, no.1, pp.65-75, 1988.
10. S. Even, O. Goldreich, and A. Lempel, "A randomized protocol for signing contracts," CACM, vol.28, no.6, pp.637-647, 1985.
11. M.K. Franklin and M.K. Reiter, "The design and implementation of a secure auction service," IEEE Trans. Software Engineering, vol.22, no.5, pp.302-312, 1996.
12. A. Fiat and A. Shamir, "How to prove yourself: Practical solutions to identification and signature problems," Proc. Crypto'86, LNCS 263, pp.186-194, 1986.
13. O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game or a completeness theorem for protocols with honest majority," ACM STOC, pp.218-229, 1987.
14. L. McKnight and J. Bailey, "Internet Economics," MIT Press, 1997.
15. P. Milgrom, "Auctions and bidding: A primer," Journal of Economic Perspectives, vol.3, no.3, pp.3-22, 1989.
16. R.P. McAfee and J. McMillan, "Auctions and bidding," Journal of Economic Literature, vol.25, pp.699-738, 1987.
17. A. Mas-Colell, M.D. Whinston, and J.R. Green, "Microeconomic Theory," Oxford university press, pp.857-925, 1995.
18. T. Rabin and M. Ben-Or, "Verifiable secret sharing and multiparty protocols with honest majority," STOC '89, pp.73-85, 1989.
19. A. Shamir, "How to share a secret," CACM, vol.22, pp.612-613, 1979.
20. A.C. Yao, "Protocols for secure computations," Proc. 27th IEEE Symposium on Foundations of Computer Science, pp.162-167, 1986.