Secure and efficient metering
作者： Moni Naor , Benny Pinkas
DOI: 10.1007/BFB0054155
关键词: Metering mode 、 Web page 、 Public-key cryptography 、 Authentication 、 Computer science 、 Server 、 Cryptography 、 Process (engineering) 、 Computer security
摘要: We consider an environment in which many servers serve even larger number of clients (e.g. the web), and it is required to meter interaction between clients. More specifically, desired count that were served by a server. A major possible application measure popularity web pages order decide on advertisement fees. The metering process must be very efficient should not require extensive usage any new communication channels. ould also secure against fraud attempts inflate their attempt disrupt process. suggest several constructions systems, based cryptographic techniques. They are accurate can preserve privacy
springer.com
jhu.edu 
sci-hub.se 参考文章(19)
Matthew K Franklin, Dahlia Malkhi, None, Auditable Metering with Lightweight Security financial cryptography. pp. 151- 160 ,(1997) , 10.1007/3-540-63594-7_75
Ralph C. Merkle, A Certified Digital Signature international cryptology conference. pp. 218- 238 ,(1989) , 10.1007/0-387-34805-0_21
Stanisław Jarecki, Andrew Odlyzko, An Efficient Micropayment System Based on Probabilistic Polling financial cryptography. pp. 173- 192 ,(1997) , 10.1007/3-540-63594-7_77
Aho AV, JE Hopcroft, JD Ullman, The Design and Analysis of Computer Algorithms ,(1974)
Torben Pryds Pedersen, Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing international cryptology conference. pp. 129- 140 ,(1991) , 10.1007/3-540-46766-1_9
Matthew K. Franklin, Dahlia Malkhi, Auditable metering with lighweight security Journal of Computer Security. ,vol. 6, pp. 237- 255 ,(1998) , 10.3233/JCS-1998-6402
T. Rabin, M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. pp. 73- 85 ,(1989) , 10.1145/73007.73014
Mark N. Wegman, J.Lawrence Carter, New hash functions and their use in authentication and set equality Journal of Computer and System Sciences. ,vol. 22, pp. 265- 279 ,(1981) , 10.1016/0022-0000(81)90033-7
R. J. McEliece, D. V. Sarwate, On sharing secrets and Reed-Solomon codes Communications of The ACM. ,vol. 24, pp. 583- 584 ,(1981) , 10.1145/358746.358762
Michael Ben-Or, Shafi Goldwasser, Avi Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation symposium on the theory of computing. pp. 1- 10 ,(1988) , 10.1145/62212.62213