Warning: pg_query(): Query failed: ERROR: missing chunk number 0 for toast value 29512337 in pg_toast_2619 in /dati/webiit-old/includes/database.pgsql.inc on line 138 Warning: ERROR: missing chunk number 0 for toast value 29512337 in pg_toast_2619 query: SELECT data, created, headers, expire, serialized FROM cache_page WHERE cid = 'https://www-old.iit.cnr.it/en/node/41312' in /dati/webiit-old/includes/database.pgsql.inc on line 159 Warning: pg_query(): Query failed: ERROR: missing chunk number 0 for toast value 29512337 in pg_toast_2619 in /dati/webiit-old/includes/database.pgsql.inc on line 138 Warning: ERROR: missing chunk number 0 for toast value 29512337 in pg_toast_2619 query: SELECT data, created, headers, expire, serialized FROM cache_page WHERE cid = 'https://www-old.iit.cnr.it/en/node/41312' in /dati/webiit-old/includes/database.pgsql.inc on line 159 Logical Key Hierarchy for Groups Management in Distributed Online Social Network | IIT - CNR - Istituto di Informatica e Telematica
IIT Home Page CNR Home Page

Logical Key Hierarchy for Groups Management in Distributed Online Social Network

Distributed Online Social Networks (DOSNs) have recently been proposed to shift the control over user data from a unique entity to the users of the DOSN themselves.In this paper, we focus our attention on the problem of privacy preserving content sharing to a large group of users of the DOSNs.Several solutions, based on cryptographic techniques, have been recently proposed.The main challenge here is the definition of a scalable and decentralized approach that: i) minimizes the re-encryption of the contents published in a group when the composition of the group changes and ii) enables a fast distribution of the cryptographic keys to all the members (n) of a group, each time a new user is added or removed from the group by the group owner. Our solution achieves the above goals, providing performance unattained by our competitors. In particular, our approach requires only O(d log n) encryption operations when the group membership changes (eviction), and only O(2 log n) when a join occurs (where d is a input parameter of the system). The effectiveness of our approach is evaluated by an experimental campaign carried out over a set of traces from a real online social network.


21st IEEE Symposium on Computers and Communications (ISCC 2016), Messina, 2016

External authors: Laura Ricci (Dipartimento di Informatica, Università di Pisa)
IIT authors:

Andrea De Salve

Foto di Andrea De Salve

Type: Contributo in atti di convegno
Field of reference: Information Technology and Communication Systems

File: desalveLogicalKeyHierarchy.pdf

Activity: Sicurezza nel Cloud Computing
Architetture, protocolli e meccanismi di sicurezza per sistemi e servizi distribuiti