This project seeks to create trustworthy peer-to-peer overlay systems through fundamental advances to the state-of-the-art in the design of Internet-scale, overlay networks for performance-demanding applications in the presence of adversaries. Design limitations in popular peer-to-peer systems today may be exploited to cause large-scale denial of service attacks on nodes not even part of the overlay system. Further, adversaries may control the overlay construction to create a crippling impact on application performance. To tackle this, the project will (i) Design robust and attacker resilient adaptation protocols contributing to an emerging science of trustworthy adaptability that defines a new shift in building distributed systems; (ii) Obtain fundamental insights into the interplay between the design of group management algorithms and their vulnerability to being exploited to launch distributed denial of service attacks on the Internet; (iii) Explore the interactions between peer-to-peer design, resulting traffic characteristics, and implications for distinguishing normal peer-to-peer traffic patterns from anomalous ones; and (iv) Design mechanisms for reliable, scalable and adversary-resilient key dissemination to help ensure confidentiality and integrity of application-specific data.
The project will demonstrate and validate the novel proposed mechanisms in the context of mature and widely deployed peer-to-peer systems. Peer-to-peer video broadcasting will be used to promote online education in the Lafayette area, and to broadcast a security-related seminar series. The project will benefit the design of large-scale testbeds such as GENI. The PIs will communicate with developers of popular peer-to-peer systems to alert them to critical design vulnerabilities in their systems.
Despite the rapid growth of distributed shared infrastructures such as PlanetLab and the Grid, a gap exists between the current practice and their full potential. Especially, many users wish to obtain their “own space” with full privilege in a shared infrastructure to run arbitrary distributed applications. This research introduces the concept of “virtual distributed environments” (VDEs) as a new sharing paradigm for distributed infrastructures. Based on virtualization technologies, VDEs are autonomic, mutually isolated entities, providing individual users with privileged, customized, and confined distributed environments. To realize this vision, the following new research challenges are being addressed: (1) distributed environment virtualization and logistics, (2) shepherded self-adaptation of virtual distributed environments, and (3) trusted monitoring and logging of virtual distributed environments. Solutions to these challenges are evaluated in a number of real-world application scenarios, including computer system emulation for education, e-Science service for the nanotechnology research community, and virtual playgrounds for Internet worm observation, investigation, and defense. In particular, the research and education activities of this work are closely related. Leveraging the research results, an education platform is being developed for distributed and network systems emulation. It provides students with hands-on system experience that would otherwise require expensive, dedicated equipment. This research will open the door to new opportunities for application/service deployment and distributed system experimentation. The realization of VDE will encourage public use of the emerging cyberinfrastructure by accommodating a wide range of science and engineering activities including education and research portals, virtual collaboratories, and cyber-defense testing grounds.
Analysts need mechanisms to disambiguate regulations so they may be clearly specified as software requirements. Additionally, those responsible for certifying compliance within relevant systems need controls and assurances that measure conformance with policies and regulations. Our goal is to develop methods, tools, and procedures to help software designers and policy makers achieve transparency and consistency by bringing regulations, policies and system requirements into better alignment.
Results: There are three main expected results of this work. First, we will produce tools to assist software designers in determining a clear set of actionable requirements for system design and access control from regulations and legislation. Second, we will produce methods to develop audit mechanisms and procedures that may be used to verify that a functioning system meets its requirements. This will aid organizations as they conduct policy and legal compliance. Third, we will develop a realistic corpus of synthetic electronic patient record data that can be used to test any such experimental system. We will make this available so that other researchers can use it.
In December of 2004 a US Marine is severely wounded during combat operations in Iraq. After receiving world class treatment at Bethesda Naval Hospital and the Indianapolis VA medical center, the patient is able to carry on a normal civilian life in Indianapolis. Several months later the veteran gets in an accident and is transported via medi-vac to a non-VA facility trauma center in Indianapolis for care. The provider looks up the patient’s data using the Indiana Health Information Exchange and the patient has a highly positive outcome. This outcome is only because critically important medical data was made available to the provider at the right time via a collaborative database between local hospitals. This scenario is only possible if VA hospitals can securely manage sharing of data between non VA health care facilities and themselves. The security schema the VA needs to meet this is a highly secure, manageable, portable, scalable, granular to the record & field level and most importantly cost effective security architecture.
It is with great enthusiasm we present the VISTALOCK security schema to the Department of Veterans Affairs. The scientists who have invented this technology are offering the Department of Veterans Affairs the opportunity to collaborate with them by implementing the already developed and proven technology across the VA Health Care domain. The VISTALOCK security architecture, using TEGO technology, is designed to be flexible and adaptable to support the security needs of VA and ALL of its national, regional and local affiliates.
VISTALOCK addresses four major security functions needed in collaborative data exchange and sharing, that is, Hierarchical Access Control (HAC), Secure Group Communication (SGC); Differential Access Control (DAC); Secure Dynamic Conferencing (SDC), enforces confidentiality, integrity, authentication, and fine tuned authorized access of patient records with granularity to the field and record level based on Cryptography and Key Management, and provides the capabilities of scalability, efficiency, dynamics, flexibility, and transparence.
The VISTALOCK security system is a bolt on security architecture that works in addition to the existing system(s) for which it protects, it will require no changes to the VISTA database repository and will act as a security gateway for all VISTA data traffic between the client and host. The VA will be able to apply best of breed technology to its security architecture, by providing modular and portable security services to the Vista/HealtheVET system. This enables the VA to continue full speed ahead with HealtheVET development as planned while still enabling secured collaborative data sharing capabilities to its architecture with external local health care facilities and practices.
The Orange Book defines a covert channel to be “any communication channel that can be exploited by a process to transfer information in a manner that violates the system’s security policy.” A covert timing channel is a type of covert channel in which sensitive information is transmitted by the timing of events. In a networked environment, a covert timing channel can be used by a program that has access to sensitive information to leak the information through packet inter-transmission times. From a positive standpoint, such a covert communication channel can be used by people living under oppressive regimes to communicate safely. Designing and implementing timing channels over a shared network between two distant computers is challenging. Network timing channels are inherently “noisy” due to the delay and jitter in networks, which distort the timing information from the sender when it reaches the receiver. In prior work, a simple IP covert timing channel was implemented using an on-off coding scheme, where the reception or absence of a packet within a time interval signals bit 1 or bit 0, respectively. This timing channel achieved a data rate of 16.67 bits/sec between two computers located at two universities with an average round trip time of 31.5 ms.
We are interested in designing covert timing channels that significantly improve the data rate. Our second goal is to design a computationally non-detectable timing channel scheme. In our design, we use packet inter-transmission times to convey information. A malicious process on the sender side manipulates the inter-transmission times and another malicious process either at the receiver or en route to the receiver can decode the privileged information by observing the inter-reception times. We encode L-bit binary strings in a sequence of n packet inter-transmission times T1, T2, · · · , Tn. We call it the “L-bits to n-packets” scheme. These n packets are transmitted in variable length time intervals. The receiver will then map the n packet inter-reception times R1,R2, · · ·,Rn back to an L-bit binary string according to the code book. We analytically determine L and n, based on experimental measurements of network characteristics, such as maximum jitter. The choice makes the data rate of our scheme to be near optimal and demonstrates significant performance improvement (2 to 5 times the covert timing channel data rate) of our scheme over the prior state-of-the-art.
Our second contribution is to systematically develop a computationally non-detectable timing channel scheme, assuming the packet intertransmission time is independent and identically distributed (i.i.d). Our design is based on the security of the cryptographically secure pseudo random number generators (CSPRNG). The packet intertransmission times from the proposed timing channel are devised to mimic any legitimate traffic with i.i.d. packet inter-transmission time. This allows two parties to communicate at a low data rate (e.g., 5 bits/sec) in a hostile environment such as in battlefield or law enforcement settings while avoiding detection.
In ongoing work, we are developing non-detectable timing channels for more general classes of normal traffic, such as Markov-chain and long-range dependent normal traffic. We are also exploring non-timing methods of conveying covert information, such as through changing the order in which packets are sent, such that they fall within the bounds of possible operation of commonly-used protocols such as TCP, but are usable for conveying information covertly.
This project is investigating linguistic extensions to map/reduce abstractions for programming large-scale distributed systems, with special focus on applications that manipulate large, unstructured graphs. It targets real-world graph analysis tasks found in comparative analysis of biological networks as an important case study.
The project is investigating the following specific questions: (i) how can highly unstructured graph-based formalisms be cast in the map/reduce framework? (ii) how effectively can these specifications leverage existing map/reduce infrastructure? (iii) how can these abstractions and their execution environments be enhanced to provide the semantic expressiveness necessary for programmability and scalable performance? (iv) how can these analysis tasks be integrated into comprehensive scientific resources usable by the wider applications community? Answers to these questions entails exploring linguistic extensions to existing map/reduce abstractions, defining new implementations on wide-area multicore/SMP platforms, and crafting an expressive graph analysis toolkit suitable for realistic deployment in important domains such as systems biology.
Results that arise from this project advance the state-of-the-art in analysis of large sparse unstructured graphs and directly impact a very broad class of scientific applications. Beyond specific target applications in biology, graph-based formalisms find direct applications in social sciences (social networks), recommender systems, and commerce (networks of transactions).