In this paper we consider a large distributed system in which data is shared among several users. Specifically, we present a secure adaptive algorithm for data fragment allocation on multiple nodes of the system. The algorithm handles (replicated) data fragments, stored by nodes without the need of encryption, in such a way to ease information sharing. Data confidentiality is guaranteed in the presence of passive and active attacks, and fragments are dynamically reallocated/replicated in the system to converge, under assumptions of regularity of the read-write activity, to an allocation that provably guarantees highest performance in terms of network load. © 2006 IEEE.
A Secure and Efficient Large Scale Distributed System for Object Sharing / Mancini, Luigi Vincenzo; Mei, Alessandro; Zanin, G.. - STAMPA. - 2006:(2006). (Intervento presentato al convegno 26th IEEE Internationa26th IEEE International Conference on Distributed Computing Systems, ICDCS 2006 tenutosi a Lisboa; Portugal nel 4-7 luglio 2006) [10.1109/ICDCS.2006.11].
A Secure and Efficient Large Scale Distributed System for Object Sharing
MANCINI, Luigi Vincenzo;MEI, Alessandro;
2006
Abstract
In this paper we consider a large distributed system in which data is shared among several users. Specifically, we present a secure adaptive algorithm for data fragment allocation on multiple nodes of the system. The algorithm handles (replicated) data fragments, stored by nodes without the need of encryption, in such a way to ease information sharing. Data confidentiality is guaranteed in the presence of passive and active attacks, and fragments are dynamically reallocated/replicated in the system to converge, under assumptions of regularity of the read-write activity, to an allocation that provably guarantees highest performance in terms of network load. © 2006 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
