Abstract: A method and apparatus for managing software components and information. An apparatus comprises a computer system, a library application running on the computer system, a distribution application running on the computer system, and a crate tool in the computer system. The library application is configured to store a number of software components and information for ground vehicles in the computer system and generate tasks to manage software components and the information in the ground vehicles. The distribution application is configured to send a selected software component in the number of software components to a ground vehicle and receive the information from the ground vehicle. The crate tool is configured to manage crates containing the software components and the information and validate signatures associated with the software components and the information in the crates.

Abstract: A method and system for authenticating messages is provided. A message authentication system generates an encrypted message by encrypting with a key a combination of a message and a nonce. The message authentication system generates a message authentication code based on a combination of the message and the nonce modulo a divisor. To decrypt and authenticate the message, the message authentication system generates a decrypted message by decrypting with the key the encrypted message and extracts the message and the nonce. The message authentication system then regenerates a message authentication code based on a combination of the extracted message and the extracted nonce modulo the divisor. The message authentication system then determines whether the regenerated message authentication code matches the original message authentication code. If the codes match, then the integrity and authenticity of the message are verified.

Abstract: A communication-management method involves a recurring polling scheme, wherein network nodes are polled by a base station according to optimized and/or user-preferred polling intervals assigned to each network node. The polling interval assigned to a given node may be optimized to minimize and/or achieve user-preferred thresholds for energy consumption and latency associated with each network node in the sensor network. Optimized and/or user-preferred polling intervals may be constrained in accordance with various network performance considerations, for example, a recommended update interval for each network node, characteristics of the network nodes themselves, the duration of the timeslots at which the network nodes are polled, and/or other network performance considerations.

Abstract: A method for group travel and group communications, wherein the group travel parameters and group communications are combined for verifying and validating ADS-B data on aircraft. The full connectivity within a navigating group of aircraft allows all the group members to communicate spatial/temporal observations and collaborate in group protocols, e.g., majority voting protocol, which can determine if a received ADS-B message is corrupted or from a false target aircraft. Well-established distributed protocols based on group communications and majority voting exist for (1) detecting compromised members, i.e., false target aircraft, and (2) verifying message integrity, i.e., ADS-B data, given a minority fraction of members are compromised/colluding. Such protocols can be based on IP multicast communications over the IP networking data links available on the aircraft. Also disclosed is a method for verification and validation of position indicator message data on aircraft.

Abstract: A protocol with constant-time complexity solves the problem of private identification of tags in low-cost, large-scale radio frequency identification (RFID) systems—assuming that an adversary has complete control over the communication channel. Each RFID tag has an internal counter, c, and is preloaded with a unique pseudonym, ?, and a secret key, k. A RFID reader attempting to identify and authenticate a tag within its range generates and transmits a random nonce to the RFID tag, which returns a first hash of its current pseudonym and counter, and a second hash that is a function of the secret key. The reader uses the returned data to identify the RFID tag and its secret key by reference to a database and returns other hash values that authenticate the reader to the RFID tag. The most expensive operation that RFID tags are required to perform is a hash function.

Abstract: A method and apparatus for simulating effects of threats to aircraft communications. A simulation of an aircraft environment is run with the aircraft communications in an aircraft communications network in the aircraft environment. A number of conditions is introduced. The number of conditions comprises a threat configured to affect the aircraft communications in the aircraft communications network in an undesired manner. A change in traffic flow of aircraft in an airspace in the aircraft environment is identified in response to the number of conditions.

Abstract: A communication-management method involves a recurring polling scheme, wherein network nodes are polled by a base station according to optimized and/or user-preferred polling intervals assigned to each network node. The polling interval assigned to a given node may be optimized to minimize and/or achieve user-preferred thresholds for energy consumption and latency associated with each network node in the sensor network. Optimized and/or user-preferred polling intervals may be constrained in accordance with various network performance considerations, for example, a recommended update interval for each network node, characteristics of the network nodes themselves, the duration of the timselots at which the network nodes are polled, and/or other network performance considerations.

Abstract: Body sensor networks (BSNs) and methods for monitoring an electrocardiogram using such BSNs include a base station that generates an ECG model and an output ECG signal for displaying on a display device, and a sensor platform in electrical communication with the base station. The sensor platform may be configured to receive a sensed ECG signal from one or more sensors, receive an instance of the ECG model, and produce a model ECG signal from the instance. The sensor platform compares the sensed ECG signal to the model ECG signal and, if a deviation of the sensed ECG signal from the model ECG signal exceeds a threshold, transmits deviation data describing the deviation to the base station module. The sensor platform module does not transmit any data to the base station if there is no such deviation.

Abstract: A communication-management method involves a recurring polling scheme, wherein network nodes are polled by a base station according to optimized and/or user-preferred polling intervals assigned to each network node. The polling interval assigned to a given node may be optimized to minimize and/or achieve user-preferred thresholds for energy consumption and latency associated with each network node in the sensor network. Optimized and/or user-preferred polling intervals may be constrained in accordance with various network performance considerations, for example, a recommended update interval for each network node, characteristics of the network nodes themselves, the duration of the timselots at which the network nodes are polled, and/or other network performance considerations.

Abstract: An embodiment includes methods that generate random cryptographic keys, and send the keys to client devices. These methods may send representations of channel locator functions to the client devices, which may use the channel locator functions to locate particular control channels, using the random keys as input.

Abstract: A protocol with constant-time complexity solves the problem of private identification of tags in low-cost, large-scale radio frequency identification (RFID) systems—assuming that an adversary has complete control over the communication channel. Each RFID tag has an internal counter, c, and is preloaded with a unique pseudonym, ?, and a secret key, k. A RFID reader attempting to identify and authenticate a tag within its range generates and transmits a random nonce to the RFID tag, which returns a first hash of its current pseudonym and counter, and a second hash that is a function of the secret key. The reader uses the returned data to identify the RFID tag and its secret key by reference to a database and returns other hash values that authenticate the reader to the RFID tag. The most expensive operation that RFID tags are required to perform is a hash function.

Abstract: Methods of protecting location privacy of air traffic communications from unauthorized monitoring of aircraft locations in an uncontrolled airspace include designating a bounded region of uncontrolled airspace; ceasing transmission of a traffic beacon by each aircraft of a plurality of aircraft upon the aircraft entering the bounded region; and updating a unique identifier associated with each of the aircraft while the aircraft is traversing the bounded region.

Abstract: Methods of protecting location privacy of air traffic communications from unauthorized monitoring of aircraft locations in an uncontrolled airspace include designating a bounded region of uncontrolled airspace; ceasing transmission of a traffic beacon by each aircraft of a plurality of aircraft upon the aircraft entering the bounded region; and updating a unique identifier associated with each of the aircraft while the aircraft is traversing the bounded region.

Abstract: A method for group travel and group communications, wherein the group travel parameters and group communications are combined for verifying and validating ADS-B data on aircraft. The full connectivity within a navigating group of aircraft allows all the group members to communicate spatial/temporal observations and collaborate in group protocols, e.g., majority voting protocol, which can determine if a received ADS-B message is corrupted or from a false target aircraft. Well-established distributed protocols based on group communications and majority voting exist for (1) detecting compromised members, i.e., false target aircraft, and (2) verifying message integrity, i.e., ADS-B data, given a minority fraction of members are compromised/colluding. Such protocols can be based on IP multicast communications over the IP networking data links available on the aircraft.

Abstract: A protocol with constant-time complexity solves the problem of private identification of tags in low-cost, large-scale radio frequency identification (RFID) systems—assuming that an adversary has complete control over the communication channel. Each RFID tag has an internal counter, c, and is preloaded with a unique pseudonym, ?, and a secret key, k. A RFID reader attempting to identify and authenticate a tag within its range generates and transmits a random nonce to the RFID tag, which returns a first hash of its current pseudonym and counter, and a second hash that is a function of the secret key. The reader uses the returned data to identify the RFID tag and its secret key by reference to a database and returns other hash values that authenticate the reader to the RFID tag. The most expensive operation that RFID tags are required to perform is a hash function.

Abstract: An embodiment includes methods that generate random cryptographic keys, and send the keys to client devices. These methods may send representations of channel locator functions to the client devices, which may use the channel locator functions to locate particular control channels, using the random keys as input.