Abstract: In a network, a set of machines communicate pairwise, each conditionally adjusting messages in response to its own local state, and each in response to statistical methods conditionally propagating those messages, with the effect that problems with that network, or with a subset of its machines, are reported to a receiver/server. Only a substantially constant number of reports are made to the receiver/server, even when there are a substantial number of such machines able to detect that problem. When a problem is reported, a similar technique causes the machines to collectively evaluate and report suggested causes for that problem. Messages are propagated from each machine to another using locally random global locality. The machines in the network, in response to statistical techniques, organize hierarchically in O(log n) time, where n is the number of machines in the network, substantially without any requirement for nonlocal message exchange.

Abstract: A device receives, from a user device and via a first device, a first request for content, and determines whether the content is stored in memory. The device identifies first other requests for the content, received via the first device over a time period, and second other requests for the content, received via a second device over the time period, when the content is stored in the memory. The device identifies a first quantity of the first other requests and a second quantity of the second other requests, and determines whether the first quantity or the second quantity is greater than a threshold. The device transmits the content, to the user device and via the first device, when the first quantity is not greater than the threshold, and transmits, to the second device, an instruction to store the content when the second quantity is greater than the threshold.

Abstract: Embodiments of the present invention relate to a method, a system and a server for processing a Point to Multipoint (PTM) Push message. The method includes: receiving a Push message, in which the Push message includes indication information and push content; mapping address information of target terminals that correspond to the indication information; and sending, according to the address information of the target terminals, the push content to the target terminals that correspond to the indication information. In the embodiments of the present invention, the Push message is sent, according to the indication information included in the received Push message, to the target terminals that correspond to the indication information, and it is unnecessary to carry a large amount of the address information of the target terminals in the Push message, thereby saving network resources.

Abstract: A method includes receiving content and a license to the content at a storage system, receiving a request from a user system for the storage system to send the content and license to the user system, and sending the content and license from the storage system to the user system. Another method includes requesting content and a license to the content, receiving the content and license at a user system, requesting from the user system that the content and license be sent to a storage system, and requesting from the user system that the storage system send the content item to a second user system. In one embodiment, code could be used to perform a method that includes requesting content and a license to the content from a content provider, storing the content and license at a user system and a storage system, and requesting that the storage system send the content to another user system.

Abstract: An authentication method and an authentication system based on forking, and a forking authentication device are provided.

Abstract: The present invention provides a method and an apparatus for abstracting logical topology information of a Peer-to-Peer (P2P) network. The method includes: obtaining a set of Points of Presence (POPs) of peer clients in the P2P network; using a relevant algorithm of a routing protocol to calculate a best path between any two POPs in the set of POPs and a weight value of the best path; and collecting calculation results of the best path and the weight value that are obtained on each POP to obtain a set of abstract logical topology records of the P2P network. The embodiments of the present invention provide a universal and efficient method for abstracting logical topology information, which greatly reduces network topology information that needs to be transmitted, mitigates a risk of exposing lower-layer network topology information, and transmits the network topology information to a P2P application server securely and concisely.

Abstract: A server computer that is connected over a network to one or more remote client computers includes specialized hardware for handling computationally-intensive signal processing operations involving video, audio, and/or other signals. As a result, users of the client computers experience little or no delay when accessing over the network applications that are hosted on the server.

Abstract: Embodiments of the present disclosure include methods (and corresponding systems and computer program products) for monitoring secured communication channels based on certificate authority impersonation. One aspect is a method comprising: intercepting a certificate transmitted by the remote server to the software application, the certificate comprising a public key; generating a first public key and a first private key pair for the intercepted certificate; replacing the public key in the intercepted certificate with the first public key; transmitting a modified intercepted certificate including the first public key to the software application in place of the intercepted certificate; and monitoring the security communication channel between the software application and the remote server, wherein the security communication channel is established based at least in part on the modified intercepted certificate.

Abstract: The present application provides a system and method for a set of Extensible Authentication Protocols (EAPs) based on ECC (Elliptic Curve Cryptography) and SKE (Symmetric Key Encryption) mechanisms (with a suitable permutation) that can serve Confidentiality, Authentication, Authorization and Accounting (CAAA) issues at an affordable cost. According to one embodiment, a method and system of ECC and SKE based EAPs (through a permutation technique) which can avoid replay attacks. The application also provides a light weight security with better performance in comparison to the lower layer chip level security provided by 2G, 3G or 4G Applications and no certificates exchanged during the communication.

Abstract: In one embodiment, a method of streaming media includes partitioning a media stream to be transmitted into a first stream of media segments at a media server. The first stream of the media segments has a first sequence. An index table is generated to identify the first sequence of the first stream of the media segments. The index table is encrypted using a key. A second stream of the media segments is generated. The second stream has a second sequence, which is random relative to the first sequence. The encrypted index table and a transcoded media stream having the second stream of the media segments are transmitted.

Abstract: Machine language instruction sequences of computer files are extracted and encoded into standardized opcode sequences. The standardized opcodes in the sequences are of the same length and do not include operands. A multi-dimension vector is generated as a static feature for each computer file, where each element in the vector corresponds to the number of occurrences of a unique N-gram (i.e., unique sequence of N consecutive standardized opcodes) in the standardized opcode sequence for that computer file. The computer files are clustered into clusters of similarly classified files based on similarities of their static features. An unknown computer file can be classified by first grouping the file into a cluster of files with similar static features (e.g., into the cluster with the shortest average distance), and then determining the classification of that file based on the classifications of other files that belong to the same cluster.

Abstract: A system and method can support dynamically scaling up/down transactional resources in a transactional middleware machine environment. Transactional resources, such as groups and machines, can be by added or removed using a dynamic resource broker according to resource usage changes. The transactional middleware machine environment can comprise a deployment center in the transactional middleware machine environment, wherein the deployment center maintains one or more deployment policies for the transactional middleware machine environment and one or more deployment agents. Each of the one or more deployment agents is associated with a transactional middleware machine of a plurality of transactional middleware machines in a transactional domain in the transactional middleware machine environment.

Abstract: A method for profiling network traffic of a network, including obtaining a plurality of flows comprising a plurality of client IP addresses, a plurality of server IP addresses, and a plurality of server ports, extracting a plurality of fully qualified domain names (FQDNs) from a plurality of DNS flows in the network traffic, analyzing correlation between the plurality of flows and the plurality of FQDNs to generate a result, and presenting the result to an administrator user of the network.

Abstract: Techniques of the present invention impede power consumption measurements of an encryption engine on a logic device by running the encryption engine with an independent clock. This clock produces a signal that is decoupled from and asynchronous to clock signals feeding other circuits on the device. The clock feeding the encryption engine is not accessible externally to the device. Circuits may be employed to intentionally slow down or add jitter to one or more of the clock signals.

Abstract: An individualized time-to-live (TTL) is determined for a reputation score of a computer file. The TTL is determined based on the reputation score and the confidence in the reputation score. The confidence can be determined based on attributes such as the reputation score, an age of the file, and a prevalence of the file. The reputation score is used to determine whether the file is malicious during a validity period defined by the TTL, and discarded thereafter.

Abstract: Techniques for policy and identity-based workload provisioning are presented. Identities for requestors or workloads and identities for workloads are tied to specific policies. The specific policies are evaluated based on a stage of readiness for resources within a resource pool and based on resource identities for the resources within the resource pool. Resources are then dynamically provisioned based on the identity-based policy evaluation to handle workloads from the resource pool.

Abstract: A method for managing a flow of information in an object oriented software environment. A master MOM (130) and at least a second MOM (135) can be initialized. A third MOM (140) also can be initialized. A change resolution (150), which includes data correlating to a change in a device in a system, can be automatically propagated from the second MOM to the master MOM. The change can be a change in configuration data or a change in a run-time state of the device. Data in the master MOM correlating to the change resolution can be updated. In response to the change resolution, a change publication (160), which includes data correlating to the change resolution, can be automatically propagated from the master MOM to at least the third MOM. Data in the third MOM correlating to the change publication can be updated.

Abstract: A Right Object renewal method and apparatus for a right-protected digital broadcast service that is capable of predicting the expiration of a Right Object issued for the right-protected broadcast channel and renewing the Right Object prior to the expiration of the Right object based on the predicted expiry is provided.

Abstract: Techniques to avoid polarization in a communication network include a network switch or device having a first interface to receive a data unit or packet, and a second interface via which the packet is transmitted from the network device. The network device includes a hash value generator configured to generate, using a depolarizer, a depolarized key from an initial key (where the initial key is based on contents of the packet and the depolarizer is unique to the network device), and to generate a hash value based on the depolarized key and the packet by using a hash function that is common to all network devices in the network. The hash value may be optionally modified to load balance egress traffic of the network device. The network device selects an egress link or port, such as by determining an index into an egress table based on the (modified) hash value.

Abstract: Provided is a cryptographic device implementing an S-Box of an encryption algorithm using a many-to-one binary function. The cryptographic device includes: arrays of first logic gates including I first logic gates which each receive 2 bits of an input signal; 2N second logic gates which each receive corresponding J bits from among I bits output from the arrays of the first logic gates; and L third logic gates which each receive K bits from among 2N bits output from the second logic gates, wherein there is a many-to-one correspondence between the N bits of the input signal and the K bits input to each of the third logic gates, and wherein the N, I, J, K, and L are positive integers. Because a signal output from each array includes only one active bit, current is always consumed constantly to prevent internal data from leaking out to a hacker.