Efficient Pairing Functions - And Why You Should Care
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
An authentication protocol in web-computing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.00 |
We develop a computationally lightweight scheme for enhancing security when sharing a massive "bag of tasks" on theWeb, by enabling the tasks' owner to keep track of which "volunteer" computed which tasks. The scheme combines a directory that dynamically assigns names to volunteers, who can arrive and depart at will, with a directly computed task allocation function (TAF) that assigns tasks to each volunteer-name from a reserved "sub-bag." We design a methodology for constructing easily computed additive TAFs (ATAFs), which assign each volunteer-name v a base task Bv and a stride Svand then index every sub-bag by an arithmeticprogression:Bv,Bv+Sv, Bv + 2Sv. The scheme ensures that faster volunteers are always assigned smaller strides, thereby simplifying the management of the memory where tasks reside. We seek to simplify memory management further by striving for ATAFs whose strides Svgrow slowly as a function of v. We present a sequence of ATAFs whose strides grow progressively slower, with only modest concomitant increase in computational complexity. The sequence ranges from easily computed ATAFs whose strides grow exponentially, to slightly more complex ATAFs whose strides grow quadratically, to somewhat complex ATAFs whose strides grow subquadratically.