Formal verification of security protocol implementations: a survey

Automated formal verification of security protocols has been mostly focused on analyzing high-level abstract models which, however, are significantly different from real protocol implementations written in programming languages. Recently, some researchers have started investigating techniques that bring automated formal proofs closer to real implementations. This paper surveys these attempts, focusing on approaches that target the application code that implements protocol logic, rather than the libraries that implement cryptography. According to these approaches, libraries are assumed to correctly implement some models. The aim is to derive formal proofs that, under this assumption, give assurance about the application code that implements the protocol logic. The two main approaches of model extraction and code generation are presented, along with the main techniques adopted for each approach.     

The use of games to help children eyes testing

A doctor cannot perform a good diagnosis without the patient collaboration. One of the major problem for ophthalmologists with children is to capture and maintain their attention while performing their tests. Sometimes children give wrong answers, or not accurate, since they are no longer interested in the task. In this paper we use the serious game paradigm to help children eyes testing. We ask the children to perform a vision acuity and a daltonism test using our game PlayWithEyes. Children have to recognize symbols projected on a wall and point them in a touch interface which displays all the possible answers. Tests performed in a kindergarten with 65 children have shown that the use of our game helps to obtain children cooperation because they have fun, so their attention may last longer, thus improving the possibility to perform a correct diagnosis especially for very young children. This is particular important for some sight defects like amblyopia (lazy eye). Moreover, the system allows us to identify visual acuity reduction in two children. Tests also highlight some limitations of the tool which have been promptly fixed.     

Deductive verification of alternating systems

Alternating systems are models of computer programs whose behavior is governed by the actions of multiple agents with, potentially, different goals. Examples include control systems, resource schedulers, security protocols, auctions and election mechanisms. Proving properties about such systems has emerged as an important new area of study in formal verification, with the development of logical frameworks such as the alternating temporal logic ATL*. Techniques for model checking ATL* over finite-state systems have been well studied, but many important systems are infinite-state and thus their verification requires, either explicitly or implicitly, some form of deductive reasoning. This paper presents a theoretical framework for the analysis of alternating infinite-state systems. It describes models of computation, of various degrees of generality, and alternating-time logics such as ATL* and its variations. It then develops a proof system that allows to prove arbitrary ATL* properties over these infinite-state models. The proof system is shown to be complete relative to validities in the weakest possible assertion language. The paper then derives auxiliary proof rules and verification diagrams techniques and applies them to security protocols, deriving a new formal proof of fairness of a multi-party contract signing protocol where the model of the protocol and of the properties contains both game-theoretic and infinite-state (parameterized) aspects.     

Reducing false positives in anomaly detectors through fuzzy alert aggregation

In this paper we focus on the aggregation of IDS alerts, an important component of the alert fusion process. We exploit fuzzy measures and fuzzy sets to design simple and robust alert aggregation algorithms. Exploiting fuzzy sets, we are able to robustly state whether or not two alerts are “close in time”, dealing with noisy and delayed detections. A performance metric for the evaluation of fusion systems is also proposed. Finally, we evaluate the fusion method with alert streams from anomaly-based IDS.     

FreesoundVR: soundscape composition in virtual reality using online sound repositories

Virtual Reality - The intersection between sound and music computing and Virtual Reality (VR) has grown significantly over the past decades, amounting to an established area of research today....     

Plasmon hybridization engineering in self-organized anisotropic metasurfaces

Nano Research - The engineering of self-organized plasmonic metasurfaces is demonstrated using a maskless technique with defocused ion-beam sputtering and kinetically controlled deposition. The...     

Integratable non-clogging microconcentrator based on counter-flow principle for continuous enrichment of CaSki cells sample

This study addresses the need to reduce the risk of clogging when preparing samples for cell concentration, i.e., the CaSki Cell-lines (epidermoid cervical carcinoma cells). Aiming to develop a non-clogging microconcentrator, we proposed a new counter-flow concentration unit characterized by the directions of penetrating flows being at an obtuse angle to the main flow, due to employment of streamlined turbine blade-like micropillars. Based on the optimization results of the counter-flow unit profile, a fractal arrangement for the counter-flow concentration unit was developed. A counter-flow microconcentrator chip was then designed and fabricated, with both the processing layer and collecting layer arranged in terms of the honeycomb structure. Visualized experiments using CaSki cell samples on the microconcentrator chip demonstrated that no cell-clogging phenomena occurred during the test and that no cells were found in the final filtrate. The test results show an excellent concentration performance for the microconcentrator chip, while a concentrating ratio of >4 with the flow rate being below 1.0 ml/min. As only geometrical structure is employed in the passive device, the counter-flow microconcentrator can be easily integrated into advanced microfluidic systems. Owing to the merit of non-clogging and continuous processing ability, the counter-flow microconcentrator is not only suitable for the sample preparation within biomedical field, but also applicable in water-particle separation.     

Computational study on the interaction of a ring-hydroxylating dioxygenase from Sphingomonas CHY-1 with PAHs

The massive computational resources available in the framework of a grid paradigm approach represent an emerging tool in the bioinformatics field. In this paper, we used the above approach in the rapid determination of the interactions between the ring-hydroxylating dioxygenase, comprised six enzymatic subunits, and polycyclic aromatic hydrocarbons (PAHs) in their optimal positions. The results were obtained by simulating enzyme dynamics at 300 K through molecular dynamics calculations. For the first time, the equilibrated structure of the dioxygenase revealed a network of channels throughout the enzyme that were sufficiently large to allow a flow of small ions or molecules from the inner core of the complex to its exterior surface. The ring-hydroxylating dioxygenase was able to interact with some of the studied PAHs. Additionally, not only the number of aromatic rings but also the PAH shape were critical in predicting the ability of the dioxygenase to interact with these types of molecules. Docking calculations shed light on a new possible binding site that is far from the enzymatic one, which is potentially interesting in considering the stability of the enzyme itself.     

Stochastic algorithms for robustness of control performances

In recent years, there has been a growing interest in developing statistical learning methods to provide approximate solutions to “difficult” control problems. In particular, randomized algorithms have become a very popular tool used for stability and performance analysis as well as for design of control systems. However, as randomized algorithms provide an efficient solution procedure to the “intractable” problems, stochastic methods bring closer to understanding the properties of the real systems. The topic of this paper is the use of stochastic methods in order to solve the problem of control robustness: the case of parametric stochastic uncertainty is considered. Necessary concepts regarding stochastic control theory and stochastic differential equations are introduced. Then a convergence analysis is provided by means of the Chernoff bounds, which guarantees robustness in mean and in probability. As an illustration, the robustness of control performances of example control systems is computed.