Fully private auctions in a constant number of rounds

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

Volumn 2742, Issue , 2003, Pages 223-238

  Brandt, Felix ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS;

CRYPTOGRAPHIC AUCTIONS; ELGAMAL ENCRYPTION; IN-DEPTH ANALYSIS; PUBLIC VERIFIABILITY; RANDOM ORACLE MODEL; SELLING PRICES; TRUSTED THIRD PARTIES; UNIFORM PRICE;

CRYPTOGRAPHY;

EID: 35248842111     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45126-6_16     Document Type: Article

References (41)

1. Vickrey, W.: Counter speculation, auctions, and competitive sealed tenders. Journal of Finance 16 (1961) 8-37
2. Rothkopf, M., Teisberg, T., Kahn, E.: Why are Vickrey auctions rare? Journal of Political Economy 98 (1990) 94-109
3. Rothkopf, M., Harstad, R.: Two models of bid-taker cheating in Vickrey auctions. Journal of Business 68 (1995) 257-267
4. Sandholm, T.: Limitations of the Vickrey auction in computational multiagent systems. In: Proceedings of the 2nd International Conference on Multiagent Systems (ICMAS), Menlo Park, CA, AAAI Press (1996) 299-306
5. Brandt, F., Weiß, G.: Vicious strategies for Vickrey auctions. In Müller, J., Andre, E., Sen, S., Frasson, C., eds.: Proceedings of the 5th International Conference on Autonomous Agents, ACM Press (2001) 71-72
6. Brandt, F., Weiß, G.: Antisocial agents and Vickrey auctions. In Meyer, J.J.C., Tambe, M., eds.: Intelligent Agents VIII. Volume 2333 of Lecture Notes in Artificial Intelligence., Springer (2001) 335-347 Revised papers from the 8th Workshop on Agent Theories, Architectures and Languages.
7. Brandt, F.: Cryptographic protocols for secure second-price auctions. In Klusch, M., Zambonelli, F., eds.: Cooperative Information Agents V. Volume 2182 of Lecture Notes in Artificial Intelligence., Springer (2001) 154-165
8. Wurman, P., Walsh, W., Wellman, M.: Flexible double auctions for electronic commerce: Theory and implementation. Decision Support Systems 24 (1998) 17-27
9. Franklin, M., Reiter, M.: The design and implementation of a secure auction service. IEEE Transactions on Software Engineering 22 (1996) 302-312
10. Abe, M., Suzuki, K.: M+1-st price auction using homomorphic encryption. In: Proceedings of the 5th International Conference on Public Key Cryptography (PKC). Volume 2274 of Lecture Notes in Computer Science., Springer (2002) 115-224
11. Abe, M., Suzuki, K.: Receipt-free sealed-bid auction. In: Proceedings of the 1st Information Security Conference (ISC). Volume 2433 of Lecture Notes in Computer Science. (2002) 191-199
12. Baudron, O., Stern, J.: Non-interactive private auctions. In: Proceedings of the 5th Annual Conference on Financial Cryptography (FC). (2001) 300-313
13. Cachin, C.: Efficient private bidding and auctions with an oblivious third party. In: Proceedings of the 6th ACM Conference on Computer and Communications Security. (1999) 120-127
14. Harkavy, M., Tygar, J., Kikuchi, H.: Electronic auctions with private bids. In: Proceedings of the 3rd USENIX Workshop on Electronic Commerce. (1998) 61-74
15. Jakobsson, M., Juels, A.: Mix and match: Secure function evaluation via cipher-texts. In: Proceedings of the 6th Asiacrypt Conference. (2000) 162-177
16. Kikuchi, H.: (M+1)st-price auction protocol. In: Proceedings of the 5th Annual Conference on Financial Cryptography (FC). Volume 2339 of Lecture Notes in Computer Science., Springer (2001) 351-363
17. Kikuchi, H., Harkavy, M., Tygar, J.: Multi-round anonymous auction protocols. In: Proceedings of the 1st IEEE Workshop on Dependable and Real-Time E-Commerce Systems. (1998) 62-69
18. Kikuchi, H., Hotta, S., Abe, K., Nakanishi, S.: Resolving winner and winning bid without revealing privacy of bids. In: Proceedings of the International Workshop on Next Generation Internet (NGITA). (2000) 307-312
19. Kudo, M.: Secure electronic sealed-bid auction protocol with public key cryptography. IEICE Trans. Fundamentals E81-A (1998)
20. Lipmaa, H., Asokan, N., Niemi, V.: Secure Vickrey auctions without threshold trust. In Blaze, M., ed.: Proceedings of the 6th Annual Conference on Financial Cryptography (FC). Volume 2357 of Lecture Notes in Computer Science., Springer (2002)
21. Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proceedings of the 1st ACM Conference on Electronic Commerce. (1999) 129-139
22. Sako, K.: An auction protocol which hides bids of losers. In: Proceedings of the 3rd International Conference on Public Key Cryptography (PKC). Volume 1751 of Lecture Notes in Computer Science., Springer (2000) 422-432
23. Sakurai, K., Miyazaki, S.: A bulletin-board based digital auction scheme with bidding down strategy - towards anonymous electronic bidding without anonymous channels nor trusted centers. In: Proceedings of the International Workshop on Cryptographic Techniques and E-Commerce. (1999) 180-187
24. Song, D., Millen, J.: Secure auctions in a publish/subscribe system. Available at http://www.csl.sri.com/users/millen/ (2000)
25. Viswanathan, K., Boyd, C., Dawson, E.: A three phased schema for sealed bid auction system design. In: Proceedings of the Australasian Conference for Information Security and Privacy (ACISP). Lecture Notes in Computer Science (2000) 412-426
26. Watanabe, Y., Imai, H.: Reducing the round complexity of a sealed-bid auction protocol with an off-line TTP. In: Proceedings of the 7th ACM Conference on Computer and Communications Security, ACM Press (2000) 80-86
27. Sakurai, K., Miyazaki, S.: An anonymous electronic bidding protocol based on a new convertible group signature scheme. In: Proceedings of the 5th Australasian Conference on Information Security and Privacy (ACISP2000). Lecture Notes in Computer Science (2000)
28. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the 20th Annual ACM Symposium on the Theory of Computing (STOC). (1988) 1-10
29. Schnorr, C.P.: Efficient signature generation by smart cards. Journal of Cryptology 4 (1991) 161-174
30. Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Advances in Cryptology - Proceedings of the 12th Annual International Cryptology Conference (CRYPTO). Volume 740 of Lecture Notes in Computer Science., Springer (1992) 3.1-3.6
31. Cramer, R., Damgård, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Advances in Cryptology - Proceedings of the 14th Annual International Cryptology Conference (CRYPTO). Volume 893 of Lecture Notes in Computer Science., Springer (1994) 174-187
32. Brandt, F.: A verifiable, bidder-resolved auction protocol. In Falcone, R., Barber, S., Korba, L., Singh, M., eds.: Proceedings of the 5th International Workshop on Deception, Fraud and Trust in Agent Societies (Special Track on Privacy and Protection with Multi-Agent Systems). (2002) 18-25
33. ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31 (1985) 469-472
34. Tsiounis, Y., Yung, M.: On the security of ElGamal-based encryption. In: Proceedings of the 1st International Workshop on Practice and Theory in Public Key Cryptography (PKC). Volume 1431 of Lecture Notes in Computer Science., Springer (1998) 117-134
35. Brandt, F.: Social choice and preference protection - Towards fully private mechanism design. In: Proceedings of the 4th ACM Conference on Electronic Commerce, ACM Press (2003) to appear.
36. Brandt, F.: Private public choice. Technical Report FKI-247-03, Department for Computer Science, Technical University of Munich (2003)
37. Cramer, R., Damgård, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Advances in Cryptology - Proceedings of the 18th Eurocrypt Conference. Volume 2045 of Lecture Notes in Computer Science., Springer (2001)
38. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Advances in Cryptology - Proceedings of the 16th Eurocrypt Conference. Volume 1592 of Lecture Notes in Computer Science., Springer (1999) 223-238
39. Algesheimer, J., Camenisch, J., Shoup, V.: Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In: Advances in Cryptology - Proceedings of the 22th Annual International Cryptology Conference (CRYPTO). Volume 2442 of Lecture Notes in Computer Science., Springer (2002) 417-432
40. Boneh, D., Franklin, M.: Efficient generation of shared RSA keys. In: Advances in Cryptology - Proceedings of the 17th Annual International Cryptology Conference (CRYPTO). Volume 1294., Springer (1997) 425-439
41. Damgård, I., Koprowski, M.: Practical threshold RSA signatures without a trusted dealer. In: Advances in Cryptology - Proceedings of the 18th Eurocrypt Conference. Volume 2045 of Lecture Notes in Computer Science., Springer (2001) 152-165