Abstract: A system and method is provided for providing distributed computing platform on untrusted hardware. An exemplary method includes launching a hypervisor on an untrusted computing node and receiving a request generated to provide a computing function using hardware of the untrusted computing node. Upon receiving the request, an enclave in memory of the untrusted computing node is created and a virtual machine is launched in the memory enclave. Moreover, a guest operating system of the virtual machine verifies the security of the untrusted computing node. Finally, the guest operating system performs the computing function using the hardware of the untrusted computing node upon the guest operating system verifying the security of the untrusted computing node and the hypervisor.

Abstract: A system and method is provided for providing distributed computing platform on untrusted hardware. An exemplary method includes launching a hypervisor on an untrusted computing node and receiving a request generated to provide a computing function using hardware of the untrusted computing node. Upon receiving the request, an enclave in memory of the untrusted computing node is created and a virtual machine is launched in the memory enclave. Moreover, a guest operating system of the virtual machine verifies the security of the untrusted computing node. Finally, the guest operating system performs the computing function using the hardware of the untrusted computing node upon the guest operating system verifying the security of the untrusted computing node and the hypervisor.

Abstract: An Application Packaging Standard (APS) is a specification defining application's life cycle in a cloud. The application's life cycle includes packaging, delivering to the cloud, verification of package, integrating (and unpacking) into the cloud, distributing to clients, licensing, functionality, updates and deletion. The APS has its own Application Programming Interface (API) for accessing the APS functions from a program code or by http/https requests. The APS provides for efficient integration of SaaS web applications into the cloud.

Abstract: A system and method is provided for supporting integrity of distributed data storage with erasure coding. An exemplary method includes receiving a request to create a backup or archive of electronic data using erasure coding, contacting storage nodes and providing an incentive mechanism to incentivize each of the storage nodes to support the distributed data storage, receiving confirmation from at least some of the storage nodes indicating an agreement to store data, generating K data blocks and M parity blocks from the electronic data using erasure coding, and allocating the K data blocks and the M parity blocks to the storage nodes that have agreed to store data.

Abstract: A system and method that provides for the backup and recovery of personalized user data. An exemplary method includes storing user data files in electronic memory of a user device, continuously tracking user actions by one or more user devices to detect interact with at least one external resource; determining whether the tracked user actions have modified one or more of the plurality of user data files; and if the processor determines that the tracked user actions have modified a user data file, storing the modified user data file in a data storage system.

Abstract: A system and method for providing secure private electronic communications. An exemplary method includes encrypting a hidden message using an encryption scheme; encoding the encrypted hidden message in a source message; providing the source message having the encoded hidden message by a first electronic device; and transmitting a decryption key to a second electronic device. Moreover, the second electronic device can capture the encoded hidden message provided by the first electronic device, decode the hidden message, and extract the hidden message using the decryption key so that the hidden message can be rendered by the second electronic device.

Abstract: A system and method is disclosed for using encryption algorithms in peer-to-peer encryption mode to restore the integrity of data. An example method is provided for generating a new derivative for a file that has a plurality of existing derivatives that have been stored on servers using an (n,k) algorithm, where the (n,k) algorithm provides that a minimum number k of the derivatives required to restore the file. The method includes accessing, on a server, a first derivative of the existing derivatives and forming a blob for the new derivative based on a modification operation that uses the first derivative. Moreover, the method includes determining a number of times the modification operation has been performed, and if the number of times the modification operation has been performed is equal to the minimum number k, uploading the blob to a server for storage thereon.

Abstract: A system and method for backup and recovery of user mobile device modules, settings and configurations. An example system includes a modular mobile device and a number of interconnected modules that can be connected to the mobile device. The device includes memory that stores configuration and setting parameters associated with each of the modules. In operation, a backup software utility monitors the configuration and setting parameters to detect additions and modifications and the transmits the detected additions and modifications to remote data storage to generate a data backup indicating a current state of the configuration and setting parameters. As a result, the modular mobile device can always return to a previous state for each module if it is replaced or the software is reinstalled, for example.

Abstract: A system and method is disclosed for data storage in a distributed data storage system. An exemplary method includes generating derivatives of a file using an (n,k) algorithm, such that k number of derivatives can be used to restore the file. Moreover, the derivatives are stored in nodes in a multilevel tree representing the distributed data storage system and a rank is calculated that indicates a fault tolerance of the file. The method further determines whether the rank is greater than or equal to k to ensure reliability of recoverability of the file. If the rank less than k, the method reorders one or more derivatives to a different node and/or store one or more additional derivative from the file.

Abstract: The present disclosure relates to systems and methods for archiving and restoring data. An exemplary method comprises receiving a request to archive, at a data center, an encrypted data object stored on a remote computing node, determining whether at least one of a copy of the encrypted data object or a similar data object exists in an archive of encrypted data objects stored at the data center, when a copy of the encrypted data object is found, generating a reference to the copy of the encrypted data object and archiving the reference in the archive as a proxy for the encrypted data object. When a similar data object is found, the method generates a reference to the similar data object, identifies information unique to the encrypted data object by comparing the encrypted data object and the similar data object; and archives both the reference to the similar data object and the unique information as a proxy for the encrypted data object.

Abstract: A system and method is disclosed for using encryption algorithms in peer-to-peer encryption mode to restore the integrity of data. An example method is provided for generating a new derivative for a file that has a plurality of existing derivatives that have been stored on servers using an (n,k) algorithm, where the (n,k) algorithm provides that a minimum number k of the derivatives required to restore the file. The method includes accessing, on a server, a first derivative of the existing derivatives and forming a blob for the new derivative based on a modification operation that uses the first derivative. Moreover, the method includes determining a number of times the modification operation has been performed, and if the number of times the modification operation has been performed is equal to the minimum number k, uploading the blob to a server for storage thereon.

Abstract: A system and method is provided for supporting integrity of distributed data storage with erasure coding. An exemplary method includes receiving a request to create a backup or archive of electronic data using erasure coding, contacting storage nodes and providing an incentive mechanism to incentivize each of the storage nodes to support the distributed data storage, receiving confirmation from at least some of the storage nodes indicating an agreement to store data, generating K data blocks and M parity blocks from the electronic data using erasure coding, and allocating the K data blocks and the M parity blocks to the storage nodes that have agreed to store data.

Abstract: A method and system for a site builder. The site builder is an application designed to create and edit websites for hosting providers, resellers and end users. Built with hosting in mind, the proposed site builder allows providers to easily offer site building capabilities to their customers. The easy five-step wizard interface provides for an effortless way for customers to create, modify and update their own websites without any technical skills or HTML know-how. The site builder application for LINUX/Unix or WINDOWS also comes with a comprehensive administration panel that allows providers to quickly and easily tailor the application to their needs.

Abstract: A method, system and computer program product for generation and management of incremental backups of VEE file system using bitmaps. The proposed method allows users to roll back to any previous version or state of the VEE file system and to instantiate this version using the data encapsulated in virtual disk storage (i.e. file system) of the VEE. A number of VEEs run on a Host Operating System of the computer system. One of the VEEs implemented on the computer system is designated to generation and management of backups of the virtual disk data of the other VEEs without freezing the file system during the entire backup process. A special tracing application runs on the designated VEE for generating the bitmap of a file system snapshot. The user can also set up a time for generating a backup or create a schedule for automatically generating the backups at critical points.

Abstract: A host runs an operating system kernel. A plurality of virtual private servers (containers) is supported within the kernel. The containers use the same files. A template cache has pre-calculated file checksums. The checksum is calculated each time the file is created and/or modified. Each file has an inode containing an attribute indicating whether the checksum is calculated and stored along with the file. If the checksum is present, the process is redirected to access the file with the same inode in the shared disk cache.

Abstract: A system and method for backup and recovery of user mobile device modules, settings and configurations. An example system includes a modular mobile device and a number of interconnected modules that can be connected to the mobile device. The device includes memory that stores configuration and setting parameters associated with each of the modules. In operation, a backup software utility monitors the configuration and setting parameters to detect additions and modifications and the transmits the detected additions and modifications to remote data storage to generate a data backup indicating a current state of the configuration and setting parameters. As a result, the modular mobile device can always return to a previous state for each module if it is replaced or the software is reinstalled, for example.

Abstract: A system and method for providing secure private electronic communications. An exemplary method includes encrypting a hidden message using an encryption scheme; encoding the encrypted hidden message in a source message; providing the source message having the encoded hidden message by a first electronic device; and transmitting a decryption key to a second electronic device. Moreover, the second electronic device can capture the encoded hidden message provided by the first electronic device, decode the hidden message, and extract the hidden message using the decryption key so that the hidden message can be rendered by the second electronic device.

Abstract: A system and method that provides for the backup and recovery of personalized user data. An exemplary method includes storing user data files in electronic memory of a user device, continuously tracking user actions by one or more user devices to detect interact with at least one external resource; determining whether the tracked user actions have modified one or more of the plurality of user data files; and if the processor determines that the tracked user actions have modified a user data file, storing the modified user data file in a data storage system.

Abstract: A method for integration of dynamically scalable non-native windows into a host operating system (OS), including launching a Virtual Machine (VM) running a guest OS on a computer system with the host OS and a host desktop being displayed to a user; displaying a window of a non-native desktop on the host desktop; and scaling the window in response to user action, so that items displayed in the window are scaled with the same ratio, wherein the VM interfaces to a virtual adapter for its maintenance of the window, and wherein a resolution of the displayed window changes dynamically in response to the user action.

Abstract: A system and method is disclosed for data storage in a distributed data storage system. An exemplary method includes generating derivatives of a file using an (n,k) algorithm, such that k number of derivatives can be used to restore the file. Moreover, the derivatives are stored in nodes in a multilevel tree representing the distributed data storage system and a rank is calculated that indicates a fault tolerance of the file. The method further determines whether the rank is greater than or equal to k to ensure reliability of recoverability of the file. If the rank less than k, the method reorders one or more derivatives to a different node and/or store one or more additional derivative from the file.