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. (C) 2014 Elsevier Inc. All rights reserved.

Fault-tolerant oblivious assignment with m slots in synchronous systems / Ateniese, Giuseppe; Baldoni, Roberto; Bonomi, Silvia; DI LUNA, GIUSEPPE ANTONIO. - In: JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING. - ISSN 0743-7315. - STAMPA. - 74:7(2014), pp. 2648-2661. [10.1016/j.jpdc.2014.02.008]

Fault-tolerant oblivious assignment with m slots in synchronous systems

ATENIESE, GIUSEPPE;BALDONI, Roberto;BONOMI, Silvia;DI LUNA, GIUSEPPE ANTONIO
2014

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. (C) 2014 Elsevier Inc. All rights reserved.
2014
failures; secure computations; distributed coordination abstractions; distributed systems; mutual exclusion
01 Pubblicazione su rivista::01a Articolo in rivista
Fault-tolerant oblivious assignment with m slots in synchronous systems / Ateniese, Giuseppe; Baldoni, Roberto; Bonomi, Silvia; DI LUNA, GIUSEPPE ANTONIO. - In: JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING. - ISSN 0743-7315. - STAMPA. - 74:7(2014), pp. 2648-2661. [10.1016/j.jpdc.2014.02.008]
File allegati a questo prodotto
File Dimensione Formato  
VE_2014_11573-560541.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 1.68 MB
Formato Adobe PDF
1.68 MB Adobe PDF   Contatta l'autore

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/560541
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact