Part 1: Cross-Domain Conference and Workshop on Multidisciplinary Research and Practice for Information Systems (CD-ARES 2014): Knowledge ManagementInternational audienceSome application domains, including monitoring of active systems in artificial intelligence and model-based mutation testing in software engineering, require determinization of finite automata to be performed incrementally. To this end, an algorithm called Incremental Subset Construction (ISC) was proposed a few years ago. However, this algorithm was recently discovered to be incorrect is some instance problems. The incorrect behavior of ISC originates when the redirection of a transition causes a portion of the automaton to be disconnected from the initial state. This misbehavior is disturbing in two ways: portions of the resulting automaton are disconnected and, as such, useless; moreover, a considerable amount of computation is possibly wasted for processing these disconnected parts. To make ISC sound, a metrics-based technique is proposed in this paper, where the distance between states is exploited in order to guarantee the connection of the automaton, thereby allowing ISC to achieve soundness. Experimental results show that, besides being effective, the proposed technique is efficient too
Magnetic Fluid Hyperthermia uses magnetic nanoparticle and time-varying magnetic field to heat tissue. A study on the correlation between synthetic parameters and morphological structure of magnetic iron nanoparticles was performed using a one-pot water-dispersible-NP synthetic method. Magnetization and thermic measurements confirm their potential use for hyperthermia therapy
Initial attempts to obtain lattice based signatures were closely related to reducing a vector modulo the fundamental parallelepiped of a secret basis (like GGH [9], or NTRUSign [12]). This approach leaked some information on the secret, namely the shape of the parallelepiped, which has been exploited on practical attacks [24]. NTRUSign was an extremely efficient scheme, and thus there has been a noticeable interest on developing countermeasures to the attacks, but with little success [6]. In [8] Gentry, Peikert and Vaikuntanathan proposed a randomized version of Babai’s nearest plane algorithm such that the distribution of a reduced vector modulo a secret parallelepiped only depended on the size of the base used. Using this algorithm and generating large, close to uniform, public keys they managed to get provably secure GGHlike lattice-based signatures. Recently, Stehlé and Steinfeld obtained a provably secure scheme very close to NTRUSign [26] (from a theoretical point of view). In this paper we present an alternative approach to seal the leak of NTRUSign. Instead of modifying the lattices and algorithms used, we do a classic leaky NTRUSign signature and hide it with gaussian noise using techniques present in Lyubashevky’s signatures. Our main contributions are thus a set of strong NTRUSign parameters, obtained by taking into account latest known attacks against the scheme, a statistical way to hide the leaky NTRU signature so that this particular instantiation of CVP-based signature scheme becomes zero-knowledge and secure against forgeries, based on the worst-case hardness of the Õ(N)-Shortest Independent Vector Problem over NTRU lattices. Finally, we give a set of concrete parameters to gauge the efficiency of the obtained signature scheme.
Security protocols are often found to be flawed after their deployment. We present an approach that aims at the neutralization or mitigation of the attacks to flawed protocols: it avoids the complete dismissal of the interested protocol and allows honest agents to continue to use it until a corrected version is released. Our approach is based on the knowledge of the network topology, which we model as a graph, and on the consequent possibility of creating an interference to an ongoing attack of a Dolev-Yao attacker, by means of non-collaboration actuated by ad-hoc benign attackers that play the role of network guardians. Such guardians, positioned in strategical points of the network, have the task of monitoring the messages in transit and discovering at runtime, through particular types of inference, whether an attack is ongoing, interrupting the run of the protocol in the positive case. We study not only how but also where we can attempt to defend flawed security protocols: we investigate the different network topologies that make security protocol defense feasible and illustrate our approach by means of concrete examples.
International audiencePower consumption is an important goal for many applica- tions, expecially when the power can be wasted doing nothing. Video surveillance is one of this application where the camera can be on for long period without "see" nothing. For this reason several power man- agement techniques were carried out in order to reduce the activities of the camera when it is not needed. In this work we focus on surveillance applications performed through Video Surveillance Camera (VSC) that are not permanently active, but need to be properly "woken-up", by speci c ultra Low Power wireless Sensor Nodes (LPSN) able to monitor continuously the area. named. The LPSN are equipped by Piezoelectric "Passive" Infrared (PIR) sensors to detect the movement, thus they have a speci c transmission range (to wirelessly send the "wake-up" messages to the camera sensor device) and a sensing range to detect events of in- terest (i.e. a man that crosses a speci c area). Di erent deployments may highly impact not only in terms of events detectable, but also in terms of the number of VDS that can be woken-up. In this work, we propose a neural/genetic algorithm, that tries to compute the best deployment of the LPSN, based on two weight factors that "prioritize" the rst ob- jective, that is the number of VSC that can be woken-up or the second objective, namely the events detectable. The two objectives can be op- posite and based on the di erent values assigned to the weight factors, di erent deployments can be obtained. The performance evaluation is realized through a simulation tool and we will show the e ectiveness of our approach to reach very e ective deployments in di erent scenarios
In the light of current developments in Information Communication Technologies, this paper presents three case studies of the usage of geo-information technologies concerning the management and recovery of historical built heritage. With reference to the experiences of the authors in Sardinia, Italy the first example reports on the impact of the Regional Spatial Data Infrastructure to the safeguard of historical built heritage in urban and regional landscape planning. The second example reports on the use of Geographic Information Systems in historical centres redevelopment. The third example deals with the development of a web-based knowledge base on the earth architectural heritage aimed at supporting its recovery and reuse. Some conclusive remarks outline the role of authoritative and volunteered sources of information in the domain of historical built heritag
Sessions on the web are fragile. They have been attacked successfully in many ways, by network-level attacks, by direct attacks on session cookies (the main mechanism for implementing the session concept) and by application-level attacks where the integrity of sessions is violated by means of cross-site request forgery or malicious script inclusion. This paper defines a variant of non-interference-the classical security notion from information flow security-that can be used to formally define the notion of client-side application-level web session integrity. The paper also develops and proves correct an enforcement mechanism. Combined with state-of-the-art countermeasures for network-level and cookie-level attacks, this enforcement mechanism gives very strong assurance about the client-side preservation of session integrity for authenticated sessions