Barwick, S.Jackson, W.Martin, K.2006-12-042006-12-042005Designs, Codes, and Cryptography, 2005; 36(1):5-270925-10221573-7586http://hdl.handle.net/2440/17768The original publication is available at www.springerlink.comWe consider the problem of metering access to web sites. Many services, such as web advertising, have a need for accurate counts of the number of visits to a web site. We consider the robust approach to web metering by looking at techniques that provide secure proofs of visit. We refine a number of previous models for metering schemes and provide a general construction for secure and efficient schemes that meter the interaction of a web site with a targeted audience. We generalise a technique for determining the minimum information that clients in the web site audience need to secure in order to supply proofs of visit. We also show how our metering schemes can be made robust against corrupt clients who attempt to prevent web servers constructing legitimate proofs of visit.enJournal article002005073310.1007/s10623-003-1158-20002308505000012-s2.0-1874437573354833Barwick, S. [0000-0001-9492-0323]Jackson, W. [0000-0002-0894-0916]