Elements of information theory
Elements of information theory
On the security of pay-per-click and other Web advertising schemes
WWW '99 Proceedings of the eighth international conference on World Wide Web
Auditable Metering with Lightweight Security
FC '97 Proceedings of the First International Conference on Financial Cryptography
A lightweight protocol for the generation and distribution of secure e-coupons
Proceedings of the 11th international conference on World Wide Web
A note on optimal metering schemes
Information Processing Letters
Online Advertising: Secure E-coupons
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Dynamic Multi-threshold Metering Schemes
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
A Linear Algebraic Approach to Metering Schemes
Designs, Codes and Cryptography
Electronic Commerce Research
A General Approach to Robust Web Metering
Designs, Codes and Cryptography
Hi-index | 0.00 |
Metering schemes are cryptographic protocols to count the number of visits received by web sites. These measurement systems are used to decide the amount of money to be paid to web sites hosting advertisements. Indeed, the amount of money paid by the publicity agencies to the web sites depends on the number of clients which visited the sites. In this paper we consider a generalization of the metering scheme proposed by Naor and Pinkas [5]. In their scheme a web site is paid if and only if it has been visited by at least a certain number, say h, of clients. In our scheme there are two thresholds. say l and h, with l h, If a web site is visited by at most l clients then the web site receives no money. If it receives at least h visits then it receives a full payment. Finally, if it receives a number f of visits comprised between l +1 and h - 1 then it receives a partial payment which depends on f. We provide lower bounds on the size of the information distributed to clients and to servers by metering schemes and present a scheme which achieves these lower bounds.