Skip to main content

New Approach for Secure and Efficient Metering in the Web Advertising

  • Conference paper
Computational Science and Its Applications – ICCSA 2004 (ICCSA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3043))

Included in the following conference series:

Abstract

In this paper, we present secure and efficient metering scheme to measure the number of interactions between clients and servers in the web advertising. In most cases the web advertising consists of advertisers, clients, servers, and an audit agency. The metering scheme should always be secure against fraud attempts by servers, which maliciously try to inflate the number of their visits and against clients that attempt to disrupt the metering process. We propose secure and efficient metering scheme based on cryptographic techniques. By analyzing the proposed scheme we show that our scheme is more secure and efficient than previous schemes [2,3,5].

This work was supported by grant No. R01-2003-000-11573-0 from the Basic Research Program of the Korea Science & Engineering Foundation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Marcus, B.: Web Ad Spending to Reach $7.6 Bln. Digitrends.net Corp. CA. [Online]. Available (May2001), http://www.digitrends.net/mna/index15600.html

  2. Naor, M., Pinkas, B.: Secure and efficient metering. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 576–590. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Masucci, B., Stinson, D.R.: Efficient metering schemes with pricing. IEEE Trans. Information Theory 47(7), 2835–2844 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Shamir, A.: How to share a secret. Comm. ACM 22(11), 612–613 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dwork, C., Naor, M.: Pricing via processing or combating junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 114–128. Springer, Heidelberg (1993)

    Google Scholar 

  6. Fiat, A., Shamir, A.: How to prove youeself. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 641–654. Springer, Heidelberg (1987)

    Google Scholar 

  7. Schneier, B.: Applied cryptography, 2nd edn. pp. 29–40. John Wiley & Sons, Chichester (1996)

    Google Scholar 

  8. Menezes, J., Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. In: CRC, pp. 22–33 (1996)

    Google Scholar 

  9. Aho, A., Hopcroft, J., Ullman, J.: The design and analysis of computer algorithms, p. 299. Addison-Wesley, Reading (1974)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, S.S., Kim, S.K., Park, H.J. (2004). New Approach for Secure and Efficient Metering in the Web Advertising. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3043. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24707-4_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24707-4_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22054-1

  • Online ISBN: 978-3-540-24707-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics