Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A perfect threshold secret sharing scheme to identify cheaters
Designs, Codes and Cryptography
Communications of the ACM
Bounds for Robust Metering Schemes and Their Relationship with A-code
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A hybrid method to detect deflation fraud in cost-per-action online advertising
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Almost optimum t-cheater identifiable secret sharing schemes
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
| Hi-index | 0.00 |
Naor and Pinkas introduced metering schemes at Eurocrypt '98 in order to decide on advertisement fees for web servers. In the schemes, any server should be able to construct a proof to be sent to an audit agency if and only if it has been visited by at least a certain number, say k, of clients. This paper first shows an attack for their schemes such that only two malicious clients can prevent a server from computing a correct proof. We next present provably secure metering schemes. Finally, an efficient robust secret sharing scheme is derived from our metering scheme.