Bounds for robust metering schemes and their relationship with a2-code

Abstract

A metering scheme allows a correct counting on the numberof 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 usingthis equivalence, we derive lower bounds on |Vi| and |Es| for robust (butnot necessarily perfect) (k, n)-metering schemes.