In this demo, we will showcase FLAT, a federated identity model tailored to IoT. FLAT's authentication is lightweight because it uses only symmetric cryptosystems on the IoT client side and implicit certificates between the Identity and Service Providers. We show how FLAT can be used to increase security and privacy in automatic toll gate payment applications.

Digital forensics is a branch of Computer Science aiming at investigating and analyzing electronic devices in the search for crime evidence. There are several ways to perform this search. Known File Filter (KFF) is one of them, where a list of interest objects is used to reduce/separate data for analysis. Holding a database of hashes of such objects, the examiner performs lookups for matches against the target device. However, due to limitations over hash functions (inability to detect similar objects), new methods have been designed, called approximate matching. This sort of function has interesting characteristics for KFF investigations but suffers mainly from high costs when dealing with huge data sets, as the search is usually done by brute force. To mitigate this problem, strategies have been developed to better perform lookups. In this paper, we present the state of the art of similarity digest search strategies, along with a detailed comparison involving several aspects, as time complexity, memory requirement, and search precision. Our results show that none of the approaches address at least these main aspects. Finally, we discuss future directions and present requirements for a new strategy aiming to fulfill current limitations.

This article introduces a new workflow specification model for parallel applications. Many parallel systems allow only the following basic flow control: (1) a coordinator task distributes the data among the worker tasks, (2) the worker tasks process the data in parallel and (3) the coordinator task gather all the results. In some systems the application execution flow is based on a dependence relationship among tasks, representing a directed acyclic graph (DAG). Even with this model, it is not possible to execute some important parallel applications and, therefore, there is a need for a new specification model with more sophisticated flow controls that allow, for example, conditional branching and iterations at the level of task management. The purpose of this article is to present a proposal for a new parallel application specification model that provides new types of control structures and allows the implementation of a broader range of applications.