Abstract
A metering scheme is a protocol in which an audit agency is able to measure the interaction between clients and servers on the web during a certain number of time frames. Naor and Pinkas [7] considered metering schemes in which any server is able to construct a proof to be sent to the audit agency if and only if it has been visited by at least a number, say h, of clients in a given time frame. In their schemes the parameter h is fixed and is the same for any server and any time frame. In this paper we introduce dynamic multi-threshold metering schemes, that are metering schemes in which there is a threshold associated to any server for any time frame. We mainly focus on the efficiency of dynamic multi-threshold metering schemes, by minimizing the information received and distributed by clients. This is important because the clients participating in the metering process do not receive any money from the audit agency.
Chapter PDF
Similar content being viewed by others
References
C. Blundo, A. De Bonis and B. Masucci, Metering Schemes with Pricing, to appear in Proceedings of “14th International Symposium on DIStributed Computing—DISC2000”, Toledo, Spain, October 4–6, 2000.
T. M. Cover and J. A. Thomas, Elements of Information Theory. John Wiley & Sons, 1991.
A. De Bonis and B. Masucci, An Information Theoretical Approach to Metering Schemes, in Proceedings of “2000 International Symposium on Information Theory —ISIT 2000”,Sorrento, Italy, June 25–30, 2000.
M. Franklin and D. Malkhi, Auditable Metering with Lightweight Security, in Proceedings of “Financial Cryptography ’97”, Lecture Notes in Computer Science, Vol. 1318, pp. 151–160, 1997.
B. Masucci and D. R. Stinson Efficient Metering Schemes with Pricing, submitted for publication, 2000. Technical Report CORR 2000-06, Centre for Applied Cryptographic Research, University of Waterloo.
B. Masucci and D. R. Stinson, Metering Schemes for General Access Structures, to appear in Proceedings of “6th European Symposium on Research in Computer Security-ESORICS 2000”, Toulouse, France, October 4–6, 2000. Technical Report, CORR 2000-21, Centre for Applied Cryptographic Research, University of Waterloo.
M. Naor and B. Pinkas, Secure and Efficient Metering, in Proceedings of “Advances in Cryptology-EUROCRYPT ’98”, Lecture Notes in Computer Science, Vol. 1403, pp. 576–590, 1998.
M. Naor and B. Pinkas, Secure Accounting and Auditing on the Web, Computer Networks and ISDN Systems, Vol. 40, Issues 1–7, pp. 541–550, 1998.
A. Shamir, How to Share a Secret, Communications of the ACM, Vol. 22, pp. 612–613, 1979.
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
Blundo, C., De Bonis, A., Masucci, B., Stinson, D.R. (2001). Dynamic Multi-threshold Metering Schemes. In: Stinson, D.R., Tavares, S. (eds) Selected Areas in Cryptography. SAC 2000. Lecture Notes in Computer Science, vol 2012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44983-3_10
Download citation
DOI: https://doi.org/10.1007/3-540-44983-3_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42069-9
Online ISBN: 978-3-540-44983-6
eBook Packages: Springer Book Archive