Bounds for Robust Metering Schemes and Their Relationship with A-code

Authors:
Wakaha Ogata;Kaoru Kurosawa
Affiliations:
-;-
Venue:
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Year:
2002

Citing 5
Cited 0

A Cartesian product construction for unconditionally secure authentication codes that permit arbitration

Journal of Cryptology
On the construction of perfect authentication codes that permit arbitration

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Provably Secure Metering Scheme

ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Message authentication with arbitration of transmitter/receiver disputes

EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Efficient metering schemes with pricing

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A metering scheme allows a correct counting on the number of hits that a Website received during a certain period. In this paper, we first derive tight lower bounds on the communication complexity |Vi| (i = 1, ..., n) and the size of server's secrets |Es| for robust and perfect (k, n)-metering schemes. We next show an almost equivalence between (k, n)-metering schemes and k-multiple-use A2-codes. Finally, by using this equivalence, we derive lower bounds on |Vi| and |Es| for robust (but not necessarily perfect) (k, n)-metering schemes.