Organization:
Computer Science (CS)

orgunit.page.dateEstablished

1977

Description

The mission of the Computer Science department is to provide defense-relevant, advanced education and research programs to meet Naval unique needs, and increase the warfighting effectiveness of the U.S. Naval Forces, DoD and allied armed forces.
Prior to 1977 this department was known as the Computer Science Academic Group.

Type

Department

Website of the organization

https://nps.edu/web/cs

Full item page

Publication Search Results

Now showing 1 - 10 of 163

Requirements for self-stabilization of distributed advanced battle managers
(Monterey, California. Naval Postgraduate School, 2006-09-15) Cook, Thomas S.; Michael, James Bret; Xie, Geoffrey G.; Auguston, Mikhail; Shing, Man-Tak; Tummala, Harsha; Wijesekera, Duminda; Computer Science (CS); Graduate School of Operational and Information Sciences (GSOIS); Missile Defense Agency (U.S.); Computer Science
In this report, we formalize the self-stabilization problem as it pertains to the C2BMC, in addition to highlighting some of key features of the C2BMC that distinguish it from general-purpose distributed systems. We then describe a sub-area of self-stabilization known as the leader election problem, pointing out the issues tied to the re-establishment of an ABM command and control structure in the event of system faults. We performed an initial survey of a small sample of recent articles from the open literature on leader election algorithms; we found that there are over 10,000 articles on the leader election problem. The report includes a critique of each of the surveyed articles. Our report concludes with recommendations for both a framework of a leader election protocol that could be applied to the C2BMC and specific directions of further research to be conducted.-- p. v.
DNS and Multilevel Secure Networks: architectures and recommendations
(Monterey, California. Naval Postgraduate School, 2009-02) Clark, Paul C.; Levin, Timothy E.; Irvine, Cynthia E.; Shifflett, David J.; Computer Science (CS); Graduate School of Operational and Information Sciences (GSOIS); Computer Science (CS)
The Domain Name System (DNS) protocol was introduced to solve a naming problem in TCP/IP networking, namely, to provide a translation service of system names to network addresses (i.e., Internet Protocol (IP) addresses). The protocol was not developed with a requirement to support multilevel secure (MLS) networks. However, the Department of Defense (DoD) vision for the Global Information Grid (GIG) entails support for multilevel networks. In the future, DNS installations must securely deal with multilevel issues. This paper describes specific design recommendations for providing MLS DNS in the context of the GIG Vision, and the Monterey Security Architecture (MYSEA) Testbed. It also describes several other potential MLS DNS architectures along with their advantages and disadvantages.
A security domain model for implementing trusted subject behaviors
(Monterey, California. Naval Postgraduate School, 2008-09-19) Shaffer, Alan B.; Irvine, Cynthia E.; Levin, Timothy E.; Auguston, Mikhail; Computer Science (CS); Graduate School of Operational and Information Sciences (GSOIS); Office of Naval Research; National Science Foundation (U.S.); Computer Science
Within a multilevel secure (MLS) system, trusted subjects are granted privileges to perform operations that are not possible by ordinary subjects controlled by mandatory access control (MAC) policy enforcement mechanisms. These subjects are trusted not to conduct malicious activity or degrade system security. We present a formal definition for trusted subject behaviors, which depends upon a representation of information flow and control dependencies generated during a program execution. We describe a security Domain Model (DM) designed in the Alloy specification language for conducting static analysis of programs to identify illicit information flows, access control flaws and covert channel vulnerabilities. The DM is compiled from a representation of a target program, written in an intermediate Implementation Modeling Language (IML), and a specification of the security policy written in Alloy. The Alloy Analyzer tool is used to perform static analysis of the DM to detect potential security policy violations in the target program. In particular, since the operating system upon which the trusted subject runs has limited ability to control its actions, static analysis of trusted subject operations can contribute to the security of the system.
A model for merging software prototypes
(Monterey, California. Naval Postgraduate School, 1992) Dampier, David A.; Luqi; Computer Science (CS); Graduate School of Operational and Information Sciences (GSOIS); Computer Science (CS)
As software becomes more complex, more sophisticated development and maintenance methods are needed to ensure software quality. Computer Aided Prototyping achieves this via quickly built and iteratively updated prototypes of the intended system. This process requires automated support for keeping track of many independent changes and for exploring different combinations of alternative changes and refinements. This paper formalizes the update/change merging process and extends the idea to multiple changes to the same base prototype. Applications of this technology include: automatic updating of different versions of existing software with changes made to the baseline version of the system; integrating changes made by different design teams during development; and checking consistency after integration of seemingly disjoint changes to the same software system.... Software, Automation, Computer aided prototyping, Maintenance, Formal models, Software engineering, Software merging, Change integration, Case tools
Providing cryptographic security and evidentiary chain-of-custody with the advanced forensic format, library, and tools
(Monterey, California. Naval Postgraduate School, 2008-08-19) Garfinkel, Simson L.; Computer Science (CS); Graduate School of Operational and Information Sciences (GSOIS); Computer Science
This paper presents improvements in the Advanced Forensics Format Library version 3 that provide for digital signatures and other cryptographic protections for digital evidence, allowing an investigator to establish a reliable chain-of-custody for electronic evidence from the crime scene to the court room. No other system for handling and storing electronic evidence currently provides such capabilities. This paper discusses implementation details, user level commands, and the AFFLIB programmer's API.
Data integrity limitations in hybrid security architectures
(Monterey, CA; Naval Postgraduate School, 2000-12) Irvine, Cynthia; Levin, Timothy; Computer Science (CS); Graduate School of Operational and Information Sciences (GSOIS); Naval Postgraduate School (U.S.); Computer Science (CS)
We discuss a class of computer/network architectures that supports multilevel security and commercial applications, while utilizing primarily commercial-off-the-shelf (COTS) workstations, operating systems and hardware components. We show that a property of these architectures is that, while they are capable of supporting multilevel confidentiality policies, they do not generally support partially ordered integrity policies: specifically, these architectures do not support the maintenance of data that is higher in integrity than the integrity level of the COTS components, thus limiting their applicability to processing environments where the integrity of data is consistent with that of low-assurance software.
Decision Support for Formal Method Selection
(Naval Postgraduate School, 2002-07) Zhang, Lynn; Computer Science (CS); Graduate School of Operational and Information Sciences (GSOIS); Computer Science (CS)
A Proposed Design for a Rapid Prototyping Language
(Naval Postgraduate School, 1989) Luqi; Berzins, V.; Kraemer, B.; White, L.; Computer Science (CS); Graduate School of Operational and Information Sciences (GSOIS); Computer Science (CS)
We propose to develop a new rapid prototyping language (RPL) for a wide range of software, including real-time, parallel, distributed, and knowledge-based systems. RPL is intended as a tool for aided the development of large Ada systems. Rapid development will be achieved by a combination of a clear and simple language with a suitable computational model, graphical design representations, executable logical specifications, reusable software components, automated code $eneratio11, and specialized scheduling algorithms.
Basic hardware interconnection mechanisms for building multiple microcomputer systems
(Monterey, California. Naval Postgraduate School, 1979-11) Carey, Bernard J.; McCoy, Earl E.; Computer Science (CS); Graduate School of Operational and Information Sciences (GSOIS); Computer Science
This report presents the current results of a research project which has been concerned with methods for designing and implementing multiple microcomputer systems. The design method is based upon identifying hardware interconnection primitives which may be used to construct the interconnection subsystem which characterizes a given multicomputer architecture. An actual experimental system has been constructed which will permit building nine of ten systems in the Anderson and Jensen architecture taxonomy. (Author)
A stochastic approach to the weighted-region problem : 1. the design of the path annealing algorithm
(Monterey, CA; Naval Postgraduate School, 1991-06) Kindl, Mark R.; Rowe, Neil C.; Shing, Man-Tak; Computer Science (CS); Graduate School of Operational and Information Sciences (GSOIS); Naval Postgraduate School (U.S.); Computer Science
This paper presents an efficient heuristic algorithm for planning near-optimal high-level paths for a point agent through complex terrain modeled by the Weighted-Region Problem. The input to the Weighted-Region Problem is a set of non-overlapping convex homogeneous-cost regions on a two dimensional plane. Each region is associated with a cost coefficient (or weight), which indicates the relative cost per unit distance of movement in that region by the point agent. The weighted distance between two points in a convex region is the product of the corresponding cost coefficient and the Euclidean distance between them. Given a start and a goal point on the plane, the objective of the Weighted-Region Problem is to find a minimum cost path from start to goal through the weighted regions. We have designed and developed a very efficient algorithm for finding near-optimal solutions for the Weighted-Region Problem using a combination of the classical artificial intelligence heuristic search techniques and the probabilistic combinatorial optimization technique called simulated annealing. Extensive test results (to be presented in Part II of the paper) indicate that the new algorithm runs much faster than previous known techniques with a very minimal sacrifice in optimality