Abstract
We 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. Anupam A. Mayer K. Nassim B. Pinkas M.K. Reiter (1999) ArticleTitleOn the Security of Pay-Per-Click and Other Wed Advertising Schemes Computer Networks. 31 1091–1100
C. Blundo A. De Bonis B. Masucci (2000) ArticleTitleMetering schemes with pricing Proceedings of the DISC Lecture Notes in Computer Science. 1914 1914 194–208
Blundo C., De Bonis A., Masucci B., (1999). Bounds and constructions for metering schemes. Technical Report, Universita di Salerno (1999)
C. Blundo A. De Bonis B. Masucci D.R. Stinson (2001) ArticleTitleDynamic multi-threshold metering schemes Selected Areas in Cryptography Lecture Notes in Computer Science. 2012 131–144
C. Blundo., B. Masucci, A note on ideal metering schemes. Preprint
E.F. Brickell (1989) ArticleTitleSome ideal secret sharing schemes Journal of Combinatorial Mathematics and Combinatorial Computing 9 105–113
R.M. Capocelli A. De Santis L. Gargano U. Vaccaro (1993) ArticleTitleOn the size of shares for secret sharing schemes Journal of Cryptology. 6 157–169
T.M. Cover., J. A. Thomas, Elements of Information Theory, John Wiley & Sons (1991)
A. DeBonis B. Masucci (2000) An information theoretical approach to metering schemes, Technical Report, Universita di Salerno Abstract in Proceedings of ISIT 2000, Sorrento Italy.
M. Dijk Particlevan (1995) ArticleTitleA linear construction for perfect secret sharing schemes Advances in Cryptology – EUROCRYPT’ 94. Lecture Notes in Computer Science. 950 23–34
M. Franklin D. Malkhi (1998) ArticleTitleAuditable metering with lightweight security Journal of Computer Security. Vol 6. 4 237–255
Hirschfeld J.W.P., Thas J.A. (1991). General Galois Geometries, Oxford University Press
W.-A. Jackson K.M. Martin (1994) ArticleTitleGeometric secret sharing schemes and their duals Designs, Codes and Cryptography. 4 83–95
W.-A. Jackson K.M. Martin (1996) ArticleTitlePerfect secret sharing schemes on five participants Designs, Codes and Cryptography. 9 267–286
W.-A. Jackson K.M. Martin (1998) ArticleTitleAn algorithm for efficient geometric secret sharing Utilitas Mathematica. 54 127–150
Jakobsson M., MacKenzie P.D., Stern J.P. (1999). Secure and lightweight advertising on the Web. Proceedings of the 8th World Wide Web Conference
M. Lesk, Projections for making money on the Web, Harvard Infrastructure Conference, 23–25 January 1997Available at http://www.lesk.com/mlesk/iih/iih.html
Manasse M. (1995). The Millicent protocols for electronic commerce In Proceedings of the 1st USENIX Workshop on Electronic Commerce, July 11–12, 1995 Available at http://www.research. digital.com/SRC/millicent/
B. Masucci D.R. Stinson (2000) ArticleTitleMetering schemes for general access structures Proceedings of ESORICS Lecture Notes in Computer Science. 1895 72–87
Masucci B., Stinson D.R. (2000). Efficient metering schemes with pricing, Technical Report CORR 2000-06, Centre for Applied Cryptographic Research, University of Waterloo
M. Naor B. Pinkas (1998) ArticleTitleSecure and efficient metering Advances in Cryptology – EUROCRYPT’ Lecture Notes in Computer Science. 140 576–590
M. Naor B. Pinkas (1998) ArticleTitleSecure accounting and auditing on the Web Computer Networks. 30 541–550
W. Ogata K. Kurosawa (2000) ArticleTitleProvably secure metering scheme Advances in Cryptology – ASIACRYPT Lecture Notes in Computer Science. 1976 388–398
T. Pedersen (1996) ArticleTitleElectronic payments of small amounts Proceeding of the International Workshop Security Protocols, Lecture Notes in Computer Science. 1189 56–68
A. Shamir (1979) ArticleTitleHow to share a secret Comm. ACM. Vol. 22 11 612–613 Occurrence Handle10.1145/359168.359176
Simmons G.J. (1992). An introduction to shared secret and or shared control schemes and their applications, In: Contemporary Cryptology, IEEE Press (1992: 441–497
D.R. Stinson (1992) ArticleTitleAn explication of secret sharing schemes Designs Codes and Cryptography. 2 357–390 Occurrence Handle10.1007/BF00125203
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by : P. Wild
AMS Classification: 94A60
Rights and permissions
About this article
Cite this article
Barwick, S.G., Jackson, WA. & Martin, K.M. A General Approach to Robust Web Metering. Des Codes Crypt 36, 5–27 (2005). https://doi.org/10.1007/s10623-003-1158-2
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10623-003-1158-2