Browse > Article

A Secure and Efficient Metering Scheme for Internet Advertising  

Kim, Soon-Seok (Dept.of Computer Engineering, Chungang University)
Shin, Je-Yong (Dept.of Computer Engineering, Chungang University)
Kim, Sung-Kwon (Dept.of Computer Engineering, Chungang University)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.29, no.3, 2002 , pp. 153-160 More about this Journal
Abstract
In this paper, we consider a secure and efficient metering scheme to measure the interaction between clients and servers in interned advertising. In most cases internet advertising is composed of clients, servers, and an audit agency who collects a metering information about the number of clients that were served by each server. The metering scheme should always be secure against fraud attempts by servers which maliciously try to inflate the number of their clients and against clients that attempt to disrupt the metering process. So we suggest secure and efficient metering schemes, based on some cryptographic techniques, which are also very accurate and robust.
Keywords
Internet advertising; Cryptographic protocol;
Citations & Related Records
연도 인용수 순위
  • Reference
1 http://www.powerpage.co.kr/powerzine/
2 M. Naor, B. Pinkas, Secure and Efficient Metering, EuroCypt '98 LNCS, Vo. 1403, pp. 576-590, 1998   DOI   ScienceOn
3 C. Dwork. and M. Naor, Pricing via Processing or Combating Junk Mail, Crypto '92, LNCS, Vol. 576, pp. 114-128, 1992
4 W. Shin an dK. H. Rhee, A WWW Metering Scheme using a Secure Primitive, Procedings of WISA 2000, Vol. 1, No. 1, pp. 182-191, 2000
5 A. Fiat. and A. Shamir, How to Prove Yourself, Crypto '86 LNCS, Vol. 263, pp. 181-187, 1986
6 M. K. Franklin and D. Malkhi, Auditable Metering with Lightweight Security, Financial Cryptography '97 LNCS, Vol. 1318, pp. 151-160. 1997   DOI   ScienceOn
7 B. Masucci and D. R. Stinson, Metering Schemes for General Access Structures, ESORICS 2000, LNCS, Vol. 1895, pp. 72-87, 2000   DOI   ScienceOn
8 A. Aho, J. Hopcroft and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, pp. 299, 1974