Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Security Components and Mechanisms

We integrate and apply security technologies, standards, guidelines and best practices for computing platforms and information systems.

Overview

The Security Components and Mechanisms (SCM) Group’s security research focuses on the development and management of foundational building-block security mechanisms and techniques that can be integrated into a wide variety of mission-critical U.S. information systems. The group’s work spans a spectrum from near-term hardening and improvement to the design and analysis of next-generation, leapahead security capabilities. Computer security depends fundamentally on the level of trust that can be established for computer software and systems. This work, therefore, focuses strongly on assurance building activities ranging from the analysis of software configuration settings to advanced trust architectures to testing tools that surface flaws in software modules.

For more information regarding the The Security Components and Mechanisms Group, visit the CSRC website.

Projects / Programs

Publications

Measuring the Common Vulnerability Scoring System Base Score Equation

Author(s)
Peter Mell, Jonathan Spring, Dave Dugal, Srividya Ananthakrishna, Francesco Casotto, Troy Fridley, Christopher Ganas, Arkadeep Kundu, Phillip Nordwall, Vijayamurugan Pushpanathan, Daniel Sommerfeld, Matt Tesauro, Christopher Turner
This work evaluates the validity of the Common Vulnerability Scoring System (CVSS) Version 3 ''base score'' equation in capturing the expert opinion of its

A characterization of the Centers of Chordal Graphs

Author(s)
James Shook, Bing Wei
A graph is $k$-chordal if it does not have an induced cycle with length greater than $k$. We call a graph chordal if it is $3$-chordal. Let $G$ be a graph. The

Awards

Contacts

Group Manager: