On the Existence of Unconditionally Privacy-Preserving Auction Protocols

@article{Brandt2008OnTE,
  title={On the Existence of Unconditionally Privacy-Preserving Auction Protocols},
  author={Felix Brandt and Tuomas Sandholm},
  journal={ACM Trans. Inf. Syst. Secur.},
  year={2008},
  volume={11},
  pages={6:1-6:21}
}
We investigate whether it is possible to preserve privacy in sealed-bid auctions to a maximal extent. In particular, this paper focuses on <it>unconditional full privacy</it>, i.e., privacy that relies neither on trusted third parties (like auctioneers), nor on computational intractability assumptions (like the hardness of factoring). These constraints imply a scenario in which bidders exchange messages according to some predefined protocol in order to jointly determine the auction outcome… CONTINUE READING
Highly Cited
This paper has 39 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

Approximate Privacy: Foundations and Quantification

ACM Trans. Algorithms • 2013
View 13 Excerpts
Highly Influenced

The Hardness of Being Private

2012 IEEE 27th Conference on Computational Complexity • 2012
View 12 Excerpts
Highly Influenced

PS-TRUST: Provably secure solution for truthful double spectrum auctions

IEEE INFOCOM 2014 - IEEE Conference on Computer Communications • 2014
View 3 Excerpts
Highly Influenced

Approximate Privacy: PARs for Set Problems

View 5 Excerpts
Method Support
Highly Influenced

Secure first-price sealed-bid auction scheme

EURASIP J. Information Security • 2017
View 2 Excerpts

References

Publications referenced by this paper.
Showing 1-5 of 5 references