SLC26A9 as a Potential Modifier and Therapeutic Target in Cystic Fibrosis Lung Disease

SLC26A9 belongs to the solute carrier family 26 (SLC26), which comprises membrane proteins involved in ion transport mechanisms. On the basis of different preliminary findings, including the phenotype of SlC26A9-deficient mice and its possible role as a gene modifier of the human phenotype and treatment response, SLC26A9 has emerged as one of the most interesting alternative targets for the treatment of cystic fibrosis (CF). However, despite relevant clues, some open issues and controversies remain. The lack of specific pharmacological modulators, the elusive expression reported in the airways, and its complex relationships with CFTR and the CF phenotype prevent us from conclusively understanding the contribution of SLC26A9 in human lung physiology and its real potential as a therapeutic target in CF. In this review, we summarized the various studies dealing with SLC26A9 expression, molecular structure, and function as an anion channel or transporter; its interaction and functional relationships with CFTR; and its role as a gene modifier and tried to reconcile them in order to highlight the current understanding and the gap in knowledge regarding the contribution of SLC26A9 to human lung physiology and CF disease and treatment

Batalin-Vilkovisky Integrals in Finite Dimensions

The Batalin-Vilkovisky method (BV) is the most powerful method to analyze functional integrals with (infinite-dimensional) gauge symmetries presently known. It has been invented to fix gauges associated with symmetries that do not close off-shell. Homological Perturbation Theory is introduced and used to develop the integration theory behind BV and to describe the BV quantization of a Lagrangian system with symmetries. Localization (illustrated in terms of Duistermaat-Heckman localization) as well as anomalous symmetries are discussed in the framework of BV.Comment: 35 page

Many-to-Many Information Flow Policies

Information flow techniques typically classify information according to suitable security levels and enforce policies that are based on binary relations between individual levels, e.g., stating that information is allowed to flow from one level to another. We argue that some information flow properties of interest naturally require coordination patterns that involve sets of security levels rather than individual levels: some secret information could be safely disclosed to a set of confidential channels of incomparable security levels, with individual leaks considered instead illegal; a group of competing agencies might agree to disclose their secrets, with individual disclosures being undesired, etc. Motivated by this we propose a simple language for expressing information flow policies where the usual admitted flow relation between individual security levels is replaced by a relation between sets of security levels, thus allowing to capture coordinated flows of information. The flow of information is expressed in terms of causal dependencies and the satisfaction of a policy is defined with respect to an event structure that is assumed to capture the causal structure of system computations. We suggest applications to secret exchange protocols, program security and security architectures, and discuss the relation to classic notions of information flow control

Engineering Semantic Self-composition of Services Through Tuple-Based Coordination

Service self-composition is a well-understood research area focusing on service-based applications providing new services by automatically combining pre-existing ones. In this paper we focus on tuple-based coordination, and propose a solution leveraging logic tuples and tuple spaces to support semantic self-composition for services. A full-stack description of the solution is provided, ranging from a theoretical formalisation to a technologically valuable design and implementation

A Multiset Rewriting Model for Specifying and Verifying Timing Aspects of Security Protocols

Catherine Meadows has played an important role in the advancement of formal methods for protocol security verification. Her insights on the use of, for example, narrowing and rewriting logic has made possible the automated discovery of new attacks and the shaping of new protocols. Meadows has also investigated other security aspects, such as, distance-bounding protocols and denial of service attacks. We have been greatly inspired by her work. This paper describes the use of Multiset Rewriting for the specification and verification of timing aspects of protocols, such as network delays, timeouts, timed intruder models and distance-bounding properties. We detail these timed features with a number of examples and describe decidable fragments of related verification problems

Timing attacks: symbolic framework and proof techniques

We propose a framework for timing attacks, based on (a variant of) the applied-pi calculus. Since many privacy properties, as well as strong secrecy and game-based security properties, are stated as process equivalences, we focus on (time) trace equivalence. We show that actually, considering timing attacks does not add any complexity: time trace equivalence can be reduced to length trace equivalence, where the attacker no longer has access to execution times but can still compare the length of messages. We therefore deduce from a previous decidability result for length equivalence that time trace equivalence is decidable for bounded processes and the standard cryptographic primitives. As an application, we study several protocols that aim for privacy. In particular, we (automatically) detect an existing timing attack against the biometric passport and new timing attacks against the Private Authentication protocol

Simulative analysis of saturation condition in a pedestrian ad-hoc network

In this paper, we consider a particular type of wireless ad-hoc networks, namely Pedestrian Ad-hoc NETworks (PANETs), where all nodes in the network are sources and destinations of information. In particular, we refer to an application where nodes report their presence by broadcasting an hello message to all other nodes in both IEEE 802.11 monodimensional and bidimensional scenarios. The system performance, in terms of throughput and delay, is analyzed using a recently proposed broadcasting protocol, namely Irresponsible Forwarding (IF) and its extension, denoted as Silencing IF (SIF). The proposed framework allows to determine a critical hello generation rate below which multi-source broadcasting is efficient