Abstract
This paper proposes a cryptographic scheme for metering the duration and/or the number of instances of running a process. This scheme has the following property: knowing a secret, one can validate a piece of metering evidence in constant units of time while without the secret the job of generating a valid piece of evidence requires time indicated by the evidence. Because the scheme utilises a well-known computational complexity problem, the meter based on it can be implemented in software yet is tamper-resistant.
We will address the use of this scheme in building an auditable metering scheme for finding the popularity of web sites. The scheme is suitable for rapidly increasing web advertisement applications. We will also discuss the related security issues.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bergadano F., De Mauro P.: Third party certification of HTTP service access statistics. The Proceedings of the 1998 Cambridge International Workshop on Security Protocols, Cambridge, England, 1998
Franklin M. K., Malkhi D.: Auditable metering with lightweight security. The Proceedings of Financial Cryptography ’97, LNCS 1318, Springer, Berlin, (1997) 151–160
Franklin M. K., Malkhi D.: Auditable metering with lightweight security. Journal of Computer Security 6(4) (1998) 237–255
Glassman S., Manasse M., Abadi M., Gauthier P., Sobalvarro P.: The Millicent protocol for inexpensive electronic commerce. The Proceedings of the 4th International World Wide Web Conference (1995) 603–618
Kinsman M.: Web advertising 1997: market analysis and forecast. Cowles/Simba Information. Stamford, Connecticut, May 1997
Naor M., Pinkas B.: Secure and efficient metering. The proceedings of EUROCRYPT ’98, LNCS 1403, Springer, Berlin, (1998) 576–590
Rivest R.L., Shamir A., Adleman L.M.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2) 1978 120–126
Rivest R.L., Shamir A., Wagner D.A.: Time-lock puzzles and timed-release crypto. LCS Technical Memo MIT/LCS/TR-684, February 1996
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, L., Mao, W. (2001). An Auditable Metering Scheme for Web Advertisement Applications. In: Davida, G.I., Frankel, Y. (eds) Information Security. ISC 2001. Lecture Notes in Computer Science, vol 2200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45439-X_33
Download citation
DOI: https://doi.org/10.1007/3-540-45439-X_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42662-2
Online ISBN: 978-3-540-45439-7
eBook Packages: Springer Book Archive