Abstract: Techniques for cryptographically secure, cross-domain information sharing are described. A first information domain including a first attribute-based encryption (ABE) authority defines a first universe of ABE attributes. Plaintext is encrypted using ABE encryption, producing ABE ciphertext. The ABE encryption uses an ABE access control expression defined with a set of ABE attributes comprising a first ABE attribute subset from the first universe of ABE attributes and second ABE attribute subset from a second universe of ABE attributes defined by a second ABE authority of a second information domain. The ABE ciphertext and the ABE access control expression are combined to produce an ABE package. The ABE package is encrypted, using predicate-based encryption (PBE), producing a PBE ciphertext. The PBE encryption uses a first set of PBE attributes from a universe of PBE attributes defined by a PBE authority.

Abstract: Generally discussed herein are systems, apparatuses, and methods for scheduling node access to a shared resource. A method can include determining a position assignment for each of a plurality of nodes to create a ring schedule, the ring schedule defining time frames in which each node of the plurality of nodes has access to a resource that is shared among the plurality of nodes, the ring schedule comprising a plurality of epochs, and each of the plurality of epochs comprising a plurality of positions that define a time at which access to the resource begins, each of a plurality of nodes including a position assignment each epoch, and updating the ring schedule including permuting positions of the ring schedule with the position assignment remaining static or changing at least one position assignment in an epoch of the plurality of epochs.

Abstract: Techniques for cryptographically secure, cross-domain information sharing are described. A first information domain including a first attribute-based encryption (ABE) authority defines a first universe of ABE attributes. Plaintext is encrypted using ABE encryption, producing ABE ciphertext. The ABE encryption uses an ABE access control expression defined with a set of ABE attributes comprising a first ABE attribute subset from the first universe of ABE attributes and second ABE attribute subset from a second universe of ABE attributes defined by a second ABE authority of a second information domain. The ABE ciphertext and the ABE access control expression are combined to produce an ABE package. The ABE package is encrypted, using predicate-based encryption (PBE), producing a PBE ciphertext. The PBE encryption uses a first set of PBE attributes from a universe of PBE attributes defined by a PBE authority.

Abstract: Systems and techniques for policy-based access control in content networks are herein described. Content and metadata describing the content may be encrypted by using an access control policy and a cryptographic key associated with the access control policy. The access control policy may be defined with a set of access control attributes. Each node in the content-based network may be assigned a set of access control attributes and a cryptographic key generated as a function of its assigned set of access control attributes. Each node in the content-based network may be configured to decrypt successfully the metadata or the content if and only if the assigned set of access control attributes of the node satisfies the access control policy used to encrypt the metadata or content.

Abstract: Generally discussed herein are systems, apparatuses, and methods for scheduling node access to a shared resource. A method can include determining a position assignment for each of a plurality of nodes to create a ring schedule, the ring schedule defining time frames in which each node of the plurality of nodes has access to a resource that is shared among the plurality of nodes, the ring schedule comprising a plurality of epochs, and each of the plurality of epochs comprising a plurality of positions that define a time at which access to the resource begins, each of a plurality of nodes including a position assignment each epoch, and updating the ring schedule including permuting positions of the ring schedule with the position assignment remaining static or changing at least one position assignment in an epoch of the plurality of epochs.

Abstract: Embodiments for providing for dissemination of packets in a network performing distributed beamforming are generally described herein. In some embodiments, distributing packets from nodes in a squad local area network using a first waveform to beamforming nodes, providing scheduling to a long link interface for delivering a stream of packets free of scheduling conflict and distributing a copy of the packets from a long link interface based on the provided scheduling and using a second waveform, the first waveform being different from the second waveform.

Abstract: Systems and techniques for policy-based access control in content networks are herein described. Content and metadata describing the content may be encrypted by using an access control policy and a cryptographic key associated with the access control policy. The access control policy may be defined with a set of access control attributes. Each node in the content-based network may be assigned a set of access control attributes and a cryptographic key generated as a function of its assigned set of access control attributes. Each node in the content-based network may be configured to decrypt successfully the metadata or the content if and only if the assigned set of access control attributes of the node satisfies the access control policy used to encrypt the metadata or content.

Abstract: Embodiments for providing for dissemination of packets in a network performing distributed beamforming are generally described herein. In some embodiments, distributing packets from nodes in a squad local area network using a first waveform to beamforming nodes, providing scheduling to a long link interface for delivering a stream of packets free of scheduling conflict and distributing a copy of the packets from a long link interface based on the provided scheduling and using a second waveform, the first waveform being different from the second waveform.