Verifiable auctions for online ad exchanges

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

Volumn , Issue , 2013, Pages 195-206

  Angel, Sebastian ^a   Walfish, Michael ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

ad exchanges; online advertising; verifiable auctions

Indexed keywords

AD EXCHANGES; CRITICAL COMPONENT; EXPERIMENTAL EVALUATION; HIGH FREQUENCY HF; ONLINE ADVERTISING; PRIVACY PRESERVING; PROTOTYPE IMPLEMENTATIONS; VERIFIABLE AUCTIONS;

COMMERCE; COMMUNICATION; COMPUTER ARCHITECTURE;

NETWORK ARCHITECTURE;

EID: 84883291210     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2486001.2486038     Document Type: Conference Paper

References (61)

1. Blacks Law Dictionary. 6th edition, 1990.
2. Cookie Matching. http://developers.google.com/ad-exchange/rtb/cookie- guide, Apr. 2013.
3. DoubleClick Ad Exchange Real-Time Bidding Protocol. https://developers. google.com/ad-exchange/rtb/downloads.
4. DoubleClick Bid Request Message. https://developers.google.com/ad- exchange/rtb/downloads/realtime-bidding-proto.txt.
5. DoubleClick Ad Exchange. http://google.com/doubleclick/advertisers/ad- exchange.html.
6. Google Display Network. http://google.com/ads/displaynetwork.
7. Fast SHA-256 implementations on Intel architecture processors. http://download.intel.com/embedded/processor/whitepaper/327457.pdf.
8. Microsoft Media Network. http://advertising.microsoft.com/advertise/ microsoft-media-network.
9. OpenX. http://www.openx.com.
10. PAPI. http://icl.cs.utk.edu/papi/index.html.
11. Rightmedia. http://www.rightmedia.com.
12. Source lines of code counter. https://github.com/bytbox/sloc.
13. Yahoo! Advertising Solutions. http://advertising.yahoo.com.
14. Y. Aumann and Y. Lindell. Security against covert adversaries: Efficient protocols for realistic adversaries. Journal of Cryptology, 23(2):281-343, 2010.
15. H. Beales. The value of behavioral targeting. http://www. networkadvertising.org/pdfs/Beales-NAI-Study.pdf, 2010.
16. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In ACM CCS, Nov. 1993.
17. P. Bogetoft, D. L. Christensen, I. Damgård, M. Geisler, T. Jakobsen, M. Krøigaard, J. D. Nielsen, J. B. Nielsen, K. Nielsen, J. Pagter, M. Schwartzbach, and T. Toft. Secure multiparty computation goes live. In Financial Cryptography and Data Security, Feb. 2009.
18. F. Boudot. Efficient proofs that a committed number lies in an interval. In EUROCRYPT, May 2000.
19. F. Brandt. How to obtain full privacy in auctions. International Journal of Information Security, 5(4):201-216, Oct. 2006. (Pubitemid 44446417)
20. E. Brickell, D. Chaum, I. Damgård, and J. V. de Graaf. Gradual and verifiable release of a secret. In CRYPTO, Aug. 1987.
21. J. Camenisch, R. Chaabouni, and a. shelat. Efficient protocols for set membership and range proofs. In ASIACRYPT, Dec. 2008.
22. R. Chaabouni, H. Lipmaa, and B. Zhang. A non-interactive range proof with constant communication. In Financial Cryptography and Data Security, Feb. 2012.
23. V. Dave, S. Guha, and Y. Zhang. Measuring and fingerprinting clickspam in online ad networks. In ACM SIGCOMM, Aug. 2012.
24. DoubleClick. Search before the purchase: Understanding buyer search activity as it builds to online purchase. http://google.com/doubleclick/ research/index.html, Feb. 2005.
25. DoubleClick. Profiting from non-guaranteed advertising: The value of dynamic allocation and auction pricing for online publishers. http://www.google.com/doubleclick/pdfs/DC-Ad-Exchange-WP-100713.pdf, 2010.
26. DoubleClick. Google white paper: The arrival of real-time bidding and what it means for media buyers. http://google.com/doubleclick/research/index. html, July 2011.
27. E. Elkind and H. Lipmaa. Interleaving cryptography and mechanism design: The case of online auctions. In Financial Cryptography, Feb. 2004.
28. P. Fauzi, H. Lipmaa, and B. Zhang. New non-interactive zero-knowledge subset sum, decision knapsack and range arguments. Cryptology ePrint Archive, Report 2012/548, Feb. 2013.
29. A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In CRYPTO, Nov. 1986.
30. M. K. Franklin and M. K. Reiter. The design and implementation of a secure auction service. In IEEE Symposium on Security and Privacy, May 1995.
31. S. Guha, B. Cheng, and P. Francis. Privad: Practical privacy in online advertising. In NSDI, Mar. 2011.
32. H. Haddadi. Fighting online click-fraud using bluff ads. ACM SIGCOMM CCR, 40(2):22-25, Apr. 2010.
33. A. Haeberlen, P. Kuznetsov, and P. Druschel. PeerReview: Practical accountability for distributed systems. In SOSP, Oct. 2007.
34. M. Harkavy, J. D. Tygar, and H. Kikuchi. Electronic auctions with private bids. In USENIX Workshop on Electronic Commerce, Aug. 1998.
35. A. Juels. Targeted advertising... and privacy too. In RSA Security Conference, The Cryptographers' Track, Apr. 2001.
36. L. Lamport. Password authentication with insecure communication. Communications of the ACM, 24(11):770-772, 1981.
37. H. Lipmaa, N. Asokan, and V. Niemi. Secure Vickrey auctions without threshold trust. In Financial Cryptography, Mar. 2002.
38. S. Meiklejohn, C. C. Erway, A. Küpçü, T. Hinkle, and A. Lysyanskaya. ZKPDL: A language-based system for efficient zero-knowledge proofs and electronic cash. In USENIX Security Symposium, Aug. 2010.
39. S. Muthukrishnan. Ad exchanges: Research issues. In Workshop on Internet and Network Economics. Dec. 2009.
40. M. Naor, B. Pinkas, and R. Summer. Privacy preserving auctions and mechanism design. In ACM Conference on Electronic Commerce, Nov. 1999.
41. K. Q. Nguyen, Y. Mu, and V. Varadharajan. Digital coins based on hash chain. In National Information Systems Security Conference, Oct. 1997.
42. T. Okamoto and J. Stern. Almost uniform density of power residues and the provable security of ESIGN. In ASIACRYPT, Nov. 2003.
43. OpenX. Openx handles more than one trillion ad requests in 2011. http://www.openx.com/content/openx-handles-more-one-trillion-ad-requests-2011, 2011.
44. D. C. Parkes, M. O. Rabin, S. M. Shieber, and C. A. Thorpe. Practical secrecy-preserving, verifiably correct and trustworthy auctions. In International Conference on Electronic Commerce, Aug. 2006.
45. M. O. Rabin, Y. Mansour, S. Muthukrishnan, and M. Yung. Strictly-black-box zero-knowledge and efficient validation of financial transactions. In International Colloquium on Automata, Languages and Programming, July 2012.
46. M. O. Rabin, R. A. Servedio, and C. A. Thorpe. Highly efficient secrecy-preserving proofs of correctness of computations and applications. In IEEE Symposium on Logic in Computer Science, July 2007.
47. A. Reznichenko, S. Guha, and P. Francis. Auctions in do-not-track compliant internet advertising. In ACM CCS, Oct. 2011.
48. N. Singer. Your online attention, bought in an instant. http://www.nytimes.com/2012/11/18/technology/your-online-attention-bought-in-an- instant-by-advertisers. html, Nov. 2012. The New York Times.
49. B. Stone-Gross, R. Stevens, R. Kemmerer, C. Kruegel, G. Vigna, and A. Zarras. Understanding fraudulent activities in online ad exchanges. In IMC, Nov. 2011.
50. K. Suzuki, K. Kobayashi, and H. Morita. Efficient sealed-bid auction using hash chain. In Information Security and Cryptology, Dec. 2000.
51. V. Toubiana, A. Narayanan, D. Boneh, H. Nissenbaum, and S. Barocas. Adnostic: Privacy preserving targeted advertising. In NDSS, Feb. 2010.
52. J. Trevathan and W. Read. Undesirable and fraudulent behavior in online auctions. In SECRYPT, Aug. 2006.
53. V. Vaidya. Cookie synching. http://www.admonsters.com/blog/cookie- synching, Apr. 2010.
54. N. Vratonjic, J. Freudiger, and J.-P. Hubaux. Integrity of the web content: The case of online advertisement. In Workshop on Collaborative Methods for Security and Privacy, Aug. 2010.
55. N. Vratonjic, J. Freudiger, J.-P. Hubaux, and M. Felegyhazi. Securing online advertising. Technical Report LCA-REPORT-2008-017, Laboratory for Computer Communications and Applications, École Polytechnique Fédérale de Lausanne, July 2008.
56. N. Vratonjic, J.-P. Hubaux, M. Raya, and D. C. Parkes. Security games in online advertising: Can ads help secure the web? In Workshop on Economics of Information Security, June 2010.
57. K. Weide. Real-time bidding in the United States and Western Europe, 2010-2015. http://info.pubmatic.com/rs/pubmatic/images/IDC-Real-Time%20Bidding- US-Western%20Europe-Oct2011.pdf, Oct. 2011.
58. B. White, J. Lepreau, L. Stoller, R. Ricci, S. Guruprasad, M. Newbold, M. Hibler, C. Barb, and A. Joglekar. An integrated experimental environment for distributed systems and networks. In OSDI, Dec. 2002.
59. A. C.-C. Yao. How to generate and exchange secrets. In FOCS, Oct. 1986.
60. ZenithOptimedia. Quadrennial events to help ad market grow in 2012 despite economic troubles. http://www.zenithoptimedia.com/about-us/press- releases/zenithoptimedia-adspend-forecast-update-dec-2011, Dec. 2011.
61. M. Zhao, W. Zhou, A. J. Gurney, A. Haeberlen, M. Sherr, and B. T. Loo. Private and verifiable interdomain routing decisions. In ACM SIGCOMM, Aug. 2012.