Reducing server trust in private proxy auctions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3184, Issue , 2004, Pages 80-89

  Di Crescenzo, Giovanni ^a   Herranz, Javier ^b   Sáez, Germán ^b  

^a TELCORDIA TECHNOLOGIES   (United States)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AUCTION MODEL; MINIMAL INTERACTIONS; SECURITY PROPERTIES; WINNING BIDS;

COMMERCE;

EID: 35048897968     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30079-3_9     Document Type: Article

References (17)

1. M. Abe and K. Suzuki. M + 1-st Price Auction Using Homomorphic Encryption. Proc. of Public Key Cryptography 2002, Springer-Verlag, LNCS 2274, pp. 115-224 (2002).
2. F. Boudot. Efficient Proofs that a Committed Number Lies in an Interval. Proc. of Eurocrypt'00, Springer-Verlag, LNCS 1807, pp. 431-444 (2000).
3. M. Blum, A. De Santis, S. Micali and G. Persiano. Non-Interactive Zero-Knowledge. SIAM Journal of Computing, vol. 20, no. 6, pp. 1084-1118 (1991).
4. M. Blum, P. Feldman and S. Micali. Non-Interactive Zero-Knowledge and Applications. Proc. of ACM Symposium STOC'88, pp. 103-112 (1988).
5. C. Cachin. Efficient Private Bidding and Auctions with an Oblivious Third Party. Proc. of the ACM Conference CCS'99, pp. 120-127 (1999).
6. A. De Santis, G. Di Crescenzo and G. Persiano. The Knowledge Complexity of Quadratic Residuosity Languages. Theoretical Computer Science, vol. 132, pp. 291-317 (1994).
7. G. Di Crescenzo. Private Selective Payment Protocols. Proc. of Financial Cryptography 2000, Springer-Verlag, LNCS 1962, pp. 72-89 (2000).
8. C. Dwork and M. Naor. Zaps and Their Applications. Proc. of FOCS'00, pp. 283-293 (2000).
9. http://www.ebay.com/
10. S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof-Systems. SIAM Journal on Computing, vol. 18, no. 1, pp. 186-208 (1989).
11. M. Harkavy and D. Tygar. Electronic Auctions with Private Bids. Proc. of 3rd USENIX Workshop on Electronic Commerce, pp. 61-74 (1998).
12. H. Lipmaa. On Diophantine Complexity and Statistical Zero-Knowledge Arguments. Proc. of Asiacrypt'03, Springer-Verlag, LNCS 2894, pp. 398-415 (2003).
13. H. Lipmaa, N. Asokan and V. Niemi. Secure Vickrey Auctions without Threshold Trust. Proc. of Financial Cryptography 2002, (LNCS 2357), pp. 87-101 (2002).
14. M. Naor, B. Pinkas and R. Sumner. Privacy preserving auctions and mechanism design. Proc. of the ACM Conference on Electronic Commerce, pp. 129-139 (1999).
15. K. Sako. An Auction Protocol Which Hides Bids of Losers. Proc. of Public Key Cryptography 2000, Springer-Verlag, LNCS 1751, pp. 422-432 (2000).
16. K. Sakurai and S. Miyazaki. A Bulletin-Board based Digital Auction Scheme with Bidding Down Strategy. Proc. of the International Workshop on Cryptographic Techniques and E-Commerce, CrypTEC'99, City University of Hong Kong Press, pp. 180-187 (1999).
17. S. Stubblebine and P. Syverson. Fair On-line Auctions without Special Trusted Parties. Proc. of Financial Cryptography 1999, Springer-Verlag, LNCS 1648, pp. 230-240 (1999).