CFIA page | Publications | Non-CS courses with Information Assurance Components | Related links

    Faculty affiliated with the Center for Information Assurance

    Martine Ceberio

    My research is centered on (numeric) constraint solving, interval computations, and optimization. As part of my research work, I also explore applications of constraints to diverse fields. In particular, part of my research is dedicated to using (soft) constraints in order to prevent cascading security leaks in computer networks.

    To some extent, my work on interval computations also contributes to information assurance since the objective in using intervals is to achieve reliability of computations as well as reproducibility.

    Yoonsik Cheon

    Cheon's research includes program specification and verification, including specification language design, program correctness reasoning and program testing. His research in Information Assurance (IA) focuses on developing formal techniques for specifying and reasoning about IA-related properties such as access control of a program. In particular, he is interested in specifying these non-functional properties of a program module as a part of the module's interface and applying the interface specification to various dynamic verification techniques such as runtime checking and dynamic testing.

    Eric Freudenthal

    I enjoy designing systems that achieve robustness through adaptation to changing constraints. My recent focus has been in decentralized systems, including mechanisms for expressing and enforcing security relationships among mutually distrustful administrative domains, securely deploying mobile agents, and the efficient dissemination of on-line content. My background also includes electrical design, architecture, interprocess coordination, and computer vision.

    Mahmud Shahriar Hossain

    My research interests lie in areas of data mining, information retrieval, and machine learning with a focus on Big Data. In my research, I emphasize on giving more control to the user by providing flexible algorithmic supports during information extraction and knowledge discovery phases. Along with development of theoretical algorithmic frameworks, I am interested in building prototypes to solve data mining problems in different disciplines. My research spans many application areas including intelligence analysis, national security, social network analysis, biomedical science, sustainability, software engineering, and mechanical engineering.

    Christopher Kiekintveld

    My research interests are in methods for designing intelligent systems/agents and applying these methods to real world problems. I am particularly interested in applications of decision and game-theoretic agents to problem in security, broadly defined. One area that I work in is developing models and algorithms for optimally randomizing the scheduling and allocation of security resources. For example, this includes optimizing patrolling strategies for protecting physical infrastructure, as well as optimizing intrusion detection strategies in computer networks. I am also interested in the use of secrecy, deception, and strategic surprise in security. For example, we have studied game-theoretic methods for optimizing the use of honeypots (fake hosts or services) in securing computer networks.

    Vladik Kreinovich

    My main area of interest is interval computations and, more generally, data processing under uncertainty. An important particular case of this problem is when we introduce uncertainty (e.g., interval uncertainty) on purpose, to guarantee privacy. If we perform this operation in a statistical database, we face a computational problem of computing statistical characteristics for data known with interval uncertainty. This problem is currently one of the main directions of my research. I am especially interested in data processing in cyberinfrastructure.

    Luc Longpré

    My main area of interest is privacy. Since this topic has become so important to Information Assurance, I am often surprised by the scarcity of reasonable formal definitions of privacy. The various protocols that pertain to protecting privacy usually have a binary approach to privacy: either there is a breach of privacy or there isn't. We are studying various definitions designed to measure the loss of privacy. We are also interested in privacy preservation in statistical databases and in privacy preservation when accessing databases in general, revealing the minimum amount of information necessary to accomplish a goal.

    Salamah Salamah

    Dr. Salamah spent five and a half years as an assistant and later associate professor in Computer Science and Software Engineering at Embry-Riddle Aeronautical University. He joined UTEP in January 2013 to direct the Software Engineering Master's program. His teaching and research interests include software engineering process, software quality assurance for safety-critical systems, and formal methods in software development. His research has been supported by NASA, the Software Engineering Institute (SEI), the National Science Foundation (NSF), Honeywell Corporation, and Lockheed Martin Corporation.