Verifiable auctions for online ad exchanges

Sebastian Angel, Michael Walfish

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper treats a critical component of the Web ecosystem that has so far received little attention in our community: ad exchanges. Ad exchanges run auctions to sell publishers' inventory-space on Web pages-to advertisers who want to display ads in those spaces. Unfortunately, under the status quo, the parties to an auction cannot check that the auction was carried out correctly, which raises the following more general question: how can we create verifiability in low-latency, high-frequency auctions where the parties do not know each other? We address this question with the design, prototype implementation, and experimental evaluation of VEX. VEX introduces a technique for efficient, privacy-preserving integer comparisons; couples these with careful protocol design; and adds little latency and tolerable overhead.

Original languageEnglish (US)
Title of host publicationSIGCOMM 2013 - Proceedings of the ACM SIGCOMM 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Pages195-206
Number of pages12
DOIs
StatePublished - 2013
EventACM SIGCOMM 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, SIGCOMM 2013 - Hong Kong, China
Duration: Aug 12 2013Aug 16 2013

Other

OtherACM SIGCOMM 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, SIGCOMM 2013
CountryChina
CityHong Kong
Period8/12/138/16/13

Fingerprint

Ecosystems
Websites
Network protocols

Keywords

  • ad exchanges
  • online advertising
  • verifiable auctions

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture

Cite this

Angel, S., & Walfish, M. (2013). Verifiable auctions for online ad exchanges. In SIGCOMM 2013 - Proceedings of the ACM SIGCOMM 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (pp. 195-206) https://doi.org/10.1145/2486001.2486038

Verifiable auctions for online ad exchanges. / Angel, Sebastian; Walfish, Michael.

SIGCOMM 2013 - Proceedings of the ACM SIGCOMM 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. 2013. p. 195-206.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Angel, S & Walfish, M 2013, Verifiable auctions for online ad exchanges. in SIGCOMM 2013 - Proceedings of the ACM SIGCOMM 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. pp. 195-206, ACM SIGCOMM 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, SIGCOMM 2013, Hong Kong, China, 8/12/13. https://doi.org/10.1145/2486001.2486038
Angel S, Walfish M. Verifiable auctions for online ad exchanges. In SIGCOMM 2013 - Proceedings of the ACM SIGCOMM 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. 2013. p. 195-206 https://doi.org/10.1145/2486001.2486038
Angel, Sebastian ; Walfish, Michael. / Verifiable auctions for online ad exchanges. SIGCOMM 2013 - Proceedings of the ACM SIGCOMM 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. 2013. pp. 195-206
@inproceedings{50f0852986e84ee4915f4bffe138c1e0,
title = "Verifiable auctions for online ad exchanges",
abstract = "This paper treats a critical component of the Web ecosystem that has so far received little attention in our community: ad exchanges. Ad exchanges run auctions to sell publishers' inventory-space on Web pages-to advertisers who want to display ads in those spaces. Unfortunately, under the status quo, the parties to an auction cannot check that the auction was carried out correctly, which raises the following more general question: how can we create verifiability in low-latency, high-frequency auctions where the parties do not know each other? We address this question with the design, prototype implementation, and experimental evaluation of VEX. VEX introduces a technique for efficient, privacy-preserving integer comparisons; couples these with careful protocol design; and adds little latency and tolerable overhead.",
keywords = "ad exchanges, online advertising, verifiable auctions",
author = "Sebastian Angel and Michael Walfish",
year = "2013",
doi = "10.1145/2486001.2486038",
language = "English (US)",
isbn = "9781450320566",
pages = "195--206",
booktitle = "SIGCOMM 2013 - Proceedings of the ACM SIGCOMM 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication",

}

TY - GEN

T1 - Verifiable auctions for online ad exchanges

AU - Angel, Sebastian

AU - Walfish, Michael

PY - 2013

Y1 - 2013

N2 - This paper treats a critical component of the Web ecosystem that has so far received little attention in our community: ad exchanges. Ad exchanges run auctions to sell publishers' inventory-space on Web pages-to advertisers who want to display ads in those spaces. Unfortunately, under the status quo, the parties to an auction cannot check that the auction was carried out correctly, which raises the following more general question: how can we create verifiability in low-latency, high-frequency auctions where the parties do not know each other? We address this question with the design, prototype implementation, and experimental evaluation of VEX. VEX introduces a technique for efficient, privacy-preserving integer comparisons; couples these with careful protocol design; and adds little latency and tolerable overhead.

AB - This paper treats a critical component of the Web ecosystem that has so far received little attention in our community: ad exchanges. Ad exchanges run auctions to sell publishers' inventory-space on Web pages-to advertisers who want to display ads in those spaces. Unfortunately, under the status quo, the parties to an auction cannot check that the auction was carried out correctly, which raises the following more general question: how can we create verifiability in low-latency, high-frequency auctions where the parties do not know each other? We address this question with the design, prototype implementation, and experimental evaluation of VEX. VEX introduces a technique for efficient, privacy-preserving integer comparisons; couples these with careful protocol design; and adds little latency and tolerable overhead.

KW - ad exchanges

KW - online advertising

KW - verifiable auctions

UR - http://www.scopus.com/inward/record.url?scp=84883291210&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883291210&partnerID=8YFLogxK

U2 - 10.1145/2486001.2486038

DO - 10.1145/2486001.2486038

M3 - Conference contribution

AN - SCOPUS:84883291210

SN - 9781450320566

SP - 195

EP - 206

BT - SIGCOMM 2013 - Proceedings of the ACM SIGCOMM 2013 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication

ER -