Paper Info
Title
Oblivious assignment with m slots
Abstract
Preserving anonymity and privacy of customer actions within a complex software system, such as a cloud computing system, is one of the main issues that must be solved in order to boost private computation outsourcing. In this paper, we propose a coordination paradigm, namely oblivious assignment with m slots of a resource $\mathcal{R}$ (with m≥1), allowing processes to compete to get a slot of $\mathcal{R}$ while ensuring, at the same time, both fairness of resource allocation and obliviousness, that is, the impossibility for any process to infer which slot of $\mathcal{R}$ is assigned to any other process. We study oblivious assignment with m slots solvability issues based on the message pattern of the algorithm. We also present a distributed algorithm solving oblivious assignment with m slots within a distributed system, assuming the existence of at least two honest processes and m≤n (where n is the number of processes). The algorithm is based on a rotating token paradigm and employs an adaptation of the ElGamal encryption scheme to work with multiple parties and to ensure obliviousness of the assignment. Finally, the correctness of the algorithm is formally proved.
Year
DOI
Venue
2012
10.1007/978-3-642-33536-5_19
SSS
Keywords
Field
DocType
resource allocation,m slot,honest process,elgamal encryption scheme,complex software system,coordination paradigm,oblivious assignment,cloud computing system,preserving anonymity,token paradigm,distributed systems,mutual exclusion
Computer science,Correctness,Theoretical computer science,Resource allocation,Distributed algorithm,ElGamal encryption,Anonymity,Security token,Mutual exclusion,Cloud computing
Conference
Citations 
PageRank 
References 
3
0.39
13
Authors
4
Name
Order
Citations
PageRank
Giuseppe Ateniese14380254.66
Roberto Baldoni21606132.37
Silvia Bonomi315724.66
Giuseppe Antonio Di Luna49116.11