Matthew K. Franklin and Dahlia Malkhi. Auditable metering with lightweight security. In Financial Cryptography 97, 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....frames and the audit agency is interested in counting the number of visits received by each server in any time frame. Metering schemes are useful in order to decide the amount of money to be paid to web servers hosting ads, as well as measurement of the use of coupons [15] Franklin and Malkhi [10] were The author was partially supported by NATO research fellowship and Concerted Research Action GOA MEFISTO 666 of the Flemish Government. the first to consider the metering problem in rigorous approach. Their solutions only o#er lightweight security , which can not be applied if there are ....

M. K. Franklin, D. Malkhi, Auditable Metering with Lightweight Security, Financial Cryptography'97, Febr.

....agency whose task is to count the number of clients which have been served by each server during a certain number of time frames. Even though metering originated in the field of web advertisements, there are several other applications of secure metering schemes. For example, Franklin and Malkhi [13] suggested metering schemes as a method to measure the amount of money that companies, willing to pay for the cost required to access their web sites, should pay to the users ISPs. Naor and Pinkas [21] considered a different scenario, in which a newspaper distributes coupons to its clients, which ....

M. Franklin and D. Malkhi, Auditable Metering with Lightweight Security, Journal of Computer Security, Vol. 6, No. 4, pp. 237--255, 1998.

.... Nikander in [3, 29] and formally described by Jakobsson in [23] Interestingly, the idea of moderately hard computational problems has received other uses as well: e.g. uncheatable benchmarks [6] timed release of secrets [41, 17] partial key escrow [4] and auditable metering of web site use [16]. 4 IPSEC architecture IPSEC protocols provide security services at the IP layer in both IPv4 and IPv6 environments. At the lowest level of the IPSEC architecture are cryptographic algorithms for authentication and encryption, which are used by the Authentication Header (AH) and Encapsulating ....

Matthew K. Franklin and Dahlia Malkhi. Auditable metering with lightweight security. In Financial Cryptography: 1st International Conference Proceedings (FC '97), Lecture Notes in Computer Science volume 1318, pages 151--160, Anguilla, British West Indies, February 1997. Springer.

....clients (visitors) In a typical scenario there are many servers 1 and clients, and an audit agency whose task is to measure the interaction between the servers and the clients. A system for measuring the amount of service performed by the servers is called metering scheme. Franklin and Malkhi [5] were the first to consider the secure metering problem in a rigorous theoretical approach. They proposed solutions which offer lightweight security against corrupted servers which try to inflate the count of their visits. Such solutions cannot be applied if there are strong commercial interest ....

M. K. Franklin and D. Malkhi, Auditable Metering with Lightweight Security, Financial Cryptography '97, 1997.

....clients (visitors) In a typical scenario there are many servers 1 and clients, and an audit agency whose task is to measure the interaction between the servers and the clients. A system for measuring the amount of service performed by the servers is called metering scheme. Franklin and Malkhi [5] were the first to consider the secure metering problem in a rigorous theoretical approach. They proposed solutions which offer lightweight security against corrupted servers which try to inflate the count of their visits. Such solutions cannot be applied if there are strong commercial interest ....

M. Franklin and D. Malkhi, Auditable Metering with Lightweight Security, in "Financial Cryptography '97", Lecture Notes in Computer Science, Vol. 1318, pp. 151--160, 1997.

....Consequently, web advertisers should prevent web sites displaying their ads from inflating the count of their visits. In a typical scenario there are many servers and clients, and an audit agency whose task is to measure the interaction between the servers and the clients. 1 Franklin and Malkhi [5] were the first to consider the metering problem in a rigorous theoretical approach. Their solutions offer only a lightweight security and cannot be applied if servers and clients have a strong commercial interest to falsify the metering results. Subsequently, Naor and Pinkas [7] proposed ....

M. Franklin and D. Malkhi, Auditable Metering with Lightweight Security, in "Financial Cryptography '97", Lecture Notes in Computer Science, Vol. 1318, pp. 151--160, 1997.

....of time. Although not defined as such or treated formally, POWs have been proposed as a mechanism for a number of security goals, including server access metering, construction of digital time capsules, uncheatable benchmarks, and protection against spamming and other denial of service attacks [5, 6, 7, 8, 9, 11, 17]. The contribution of this paper is twofold. First, we offer definitions of the notion of a proof of work (POW) and of related concepts. These definitions are informal; formal definitions will appear in the full version of this paper. As mentioned above, POWs have a demonstrated utility in a ....

....the server begins to require clients to perform POWs in order to initiate requests. Their scheme can be extended to non attack scenarios in which equitable distribution of resources is desired. POWs have not only been suggested for limiting access, but also for metering it. Franklin and Malkhi [7] describe a scheme that makes use of POWs for third party verifiable usage metering. A Web site administrator requires users of her site to provide a POW for every access. To demonstrate to an auditor that her site has received a certain amount of usage, she presents the auditor with an audit log ....

M.K. Franklin and D. Malkhi. Auditable metering with lightweight security. In R. Hirschfeld, editor, Proc. Financial Cryptography '97 (FC '97), pages 151--160. Springer-Verlag, 1997. Lecture Notes in Computer Science No. 1318.

....and caches which provide access for many clients (or many visits) which are registered currently at the server as a single visit. Novak and Hoffman [14] overview the current practice in web measurement and argue that it is crucial to standardize the web measurement process. Franklin and Malkhi [9] were the first to consider the metering problem in a rigorous approach. Yet their solutions only offer lightweight security : clients can refrain from helping servers count their visits, servers can improve their count, and the variance of the measurement is relatively high. Such solutions ....

Franklin M. K. and Malkhi D., Auditable metering with lightweight security, Financial Cryptography '97, 1997.

....but be unwilling to revoke those channels because they are also used for unanticipated, but desired, correspondence. The idea of using computational cycles as cost , an option how for implementing the handshake in our system, was considered by Dwork and Naor [DN92] and Franklin and Malkhi [FM97] in different settings. A recent paper by Cranor and LaMacchia [CL98] examines the spam problem and discusses several of the above approaches in more detail. 3 System Operation and Major Components In this section we describe the operation of the proposed scheme in some detail. We assume that ....

M. Franklin and D. Malkhi, Auditable Metering with Lightweight Security, Proc. of Financial Cryptography'97, Springer-Verlag, LNCS 1318, pp. 151--160.

....cannot be controlled by sufficiently large sized subsets of its inputs. In the absence of other assumptions, this work would preclude our result. However, that work does not place computational constraints on the coalition controlling the inputs. Other work has used calculation time as a barrier [8, 9, 16, 13]. But none of the solutions have all the properties that we require here: Unlike time lock puzzles [16, 13] the solution should not be known in advance to anyone, not even the puzzlemaker. And, although easy verification of the solution may be convenient, it is not a requirement here. Unlike ....

....the solutions have all the properties that we require here: Unlike time lock puzzles [16, 13] the solution should not be known in advance to anyone, not even the puzzlemaker. And, although easy verification of the solution may be convenient, it is not a requirement here. Unlike pricing functions [8, 9], the cost of a security breach is high. This paper is organized as follows. In section 2, we present definitions. Section 3 describes our solution including lottery registration, ticket purchase, critical purchase phase, and winning entry calculation. In section 5, we present related work. ....

[Article contains additional citation context not shown here]

M. K. Franklin and D. Malkhi. Auditable Metering with Lightweight Security, Financial Cryptography 1997, LNCS Vol. 1318, Springer-Verlag, 1997.

....arisen lately: the timelock puzzles of [10] the pricing functions of [4] and the delaying functions of [7] among others. As noted in the text, pricing functions appear to be related to general WSBC, while time lock puzzles and delaying functions are related more specifically to TSBC. Also, in [5] values based on repeated hashing, as above in section 2.1, are used as a measure of elapsed time. There have been several previous cryptographic treatments of lotteries. However, they have generally been used as forms of payment mechanisms rather than to run actual lotteries (cf. e.g. 11, 14] ....

Matthew K. Franklin and Dahlia Malkhi. "Auditable Metering with Lightweight Security", in Financial Cryptography: FC `97, Proceedings, R. Hirschfeld (ed.), Springer-Verlag, LNCS vol. 1318, pp. 151--160, 1998.

....but be unwilling to revoke those channels because they are also used for unanticipated, but desired, correspondence. The idea of using computational cycles as cost , an option how for implementing the handshake in our system, was considered by Dwork and Naor [DN92] and Franklin and Malkhi [FM97] in different settings. A recent paper by Cranor and LaMacchia [CL98] examines the spam problem and discusses several of the above approaches in more detail. 3 System Operation and Major Components MTA Alice s Alice s MTA Bob s Bob s The Internet al..ice s browser Alice s browser Alice s browser ....

M. Franklin and D. Malkhi, Auditable Metering with Lightweight Security, Proc. of Financial Cryptography'97, Springer-Verlag, LNCS 1318, pp. 151--160.

....We specify an adversarial model and necessary properties of extended e mail addresses in the presence of such an adversary. We then discuss how to realize the handshake by introducing a cost for the initiator of the request, influenced by the work of Dwork and Naor [DN92] and Franklin and Malkhi [FM97]. Finally, we show a possible realization of the cryptographic functions generating extended email addresses and the handshake. The system may be implemented on top of existing e mail tools and infrastructure. Moreover, it may be implemented by agents that run on behalf of senders and receivers, ....

M. Franklin and D. Malkhi, Auditable Metering with Lightweight Security, Proc. of Financial Cryptography'97, Springer-Verlag, LNCS 1318.

....5. Implementation issues are discussed in Section 6, and we discuss possible extensions in Section 7. Applications are given in Section 8, and some caveats are raised in Section 9. We conclude in Section 10. 2 Related work Since the initial publication of the conference paper of this work [8], which initiates the formal study of secure web metering, Naor and Pinkas [14] have studied methods for performing secure web metering using robust secret sharing schemes. Their approach provides computationally secure metering, which relies on the involvement of a trusted third party (the ....

M. Franklin and D. Malkhi. Auditable Metering with Lightweight Security. In Proceedings of Financial Cryptography '97, (LNCS, 1318), R. Hirschfeld (Ed.), Anguilla, pages 151--160, 1997.

....5. Implementation issues are discussed in Section 6, and we discuss possible extensions in Section 7. Applications are given in Section 8, and some caveats are raised in Section 9. We conclude in Section 10. 2 Related work Since the initial publication of the conference paper of this work [6], which initiates the formal study of secure web metering, Naor and Pinkas [9] have studied methods for performing secure web metering using robust secret sharing schemes. Their approach provides computationaly secure metering, but relies on the involvement of a trusted third party (the auditing ....

M. Franklin and D. Malkhi. Auditable Metering with Lightweight Security. In Financial Cryptography '97 (FC '97), (LNCS, 1318), R. Hirschfeld (Ed.), Anguilla, February 1997, pp. 151-160.

No context found.

Matthew K. Franklin and Dahlia Malkhi. Auditable metering with lightweight security. In Financial Cryptography 97, 1997.

No context found.

M.K. Franklin and D. Malkhi. Auditable metering with lightweight security. In R. Hirschfeld, editor, Financial Cryptography '97, pages 151--160. Springer-Verlag, 1997.

No context found.

M. K. Franklin and D. Malkhi, "Auditable metering with lightweight security," in Financial Cryptography 97, 1997.

No context found.

Matthew Franklin and Dahlia Malkhi. Auditable metering with lightweight security. In R. Hirschfeld, editor, Financial Cryptography '97, volume 138 of Lecture Notes in Computer Science, pages 151-160, 1997.

No context found.

M.K. Franklin and D. Malkhi. Auditable metering with lightweight security. In R. Hirschfeld, editor, Financial Cryptography '97, pages 151-- 160. Springer-Verlag, 1997.

No context found.

M. K. Franklin and D. Malkhi. Auditable metering with lightweight security. Journal of Computer Security. 6(4): 237-255, 1998.

No context found.

M. K. Franklin and D. Malkhi. Auditable metering with lightweight security. In the Proceedings of Financial Cryptography 97, LNCS 1318, pp 151-160, Springer, Berlin, 1997.

No context found.

M. Franklin and D. Malkhi. Auditable Metering with Lightweight Security. Proceedings of Financial Cryptography 1997, Springer-Verlag, LNCS 1318.

No context found.

Matthew K. Franklin and Dahlia Malkhi. Auditable metering with lightweight security. In Financial Cryptography, pages 151--160, 1997.

No context found.

Matt Franklin and Dalia Malkhi. Auditable metering with lightweight security. In Financial Cryptography, pages 151--160, 1997. Also available as http://www.parc.xerox.com/csl/members/franklin/.

No context found.

M. Franklin and D. Malkhi. Auditable Metering with Lightweight Security. Proceedings of Financial Cryptography 1997, Springer-Verlag, LNCS 1318.

No context found.

M. Franklin and D. Malkhi, Auditable Metering with Lightweight Security, in "Financial Cryptography '97", Lecture Notes in Computer Science, Vol. 1318, pp. 151--160, 1997.

No context found.

Matthew K. Franklin and Dahlia Malkhi. "Auditable Metering with Lightweight Security ", in Financial Cryptography: FC `97, Proceedings, R. Hirschfeld (ed.), SpringerVerlag, LNCS vol. 1318, pp. 151--160, 1998.

No context found.

Matthew K. Franklin and Dahlia Malkhi. \Auditable Metering with Lightweight Security ", in Financial Cryptography: FC `97, Proceedings, R. Hirschfeld (ed.), SpringerVerlag, LNCS vol. 1318, pp. 151-160, 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC