Auditable metering with lighweight security
Journal of Computer Security
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Third Party Certification of HTTP Service Access Statistics (Position Paper)
Proceedings of the 6th International Workshop on Security Protocols
Auditable Metering with Lightweight Security
FC '97 Proceedings of the First International Conference on Financial Cryptography
Time-lock Puzzles and Timed-release Crypto
Time-lock Puzzles and Timed-release Crypto
The millicent protocols for electronic commerce
WOEC'95 Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1
SAWM: a tool for secure and authenticated web metering
SEKE '02 Proceedings of the 14th international conference on Software engineering and knowledge engineering
Security Notions and Generic Constructions for Client Puzzles
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
| Hi-index | 0.00 |
This paper proposes a cryptographic scheme for metering the duration and/or the number of instances of running a process. This scheme has the following property: knowing a secret, one can validate a piece of metering evidence in constant units of time while without the secret the job of generating a valid piece of evidence requires time indicated by the evidence. Because the scheme utilises a well-known computational complexity problem, the meter based on it can be implemented in software yet is tamper-resistant.We will address the use of this scheme in building an auditable metering scheme for finding the popularity of web sites. The scheme is suitable for rapidly increasing web advertisement applications. We will also discuss the related security issues.