The paper considers how one score hence will be an era of communication networks that will affect the lives of most of the people on the planet and will affect those in the developed countries profoundly. Communications technology is tightly bound with the development of society and culture, and the coming changes in network speed and availability will drive changes in the way we perceive the world.

With the increasing growth of electronic communications, it is becoming important to provide a mechanism for enforcing various security policies on network communications. This paper discusses our implementation of several previously proposed protocols that enforce the Bell-LaPadula (1973) security model. We also introduce a new protocol called "Quantized Pump" that offers several advantages, and present experimental results to support our claims.

Security and privacy are growing concerns in the Internet community, due to the Internet's rapid growth and the desire to conduct business over it safely. This desire has led to the advent of several proposals for security standards, such as secure IP, secure HTTP, and the Secure Socket Layer. All of these standards propose using cryptographic protocols such as DES and RSA. Thus, the need to use encryption protocols is increasing. Shared-memory multiprocessors make attractive server platforms, for example as secure World-Wide Web servers. These machines are becoming more common, as shown by recent vendor introductions of platforms such as SGI's Challenge, Sun's SPARCCenter, and DEC's AlphaServer. The spread of these machines is due both to their relative ease of programming and their good price/performance. This paper is an experimental performance study that examines how encryption protocol performance can be improved by using parallelism. We show linear speedup for several different Internet-based cryptographic protocol stack running on a symmetric shared-memory multiprocessor using two different approaches to parallelism.

This paper discusses the necessity of bringing security measures to very complex systems, and some ideas for how to do so.It has long been the hope that we would never reach such a situation -that security technology would eventually succeed in harnessing software technology and bringing it to heel.This has not happened, and it is now time to expand security technology to cope with the seemingly intractable problems of huge heterogeneous systems.The consideration of paradigms from other fields may be useful.This paper hopes to motivate research into a fundamental and difficult problem that affects Internet security today: unpredicted or unintended dynamic behavior that can degrade or destroy the ability of the network to deliver messages.We will argue that the source of the problem is hidden variables that adversely affect composition of network systems at any service level: physical, link, network, transport, application, and even the end-user.

This paper describes the architecture of a prototype multilevel secure windowing system based on the X Window System. The prototype, known as TX, is designed to meet the class B3 architectural requirements of the Trusted Computer System Evaluation Cr

The early issues, obstacles, and ultimate achievements of Phase II of the US DARPA Advanced Computing Systems project to develop a proof-of-concept prototype for a B3 X-Window system on a TMach base are described. The present work defines initial project goals, presents an overview of X, and describes system objectives. The major implications of meeting the B3 trust criteria and the constraints of building the Trusted X prototype on the TMach system (itself a prototype) are described. The reader is led through the process of Trusted X evolution from an initial architecture requiring a large and complex TCB to an architecture based on task polyinstantiation greatly simplifying the TCB.>

Multilevel secure windowing systems are a key technology for the 1990s. The authors have spent 20 months designing and implementing a prototype of a multilevel secure X Window System as a proof of concept vehicle for their software engineering process model for the development of trusted systems. The prototype is targeted to B3 evaluation criteria. In the early stages many doubted that B3 was achievable for a windowing system (especially X); the prototype demonstrates that B3 is achievable. The paper describes the goals, the architecture of the system, and some of the trade-offs made to achieve the goals. It also contrasts the work with existing compartmented mode workstations (CMW) windowing systems.>

The FM8501 microprocessor was defined and verified by W.A. Hunt (1986) using the Boyer-Moore theorem-prover. The authors have carried out a reverification of the machine using the State Delta Verification System. Their work correlates strongly with work done by Hunt, demonstrating that the verification community is capable of supporting its own results, drawing on the diversification of proof tools to provide independent validation of previous work. The proof strategies and the complexities that are encountered in proving correctness of microcoded processors are discussed.>