(Enter summary)
Abstract: We suggest an architecture for executing protocols for auctions and, more generally, mechanism design. Our goal is to preserve the privacy of the inputs of the participants (so that no nonessential information about them is divulged, even a posteriori) while maintaining communication and computational efficiency. We achieve this goal by adding another party - the auction issuer - that generates the programs for computing the auctions but does not take an active part in the protocol. The auction ... (Update)
Cited by: More
A Framework for Analyzing Probabilistic - Protocols And Its
(Correct)
Secure Online English Auctions - Jarrod Trevathan Email
(Correct)
Design Issues For Electronic Auctions - Jarrod Trevathan And (2004)
(Correct)
Active bibliography (related documents): More All
0.5: A Crash Course in Implementation Theory - Jackson (1997)
(Correct)
0.3: Economic Implications of Agent Technology and E-Commerce - Vulkan (1998)
(Correct)
0.3: An Infrastructure for Meta-Auctions - Bornhövd, Cilia, Liebig, Buchmann (2000)
(Correct)
Similar documents based on text: More All
0.7: Lecture 9,10: March 13,20 - Lecturer Christos Papadimitriou
(Correct)
0.7: Bit-Slice Auction Circuit - Kurosawa, Ogata (2002)
(Correct)
0.5: Cost and Trust Issues in On-Line Auctions - Ungar, Parkes, Foster (1998)
(Correct)
Related documents from co-citation: More All
27: The design and implementation of a secure auction service
- Franklin, Reiter - 1995
23: Electronic Auctions with Private Bids
- Harkavy, Tygar et al. - 1998
23: Completeness Theorems for NonCryptographic Fault-Tolerant Distributed Computatio.. (context) - BenOr, Goldwasser et al. - 1988
BibTeX entry: (Update)
M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. In 1st ACM Conf. on Electronic Commerce, pages 129-139. ACM, 1999. http://citeseer.ist.psu.edu/naor99privacy.html More
@inproceedings{ naorprivacy,
author = "Moni Naor and Benny Pinkas and Reuben Sumner",
title = "Privacy Preserving Auctions and Mechanism Design",
pages = "129--139",
url = "citeseer.ist.psu.edu/naor99privacy.html" }
Citations (may not include all citations):
419
How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
326
Non-malleable cryptography
- Dolev, Dwork et al. - 1991
282
A Course in Game Theory (context) - Osborne, Rubinstein - 1994
260
Relations among notions of security for public-key encryptio.. (context) - Bellare, Desai et al. - 1998
254
A practical public key cryptosystem provably secure against ..
- Cramer, Shoup - 1998
250
How to play any mental game (context) - Goldreich, Micali et al. - 1987
214
Incentives in teams (context) - Groves - 1973
197
A Randomized Protocol for Signing Contracts (context) - Even, Goldreich et al. - 1985
174
How to exchange secrets by oblivious transfer (context) - Rabin - 1981
154
Secure Multi-Party Computation
- Goldreich - 1998
137
Algorithmic mechanism design
- Nisan, Ronen - 1999
119
Proofs of partial knowledge and simplified design of witness..
- Cramer, Damgard et al. - 1994
97
Pseudorandomness and Cryptographic Applications (context) - Luby - 1996
95
Limits on the Provable Consequences of One-Way Permutations
- Impagliazzo, Rudich - 1989
78
Auction protocols for decentralized scheduling
- Walsh, Wellman et al. - 1998
75
Economic mechanism design for computerized agents
- Varian - 1995
70
The design and implementation of a secure auction server
- Franklin, Reiter - 1996
69
Flexible double auctions for electronic commerce: theory and..
- Wurman, Walsh et al. - 1998
64
Counter speculation, auctions, and competitive sealed tender.. (context) - Vickrey - 1961
59
Non-interactive oblivious transfer and applications (context) - Bellare, Micali - 1990
53
On minimal models for secure computation
- Feige, Kilian et al. - 1994
47
The round complexity of secure protocols
- Beaver, Micali et al. - 1990
39
Two-Sided Matching : A Study in Game-Theoretic Modeling and .. (context) - Roth, Sotomayor - 1990
39
Generalized Vickrey auctions (context) - MacKie-Mason, Varian - 1994
37
Electronic auctions with private bids
- Harkavy, Tygar et al. - 1999
34
The Stable Marriage Problem : Structure and Algorithms (context) - Gusfield, Irving - 1989
30
Fair on-line auctions without special trusted parties
- Stubblebine, Syverson - 1999
23
Real time issues for Internet auctions
- Wellman, Wurman - 1998
18
Internet auctions (context) - Kumar, Feldman - 1999
17
Efficient private bidding and auctions with an oblivious thi..
- Cachin - 1999
5
Mechanism design for resource bounded agents (context) - Kfir-Dahav, Monderer et al. - 1998
3
Auction on the Internet -- A preliminary study (context) - Chui, Zwick - 1999
3
Internet auctions (context) - Monderer, Tennenholtz - 1998
2
Motives and implementation: on the design of mechanisms to e.. (context) - Glazer, Rubinstein - 1998
1
K-Price auctions (context) - Monderer, Tennenholtz - 1998
1
Protecting the winner: second price vs. ascending bid auctio.. (context) - Engelbrecht-Wiggans, Kahn - 1991
1
Mobile Agents in an Electronic Auction House (context) - Huai, Sandholm - 1999
1
Multiparty pricing of public goods (context) - Clarke - 1971
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC