Abstract: Systems and methods include intercepting traffic on the user device; forwarding the traffic to a cloud-based system for security processing therein; and, responsive to unavailability of the cloud-based system preventing the forwarding, performing local security processing of the traffic at the user device including determining whether the traffic is allowed based on a cache at the user device, forwarding the traffic separate from the cloud-based system when it is allowed, and blocking the traffic when it is not allowed.

Abstract: Embodiments disclosed herein are directed to apparatus and methods for automatic fluid flow system connectors. The system generally includes a load cell interface coupled to a console and a ring connector coupled to a fluid collection system. The ring connector can be releasably engaged with the load cell using an engagement structure such as a latch, locking arm, or spring clip mechanism. The ring connector and load cell can include electrical contacts configured to engage along an axis that extends perpendicular to a surface that the electrical contacts are disposed on. Advantageously, reduced wear on the electrical contacts should extend the usable life of the system.

Abstract: Provided herein are methods and customized media compositions for culturing CIK NKT cells.

Abstract: A connector for a fluid drainage system having a body defining a drainage lumen extending longitudinally from a distal portion to a proximal portion. The body can include a piston housing and an inlet in fluid communication with a positive air pressure source. A piston is slidably engaged with the piston housing along a transverse axis between a first position and a second position. In the first position, the piston provides fluid communication between the distal portion and the proximal portion of the drainage lumen and occludes fluid communication between the inlet and the drainage lumen. The piston in the second position occludes fluid communication between the distal portion and the proximal portion of the drainage lumen and provides fluid communication between the inlet and the drainage lumen to clear dependent loops, while preventing distal fluid flow into a catheter.

Abstract: Described herein are a system and techniques for enabling user control over usage of their information by data consumers, even when untrusted parties are involved, while also preventing collusion between the untrusted party and a data consumer. A user's information may be collected by a client device and provided to a host server. An encrypted version of the user's information may be stored at the host server so that it is processed on a private enclave of the host server. When the data is to be provided to multiple data consumers, the data may be encrypted for each of the data consumers and may be released to each of those data consumers simultaneously once confirmation has been received that the data has been made available to each of the data consumers.

Abstract: Described are a system and computer program product for secure n-party computation. The system includes a computing device programmed or configured to communicate an input to a trusted execution environment (TEE), and receive a first encrypted output. The computing device is also programmed or configured to post the first encrypted output on a blockchain and receive a first proof of publication. The computing device is further programmed or configured to communicate the first proof of publication to the TEE and receive the first function output of the n-party computation. The computing device is further programmed or configured to communicate a witness to the TEE and receive a second encrypted output. The computing device is further programmed or configured to post the second encrypted output on the blockchain, receive a second proof of publication, communicate the second proof of publication to the TEE, and receive the second function output.

Abstract: Embodiments disclosed herein are directed to apparatus and methods for automatic fluid flow system connectors. The system generally includes a load cell interface coupled to a console and a ring connector coupled to a fluid collection system. The ring connector can be releasably engaged with the load cell using an engagement structure such as a latch, locking arm, or spring clip mechanism. The ring connector and load cell can include electrical contacts configured to engage along an axis that extends perpendicular to a surface that the electrical contacts are disposed on. Advantageously, reduced wear on the electrical contacts should extend the usable life of the system.

Abstract: Described are a system, method, and computer program product for secure real-time n-party computation. The method includes receiving a first computation input and a first portion of a one-time key from a first computer device, and receiving a second computation input and a second portion of the one-time key from a second computer device. The method also includes generating the one-time key based on the first and second portion of the one-time key, and executing a computation based on the first and second computation input. The method further includes generating an encrypted output by encrypting the computation with the one-time key, and communicating the encrypted output to the first computer device. The method further includes receiving a proof of publication from the first computer device and, in response to receiving the proof of publication, communicating the one-time key to the first computer device.

Abstract: Verification system and methods are provided for allowing database server responses to be verified. A proxy device may maintain a data structure (e.g., a Merkle B+-tree) within a secure memory space (e.g., an Intel SGX enclave) associated with a protected application. In some embodiments, the data structure may comprise hashed values representing hashed versions of the data managed by the database server. The proxy may intercept client requests submitted from a client device and forward such requests to the database server. Responses from the database server may be verified using the data structure (e.g., the hashes contained in the Merkle B+-tree). If the data is verified by the proxy device, the response may be transmitted to the client device.

Abstract: Described are a system and method for secure n-party computation. The method includes communicating a first input of an n-party computation to a trusted execution environment (TEE). The method also includes receiving, from the TEE, at least one encrypted output of the n-party computation using the first input and at least one second input of at least one other computing device, and using at least one public key of the at least one other computing device. The method further includes posting the at least one encrypted output on at least one blockchain accessible by the at least one other computing device. The method further includes, in response to posting the at least one encrypted output, receiving at least one proof of publication. The method further includes communicating the at least one proof of publication to the TEE and receiving the function output of the n-party computation.

Abstract: A method, system, and computer program product generate, with a payment network, a first value (a) and a second value (ga), the second value (ga) based on the first value (a) and a generator value (g); generate, with the payment network, a plurality of random merchant numbers (mi) for a respective plurality of merchant banks; determine, with the payment network, a merchant product (M) based on a product of the plurality of random merchant numbers (mi); generate, with the payment network, a public key (pki) based on the second value (ga), the merchant product (M), and the random merchant number (mi) and a random key (rki) based on the merchant product (M) and the random merchant number (mi) for each respective merchant bank; and communicate, with the payment network, the public key (pki) and the random key (rki) to at least one respective merchant bank.

Abstract: Described are a system, method, and computer program product for secure real-time n-party computation. The method includes communicating, to a trusted execution environment (TEE), a first computation input and a first portion of a one-time key. The method also includes receiving, from the TEE, an encrypted output of a computation based on the first computation input and a second computation input communicated to the TEE by a second computing device. The method further includes communicating the encrypted output to the second computing device and receiving a digital signature indicating that the second computing device received the encrypted output. The method further includes communicating the first portion of the one-time key to the second computing device and, in response to not receiving the second portion of the one-time key from the second computing device, executing a fallback computation process using the TEE and a shared ledger to determine the computation.

Abstract: A method, system, and computer program product generate, with a payment network, a first value (a) and a second value (ga), the second value (ga) generated based on the first value (a) and a generator value (g); generate, with the payment network, a plurality of random merchant numbers (mi) for a respective plurality of merchant banks; determine, with the payment network, a merchant product (M) based on a product of the plurality of random merchant numbers (mi); generate, with the payment network, a public key (pki) based on the second value (ga), the merchant product (M), and the random merchant number (mi) and a random key (rki) based on the merchant product (M) and the random merchant number (mi) for each respective merchant bank; and communicate, with the payment network, the public key (pki) and the random key (rki) to at least one respective merchant bank.

Abstract: A method, system, and computer program product generate, with a payment network, a first value (a) and a second value (ga), the second value (ga) generated based on the first value (a) and a generator value (g); generate, with the payment network, a plurality of random merchant numbers (mi) for a respective plurality of merchant banks; determine, with the payment network, a merchant product (M) based on a product of the plurality of random merchant numbers (mi); generate, with the payment network, a public key (pki) based on the second value (ga), the merchant product (M), and the random merchant number (mi) and a random key (rki) based on the merchant product (M) and the random merchant number (mi) for each respective merchant bank; and communicate, with the payment network, the public key (pki) and the random key (rki) to at least one respective merchant bank.

Abstract: Systems, methods, and computer program products are provided for efficiently storing multi-threaded log data. A method includes receiving multi-threaded log data comprising logs, markers, and thread identifiers. For each respective log, the respective thread identifier is set as a most recently used item in a thread reference cache. A respective log cache in a map data structure is determined based on the respective thread identifier. The respective log is added to the respective log cache. Whether to communicate the respective log and/or the respective log cache to a first repository is determined based on the respective marker. The respective log is communicated to a second repository. Whether to remove an oldest log from the log cache is determined based on a log cache size limit and/or a time limit. Whether to remove a least recently used log cache is determined based on at least one map data structure size limit.

Abstract: A method, system, and computer program product generate, with a payment network, a first value (a) and a second value (ga), the second value (ga) based on the first value (a) and a generator value (g); generate, with the payment network, a plurality of random merchant numbers (mi) for a respective plurality of merchant banks; determine, with the payment network, a merchant product (M) based on a product of the plurality of random merchant numbers (mi); generate, with the payment network, a public key (pki) based on the second value (ga), the merchant product (M), and the random merchant number (mi) and a random key (rki) based on the merchant product (M) and the random merchant number (mi) for each respective merchant bank; and communicate, with the payment network, the public key (pki) and the random key (rki) to at least one respective merchant bank.

Abstract: Methods and systems for secure multi-party generation of random bits are disclosed. These random bits can be generated securely, even if some parties (i.e., less than a corruption threshold) are dishonest or malicious. Methods and systems can use secure environments in order to securely generate and store cryptographic keys. Using broadcast protocols such as Dolev-Strong, a generator computer can distribute a public protocol instance key to other participant computers. Each participant computer can generate a random bit and encrypted the random bit with the public protocol instance key, and broadcast its encrypted random bit to the other participant computers. Once each participant computer has received the encrypted random bits from all other participant computers, the private protocol instance key can be released to the participant computers, enabling the participant computers to decrypt the encrypted random bits, and calculate an output random bit based on the encrypted random bits.

Abstract: The system and methods described herein may be utilized to perform operations in a faster and less complex manner than provided by conventional systems. An encrypted record may be stored at a user device. The encrypted record may include entries related to operations that were previously requested by the user device. The encrypted record may have been encrypted using a dynamic value and a key that is associated with an entity associated with the user. A recipient computer of a request by the user device may be configured to utilize the dynamic value provided in the request and the key associated with the entity to derive the encryption key(s) last used to encrypt the record. The recipient computer may decrypt and modify the decrypted record to perform the requested operation while the user device is precluded from doing so.

Abstract: Embodiments disclosed herein are directed to apparatus and methods for automatic fluid flow system connectors. The system generally includes a load cell interface coupled to a console and a ring connector coupled to a fluid collection system. The ring connector can be releasably engaged with the load cell using a push-button actuated locking mechanism. Embodiments of the locking mechanism can include a latch and aperture engagement, a shelf and ledge engagement, or a track and channel engagement, or combinations thereof. The ring connector and load cell can include electrical contacts configured to engage along an axis that extends perpendicular to a surface on which the electrical contacts are disposed. This is believed to reduce wear on the electrical contacts, thereby extending the usable life of the system.

Abstract: Described are a system, method, and computer program product for secure real-time n-party computation. The method includes communicating, to a trusted execution environment (TEE), a first computation input and a first portion of a one-time key. The method also includes receiving, from the TEE, an encrypted output of a computation based on the first computation input and a second computation input communicated to the TEE by a second computing device. The method further includes communicating the encrypted output to the second computing device and receiving a digital signature indicating that the second computing device received the encrypted output. The method further includes communicating the first portion of the one-time key to the second computing device and, in response to not receiving the second portion of the one-time key from the second computing device, executing a fallback computation process using the TEE and a shared ledger to determine the computation.