Computing & Information Sciences

Discovering new, innovative methods and research opportunities in solving complex present-day and future computing challenges.

Covert Channel in HTTP User-Agents

A subliminal covert channel establishes a nearly undetectable communication session within a pre-established data stream between two separate entities. This document explains how HTTP can be utilized to facilitate a covert channel over both local and wide area networks. The Hypertext Transfer Protocol (HTTP) accounts... READ MORE

A Hands-On Approach to Computing Security Education: Metasploit Module Development

As the demand for skilled computer security professionals continues to increase, curricula at colleges and universities must continually evolve to meet current industry needs. Incorporating Metasploit module development into these curricula increases the value of the education received by the graduate and makes them a... READ MORE

Computation of the Ramsey Numbers R(C_4, K_9) and R(C_4, K_10)

The Ramsey number R(C4, Km) is the smallest n such that any graph on n vertices contains a cycle of length four or an independent set of order m. With the help of computer algorithms we obtain the exact values of the Ramsey numbers R(C4,... READ MORE

On Some Three-Color Ramsey Numbers for Paths

For graphs G1, G2, G3, the three-color Ramsey number R(G1, G2, G3) is the smallest integer n such that if we arbitrarily color the edges of the complete graph of order n with 3 colors, then it contains a monochromatic copy of Gi in color... READ MORE

On bipartization of cubic graphs by removal of an independent set

We study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set I. It can be expressed as follows: Given a connected n-vertex tripartite cubic graph Q = (V, E) with independence number α(Q), does Q contain... READ MORE

A Small Step Forwards on the Erd˝os-S´os Problem Concerning the Ramsey Numbers R(3, k)

Let ∆s = R(K3, Ks) − R(K3, Ks−1), where R(G, H) is the Ramsey number of graphs G and H defined as the smallest n such that any edge coloring of Kn with two colors contains G in the first color or H in the... READ MORE

An Extended Discussion on a High-Capacity Covert Channel for the Android Operating System

In “Exploring a High-Capacity Covert Channel for the Android Operating System” [1], a covert channel for communicating between different applications on the Android operating system was introduced and evaluated. This covert... READ MORE

Nurturing Play-Makers & Active Investigative Agents: Schwartz Tag, Good Video Games and Futures of Jewish Learning

How can an experiential approach to education, in combination with a games-based orientation, help us reach often-elusive educational goals? In many ways the study of games and game design bring us back to tenets of education that we have long known, including the benefits of... READ MORE

Building a Network for Early Career Scholars of Games and Learning

The Early Career Workshop brought together scholars from around the North America, to meet, share research, consider potential collaboration and sow the seeds of the network they will grow together. It is the initial workshop that will be the launching point for the creation of... READ MORE

PLOMaR: An Ontology Framework for Context Modeling and Reasoning on Crowd-Sensing Platforms

Crowd-sensing is a popular way to sense and collect data using smartphones that reveals user behaviors and their correlations with device performance. PhoneLab is one of the largest crowd-sensing platform based on the Android system. Through experimental instrumentations and system modifications, researchers can tap into... READ MORE

Learning in Markov Game for Femtocell Power Allocation with Limited Coordination

In this paper, we study the power allocation problem for the downlink transmission in a set of closed-access femtocells which overlay a number of macrocells. We introduce a mutli-step pricing mechanism for the macrocells to control the cross-tier interference by femtocell transmissions without explicit coordination.... READ MORE

Covert Channel using Man-In-The-Middle over HTTPS

The goal of this covert channel is to prove the feasibility of using encrypted HTTPS traffic to carry a covert channel. The encryption key is not needed because the original HTTPS payload is not decrypted. The covert message will be appended to the HTTPS data... READ MORE

Producing and Evaluating Crowdsourced Computer Security Attack Trees

We describe the recent developments of an opensource project called RATCHET that can be used by groups of users to collectively construct attack trees. We present the RATCHET framework as well as a model for testing and evaluation of the produced attack trees. RATCHET has... READ MORE

Evaluation of Homomorphic Primitives for Computations on Encrypted Data for CPS systems

In the increasingly connected world, cyber-physical systems (CPS) have been quickly adapted in many application domains, such as smart grids or healthcare. There will be more and more highly sensitive data important to the users being collected and processed in the cloud computing environments. Homomorphic... READ MORE

New Design Principles for Mobile History Games

This study draws on design-based research on an ARIS–based mobile augmented reality game for teaching early 20th century history. New design principles derived from the study include the use of supra-reveals, and bias mirroring. Supra-reveals are a kind of foreshadowing event in order to ground... READ MORE