This Article 
 Bibliographic References 
 Add to: 
Accountable Web-Computing
February 2003 (vol. 14 no. 2)
pp. 97-106

Abstract—Web-Based Computing (WBC) is a modality of collaborative computing wherein “volunteers” register at a website, receiving one (usually compute-intensive) task to compute at each visit and returning the results from that task at the subsequent visit. The security of a WBC project is enhanced if the owner of the website can easily keep track of which “volunteer” computed which tasks, thereby endowing the project with accountability. We develop a framework for constructing computationally lightweight schemes for endowing WBC projects with accountability. The framework is built around the notion of a directly computed task allocation function (TAF) that reserves a dedicated subset of the website's tasks for each “volunteer.” We show how TAFs simplify the data structures needed to link “volunteers” with their tasks, even when “volunteers” are allowed to join and leave the WBC project dynamically. We then design a methodology for constructing easily computed TAFs that enhance the efficiency of the accountability scheme.

[1] M. Adler, "Tradeoffs in Probabilistic Packet Marking for IP Traceback," Proc. 34th ACM Symp. Theory of Computing, ACM Press, 2002, pp. 407-418.
[2] A.R. Butt, S. Adabala, N.H. Kapadia, R. Figueiredo, and J.A.B. Fortes, “Fine-Grain Access Control for Securing Shared Resources in Computational Grids,” Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS '02), 2002.
[3] M.R. Garey and D.S. Johnson, Computers and Intractability, W.H. Freeman and Co., 1979.
[4] Approximation Algorithms for NP-Hard Problems, D.S. Hochbaum, ed., PWS Publishing, 1997.
[5] The Intel Philanthropic Peer-to-Peer Program, 2002.
[6] E. Korpela, D. Werthimer, D. Anderson, J. Cobb, and M. Lebofsky, “SETI@Home: Massively Distributed Computing for SETI,” Computing in Science and Eng., P.F. Dubois, ed., IEEE Computer Soc. Press, 2000.
[7] K. Melhorn, Data Structures and Algorithms: III, Multidimensional Searching and Computational Geometry. publisher? June 1991.
[8] I. Niven and H.S. Zuckerman, An Introduction to the Theory of Numbers, Fourth ed., J. Wiley&Sons, 1980.
[9] The Olson Laboratory Fight AIDS@Home Project, 2002.
[10] A.L. Rosenberg, “Efficient Pairing Functions—And Why You Should Care,” Proc. Fourth Workshop Advances in Parallel and Distributed Computation Models, 2002.
[11] The RSA Factoring by Web Project,www.npac.syr.edufactoring, (with Foreword by A. Lenstra), Northeast Parallel Architecture Center. 2002.
[12] L.J. Stockmeyer, “Extendible Array Realizations With Additive Traversal,” IBM Research Report RC-4578, 1973.
[13] C. Weth, U. Kraus, J. Freuer, M. Ruder, R. Dannecker, P. Schneider, M. Konold, and H. Ruder, “XPulsar@Home—Schools Help Scientists,” Typescript, Univ. Tübingen, 2000.
[14] S.W. White and D.C. Torney, “Use of a Workstation Cluster for the Physical Mapping of Chromosomes,” SIAM News, pp. 14-17, Mar. 1993.

Index Terms:
Web computing, computer security, accountable worksharing.
Arnold L. Rosenberg, "Accountable Web-Computing," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 2, pp. 97-106, Feb. 2003, doi:10.1109/TPDS.2003.1178874
Usage of this product signifies your acceptance of the Terms of Use.