Secure and Robust Metering in the Web Advertising

  • 발행 : 2007.03.30

초록

In this paper, we present robust and secure metering scheme to measure the number of interactions between clients and servers in the web, especially the web advertising. In most cases the web advertising is 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 inate the number of their visits and against clients that attempt to disrupt the metering process. We propose robust and secure metering scheme based on cryptographic techniques. By analyzing the proposed scheme we show that our scheme is more robust and secure than the previous schemes [1,2,4,5].

키워드

참고문헌

  1. M. Naor and B. Pinkas, Secure and efficient metering, Advances in Cryptology-EuroCrypt '98, Lecture Notes in Computer Science, vol. 1403, pp. 576-590, May. 1998
  2. B. Masucci and D. R. Stinson, Efficient metering schemes with pricing, IEEE Trans. Information Theory, vol. 47, no. 7, pp. 2835-2844, Nov. 2001 https://doi.org/10.1109/18.959264
  3. A. Shamir, How to share a secret, Comm. ACM, vol. 22, no. 11, pp. 612-613, Nov. 1979 https://doi.org/10.1145/359168.359176
  4. Soon Seok Kim, Sung Kwon Kim, and Hong Jin Park, New approach for secure and efficient metering in the web advertising, Computational Science and Its Applications-ICCSA 2004, Lecture Notes in Computer Science, vol. 3043, pp. 215-221, May. 2004
  5. M. K. Franklin and D. Ma1khi, Auditable metering with lightweight security, Financial Cryptography'97, Lecture Notes in Computer Science, vol. 1318, pp. 151-160, Feb. 1997
  6. V. Nikov, S. Nikova, B. Preneel and J. Vandewalle, Applying general access structure to metering schemes, Proceedings of the International Workshop on Coding and Cryptography (WCC 2003), 2003