Abstract
We consider an environment in which many servers serve an even larger number of clients (e.g. the web), and it is required to meter the interaction between servers and clients. More specifically, it is desired to count the number of clients that were served by a server. A major possible application is to measure the popularity of web pages in order to decide on advertisement fees. The metering process must be very efficient and should not require extensive usage of any new communication channels. The metering ould also be secure against fraud attempts by servers which inflate the number of their clients and against clients that attempt to disrupt the metering process. We suggest several secure and efficient constructions of metering systems, based on efficient cryptographic techniques. They are also very accurate and can preserve the privacy of the clients.
Research supported by a grant from the Israel Science Foundation administered by the Israeli Academy of Sciences
Supported by an Eshkol Fellowship from the Israeli Ministry of Science
Chapter PDF
Similar content being viewed by others
References
Aho A., Hopcroft J. and Ullman J., The design and analysis of computer algorithms, Addison-Wesley, 1974.
Ben-Or M., Goldwasser S. and Wigderson A., Completeness theorems for noncryp-tographic fault tolerant distributed computation, 20th STOC, 1988, 1–9.
Carter L. and Wegman M., Universal hash functions, J. of Computer and System Sciences, Vol. 18, 1979, 143–154.
Desmedt Y. and Frankel Y., Threshold cryptosystems, Crypto '89, LNCS 435, 1990, 307–315.
Dwork C. and Naor M., Pricing via Processing or Combating Junk Mail, Crypto '92, LNCS 576, 1992, 114–128.
Feldman P., A practical scheme for non-interactive verifiable secret sharing, 28th FOCS, 1987, 427–437.
Feldman P. and Micali S., An Optimal Probabilistic Protocol for Synchronous Byzan-tine Agreement, SIAM J. on Comp., Vol. 26, No. 4, 1997, 873–933.
Frankel Y., Gemmell P., MacKenzie P. D. and Yung M., Optimal-resilience proactive public-key cryptosystems, 38th FOCS, 1997, 384–393.
Franklin M. K. and Malkhi D., Auditable metering with lightweight security, Finan-cial Cryptography '97, 1997.
J. Kilian, Founding Cryptography on Oblivious Transfer, 20th STOC, 1988, 20–31.
Jarecki S. and Odlyzko A., An efficient micropayment system based on probabilistic polling, Financial Cryptography '97, 1997.
Merkle R., A certified digital signature, Crypto '89, LNCS 435, 1990, 218–238.
McEliece R. J. and Sarwate D. V., On sharing secrets and Reed-Solomon Codes, Comm. ACM, Vol. 24, No. 9, 1981, 583–584.
Novak T. and Hoffman D., New metrics for web media: toward the devel-opment of web measurement standards, Sep. 1996. Manuscript available at http://www2000.ogsm.vanderbilt.edu/novak/web.standards/webstand.html
Pedersen T. P., Non-interactive and information-theoretic secure verifiable secret sharing, Crypto '91, LNCS 576, 1991, 129–140.
Pitkow J., In search of reliable usage data on the WWW, Sixth International WWW Conf., Apr. 1997.
Rabin T. and Ben-Or M., Verifiable secret sharing and multiparty protocols with honest majority, 21st STOC, 1989, 73–85.
Kinsman M., Web advertising 1997: market analysis and forecast, Cowles/Simba Information, Stamford, Connecticut. May 1997.
Shamir A., How to share a secret, Comm. ACM Vol. 22, No. 11, 1979, 612–613.
Wegman M. and Carter L., New hash functions and their use in authentication and set equality, J. of Computer and System Sciences, vol. 20, 1981, 265–279.
21. Yao A. C., How to generate and exchange secretes, 27th FOCS, 1986, 162–167.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Naor, M., Pinkas, B. (1998). Secure and efficient metering. In: Nyberg, K. (eds) Advances in Cryptology — EUROCRYPT'98. EUROCRYPT 1998. Lecture Notes in Computer Science, vol 1403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054155
Download citation
DOI: https://doi.org/10.1007/BFb0054155
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64518-4
Online ISBN: 978-3-540-69795-4
eBook Packages: Springer Book Archive
