Abstract: A method of operating at least one node in a communication network that uses a shared communication medium has been developed to reduce or eliminate timing side-channel attacks performed by an adversary that is connected to the shared communication medium. The method includes generating, with a controller in a first node, a first jitter time offset randomly generated from within a predetermined time range, and transmitting, with a transceiver in the first node, a first data bit through an output of the transceiver that is connected to a shared communication medium, the first data bit being transmitted at a first time corresponding to the first jitter time offset added to a first predetermined transmission time.

Abstract: A method for operation of a communication network reduces leakage of data to an adversary that can observe signals transmitted through the communication network. The method includes generating a ranking to order operation of a plurality of nodes that exchange data in a group cryptographic key exchange process based on a leakage map of the nodes. The ranking minimizes leakage of data through a shared communication medium during the group cryptographic key exchange process. The method includes transmitting the ranking to the plurality of nodes through the shared communication medium, and performing, with the plurality of nodes, the group cryptographic key exchange process in an order of operation specified in the ranking to enable the plurality of nodes to exchange a shared cryptographic key through the shared communication medium while minimizing leakage of data.

Abstract: A method for operating at least one node connected to a shared communication medium reduces or eliminates the ability of an adversary node to identify the at least one node based on transient signal characteristics of a signal that the at least one node generates when transmitting a bit through the shared communication medium. The method includes adjusting, with a controller in a first node, an impedance of a variable impedance circuit in the first node to a first impedance level that the controller determines randomly, the variable impedance circuit in the first node being connected to an output of a transceiver in the first node and to a shared communication medium, and transmitting, with the transceiver, a first data bit through the shared communication medium with the variable impedance circuit producing the first impedance level.

Abstract: A method for implementing a secure multiparty computation protocol between a plurality of parties for a multiparty computation includes performing an offline phase of an SPDZ protocol for each of the parties participating in the multiparty computation. A secret share redistribution phase is then performed wherein the secret shares of the parties are redistributed to a subset of the parties. A secret share recombination phase is performed during which the subset of the parties recombines the redistributed secret shares to recover the secret shares of the parties not in the subset. An online phase of the SPDZ protocol is then performed during which the function is computed with respect to the private inputs of the parties and using the secret shares of all the parties.

Abstract: A method for shared key generation with authentication in a gateway node includes generating, generating a first set of pseudo-random data corresponding to expected transmissions from a first node that communicates with a second node through a shared communication medium, identifying, with the gateway node, bits transmitted from the second node based on a signals received by the gateway node corresponding to simultaneous transmissions from the first node and the second node, identifying, with the gateway node, expected bit values for the bits from the second node based on a combination of shared secret data stored in a memory of the gateway node with another set of random or pseudo-random data generated by the second node, and authenticating the second node in response to the plurality of bits transmitted from the second node matching the plurality of expected bit values.

Abstract: Compositions containing a plurality of biodegradable polymer microparticles having an active ingredient such as risperidone therein are disclosed. The plurality of biodegradable polymer microparticles include a first portion of biodegradable polymer microparticles having a 90% release in about 10 days to about 20 days for the active ingredient therefrom in vitro; a second portion of biodegradable polymer microparticles having 90% release in about 15 days to about 25 days for the active ingredient therefrom in vitro; a third portion of biodegradable polymer microparticles having 90% release in about 20 days to about 35 days for the active ingredient therefrom in vitro; and a fourth portion of biodegradable polymer microparticles having 90% release in about 40 days to about 60 days for the active ingredient therefrom in vitro.

Abstract: A method for shared secret agreement with forward secrecy includes generating a first plurality of bits of data using a cryptographically secure pseudo-random number generator applied to a node seed value and at least one index value, transmitting the first plurality of bits of data through a shared communication medium simultaneously to transmission of a second plurality of bits of data from a second node, identifying shared secret data with the second node using a portion of the first plurality of bits of data that are logical complements of the second plurality of bits of data, generating a shared seed value using a cryptographically secure one-way function applied to the shared secret data, and generating an updated node seed value using the cryptographically secure one-way function applied to the node seed value to replace the node seed value.

Abstract: Compositions containing microparticles loaded with one or protease enzymes and optionally auxiliary therapeutic agents and methods of treating conditions such as keloids therewith are disclosed. The biodegradable polymer and the protease enzyme therein form a controlled release matrix for extended release of the enzyme after administration to a mammal in need thereof.

Abstract: Methods of preparing particles using a sonication device are disclosed. The methods include directing a particle forming solution containing a particle forming liquid and a particle forming agent as a stream into contact with a sonicating tip of a sonication device under conditions sufficient to transform the stream containing the particle forming solution into a plurality of droplets having a substantially uniform size. The plurality of droplets are contacted with a hardening solution under conditions sufficient to solidify the droplets into particles having a substantially uniform particle size which are then recovered. Particles made in accordance with the methods can be solid or semi-solid and range in size from sub-micron to over 100 microns in diameter.

Abstract: Compositions containing microparticles loaded with one or protease enzymes and optionally auxiliary therapeutic agents and methods of treating conditions such as keloids therewith are disclosed. The biodegradable polymer and the protease enzyme therein form a controlled release matrix for extended release of the enzyme after administration to a mammal in need thereof.

Abstract: A method of shared key generation between three nodes through a shared communication medium includes performing, with a processor in a first node communicatively connected to a second node and a third node through a shared communication medium, a one-way function using a first shared key between the first node and the second node stored in a memory of the node and a predetermined counter as inputs to generate a first plurality of pseudo-random bits. The method includes generating, with the processor and a transceiver in the first node, a second shared key between the first node and the third node by transmitting each bit in the first plurality of pseudo-random bits to the third node through the shared communication medium simultaneously to transmission of random bits from the third node to the first node.

Abstract: A method of operating at least one node in a communication network that uses a shared communication medium has been developed. The method includes adjusting, with a controller in a first node, a resistance of a first potentiometer in the first node to a first resistance level that the controller in the first node determines randomly, the first potentiometer in the first node being connected to an output of a transceiver in the first node and to a shared communication medium, and transmitting, with the transceiver in the first node, a first data bit through the output that is connected to the shared communication medium with the first potentiometer producing the first resistance level.

Abstract: A method for operating at least one node connected to a shared communication medium reduces or eliminates the ability of an adversary node to identify the at least one node based on transient signal characteristics of a signal that the at least one node generates when transmitting a bit through the shared communication medium. The method includes adjusting, with a controller in a first node, an impedance of a variable impedance circuit in the first node to a first impedance level that the controller determines randomly, the variable impedance circuit in the first node being connected to an output of a transceiver in the first node and to a shared communication medium, and transmitting, with the transceiver, a first data bit through the shared communication medium with the variable impedance circuit producing the first impedance level.

Abstract: A method of operating at least one node in a communication network that uses a shared communication medium has been developed to reduce or eliminate timing side-channel attacks performed by an adversary that is connected to the shared communication medium. The method includes generating, with a controller in a first node, a first jitter time offset randomly generated from within a predetermined time range, and transmitting, with a transceiver in the first node, a first data bit through an output of the transceiver that is connected to a shared communication medium, the first data bit being transmitted at a first time corresponding to the first jitter time offset added to a first predetermined transmission time.

Abstract: A method for operation of a communication network reduces leakage of data to an adversary that can observe signals transmitted through the communication network. The method includes generating a ranking to order operation of a plurality of nodes that exchange data in a group cryptographic key exchange process based on a leakage map of the nodes. The ranking minimizes leakage of data through a shared communication medium during the group cryptographic key exchange process. The method includes transmitting the ranking to the plurality of nodes through the shared communication medium, and performing, with the plurality of nodes, the group cryptographic key exchange process in an order of operation specified in the ranking to enable the plurality of nodes to exchange a shared cryptographic key through the shared communication medium while minimizing leakage of data.

Abstract: Methods of sterilizing microparticles using a porous solid matrix which allows penetration of a sterilizing gas such as EtO to pass through are disclosed. The methods also include preparing a suspension of the sterilized microparticles by reconstituting the porous matrix containing the microparticles.

Abstract: Compositions containing microparticles loaded with one or protease enzymes and optionally auxiliary therapeutic agents and methods of treating conditions such as keloids therewith are disclosed. The biodegradable polymer and the protease enzyme therein form a controlled release matrix for extended release of the enzyme after administration to a mammal in need thereof.

Abstract: Securely storing assets in a cloud computer storage service. Preparation to store assets for a user may comprise determining a location to store the assets, generating a write access signature, and sending the determined location and the signature to the user. A request is received from the user to store the assets. Such a request includes the assets, the location, and the signature. In response to receiving the request, a determination is made regarding the write access signature whether the request should be honored. When the request is honored, the assets are stored in the determined location and the write access signature is invalidated. Upon subsequent user requests to access the assets, short-term read access signatures are generated and provided to the user. The assets are written once per generated write access signature and reads are to be performed close in time to when short-term read access signatures are requested.

Abstract: In a method of network communication that mitigates denial of service attacks, a server broadcasts cryptographic puzzles with certain time intervals, where each puzzle is only valid for the given time interval. A client receives the puzzle, generates a solution for the puzzle, and sends a network request to the server along with the solution of the puzzle. The server verifies the puzzle solution. If the puzzle solution is valid and received within a designated validity time period, then the server processes the request of the client. The server generates the puzzle and transmits the puzzle to the client before the client generates a request for services from the server.

Abstract: A method for shared key generation with authentication in a gateway node includes generating, generating a first set of pseudo-random data corresponding to expected transmissions from a first node that communicates with a second node through a shared communication medium, identifying, with the gateway node, bits transmitted from the second node based on a signals received by the gateway node corresponding to simultaneous transmissions from the first node and the second node, identifying, with the gateway node, expected bit values for the bits from the second node based on a combination of shared secret data stored in a memory of the gateway node with another set of random or pseudo-random data generated by the second node, and authenticating the second node in response to the plurality of bits transmitted from the second node matching the plurality of expected bit values.