October 01, 2016

CURE-Towards enforcing a reliable timeline for cloud forensics: Model, architecture, and experiments

  • Battistoni R.
  • Di Pietro R.
  • Lombardi F.

A malicious alteration of system-provided timeline can negatively affect the reliability of computer forensics. Indeed, detecting such changes and possibly reconstructing the correct timeline of events is of paramount importance for court admissibility and logical coherence of collected evidence. However, reconstructing the correct timeline for a set of network nodes can be difficult since an adversary has a wealth of opportunities to disrupt the timeline and to generate a fake one. This aspect is exacerbated in cloud computing, where host and guest machine-time can be manipulated in various ways by an adversary. Therefore, it is important to guarantee the integrity of the timeline of events for cloud host and guest nodes, or at least to ensure that timeline alterations do not go undetected. This paper provides several contributions. First, we survey the issues related to cloud machine-time reliability. Then, we introduce a novel architecture (CURE) aimed at providing timeline resilience to cloud nodes. Further, we implement the proposed framework and extensively test it on both a simulated environment and on a real cloud. We evaluate and discuss collected results showing the effectiveness of our proposal. (C) 2016 Elsevier B.V. All rights reserved.

View Original Article

Recent Publications

June 04, 2017

A New PRACH Transmission Scheme in Unlicensed Spectrum

  • Luo Z.
  • Meng Y.
  • Tao T.

For the unlicensed spectrum, the occupied bandwidth requirement is demanded by some regulations. The legacy scheme of Physical Random Access Channel (PRACH) for Long Term Evolution (LTE) cannot satisfy it. In this paper, we propose a novel PRACH transmission scheme to satisfy the requirement of unlicensed spectrum based on preamble ...

June 01, 2017

Mutual service processes in Euclidean spaces: existence and ergodicity

  • Baccelli F.
  • Mathieu F.
  • Norros I.

Consider a set of objects, abstracted to points of a spatially stationary point process in R-d, that deliver to each other a service at a rate depending on their distance. Assume that the points arrive as a Poisson process and leave when their service requirements have been fulfilled. We show ...

June 01, 2017

Incentivizing social media users for mobile crowdsourcing

  • Aiello L.
  • Karaliopoulos M.
  • Koutsopoulos I.
  • Micholia P.
  • Morales G.
  • Quercia D.

We focus on the problem of contributor-task matching in mobile crowd-sourcing. The idea is to identify existing social media users who possess domain expertise (e.g., photography) and incentivize them to perform some tasks (e.g., take quality pictures). To this end, we propose a framework that extracts the potential contributors' expertise ...