Fault-tolerant oblivious assignment with m slots in synchronous systems

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 should be addressed to boost private computation outsourcing. In this paper, we propose a coordination paradigm, namely oblivious assignment with m slots of a resource R (with m ≥ 1 ), allowing processes to compete in order to get a slot of R , while ensuring at the same time both fairness in the assignment of resource slots and that no process learns which slot of R is assigned to a specific process. We present a distributed algorithm solving oblivious assignment with m slots within a distributed system, assuming (1) a bounded number of crash failures f , (2) the existence of at least f + 2 honest processes, and (3) m ≤ n (where n is the number of processes). The algorithm is based on a rotating token paradigm and its correctness is formally proved. A probabilistic analysis of the average waiting time before getting a slot is also provided.

[1]  A. Juels,et al.  Universal Re-encryption for Mixnets , 2004, CT-RSA.

[2]  Oded Goldreich,et al.  Foundations of Cryptography: Volume 2, Basic Applications , 2004 .

[3]  Dan Boneh,et al.  The Decision Diffie-Hellman Problem , 1998, ANTS.

[4]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[5]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[6]  Randy H. Katz,et al.  A view of cloud computing , 2010, CACM.

[7]  Giuseppe Antonio Di Luna,et al.  Oblivious Assignment with m Slots , 2012, SSS.

[8]  Hagit Attiya,et al.  Renaming in an asynchronous environment , 1990, JACM.

[9]  Nigel P. Smart,et al.  Mental Poker Revisited , 2003, IMACC.

[10]  Ichiro Suzuki,et al.  A distributed mutual exclusion algorithm , 1985, TOCS.

[11]  Kerry Raymond.  A Distributed Algorithm for Multiple Entries to a Critical Section , 1989, Inf. Process. Lett..

[12]  Gary L. Peterson,et al.  The ambiguity of choosing , 1989, PODC '89.

[13]  Michel Raynal,et al.  Algorithms for mutual exclusion , 1986 .

[14]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[15]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[16]  Roberto Baldoni,et al.  How Not to Be Seen in the Cloud: A Progressive Privacy Solution for Desktop-as-a-Service , 2012, OTM Conferences.

[17]  Nitin H. Vaidya,et al.  A distributed K-mutual exclusion algorithm , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

[18]  Satoshi Fujita,et al.  A Distributed k-Mutual Exclusion Algorithm Using k-Coterie , 1994, Inf. Process. Lett..

[19]  Mamoru Maekawa,et al.  A N algorithm for mutual exclusion in decentralized systems , 1985, TOCS.

[20]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[21]  Ashok K. Agrawala,et al.  An optimal algorithm for mutual exclusion in computer networks , 1981, CACM.