Abstract:
Secrecy scheme systems and associated methods using list source codes for enabling secure communications in communications networks are provided herein. Additionally, improved information-theoretic metrics for characterizing and optimizing said secrecy scheme systems and associated methods are provided herein. One method of secure communication comprises receiving a data file at a first location, encoding the data file using a list source code to generate an encoded file, encrypting a select portion of the data file using a key to generate an encrypted file, and transmitting the encoded file and the encrypted file to an end user at a destination location, wherein the encoded file cannot be decoded at the destination location until the encrypted file has been received and decrypted by the end user, wherein the end user possesses the key.
Abstract:
Embodiments compress and encrypt data in a single pass to reduce inefficiencies that occur from compression and encrypting data separately. Typically, compression and encryption are implemented in separate functional units. This has a few disadvantages: 1 ) encryption cannot make use of compression state to further secure the message, 2) processed data is read and written twice, 3) additional space, time, and resources are consumed, and 4) it is more prone to potential cipher-attacks since the encryption stage is independent from compression. Embodiments overcome these disadvantages by structuring these operations so that both compression and encryption is executed within the same processing loop. Thus: 1 ) encryption is stronger due to the dependence on the compression state, 2) I/O buffers are accessed only once reducing overhead, 3) system footprint is reduced, and 4) cipher analysis is more complex since the decryption process cannot be separated from the decompression process.
Abstract:
According to one embodiment, an authenticatee includes, a memory configured to store secret information XY, secret information XY which is created by multiply duplicating, at least twice, the secret information XY, and secret information XY E , a generation module configured to generate a random number A, a generation module configured to generate a random number D which is composed of at least a part of the generated random number A and a random number B which is received, a calculating module configured to generate data C by executing a compression calculated operation with respect to at least a part of the random number D and the secret information XY loaded from the memory, a generation module configured to generate data ν, and a bit-by-bit addition module configured to calculate an calculated result Z from the data ν and the data C.
Abstract:
Techniques for HTTP header compression are described herein. In an implementation, an electronic device may be configured to enable compression/decompression of HTTP messages, including compression/decompression of information in the headers of the messages. A HTTP message is generated that contains at least a header and a body. The HTTP message is reformatted to place at least some of the header information into the body. Then, the body of the reformatted message having the header information is compressed to form a compressed HTTP message. Decompression may be applied by a recipient of the compressed HTTP message to reconstruct the original HTTP message.
Abstract:
A method is provided for creating an encrypted data file (700) from a data file having a sample entry box and a media data box. The sample entry box has description information therein. The media data box includes media data therein. The method includes: receiving the data file; encrypting the media data within the media data box with an encryption key; replacing the sample entry box with an encoded box (302); creating a sinf box (702) within the encoded box (302); creating a frma box (306) within the sinf box (702); and creating an schm box (704) within the sinf box (702). The schm box (704) indicates the type of formatting of the encrypted media data. The encoded box (302) does not include an initial counter that may be used to decrypt the encrypted media data.
Abstract:
At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. The present invention extends their setting to the ring of integers modulo N , thus obtaining compact representations for cryptographic systems that base their security on the discrete logarithm problem and the factoring problem. This can result in small key sizes and substantial savings in memory and bandwidth. However, unlike the case of finite field, analogous trace-based compression methods cannot be adapted to accommodate the extended setting of the invention when the underlying systems require more than a mere exponentiation. The invention finds particular application in a torus-based implementation of the ACJT group signature scheme. Also provided is a processor (10).
Abstract:
A system, method, and network interface obscures the existence of data encryption in a communication network is provided. A set of characters is generated by using a set of encryption keys as an input to a pseudo-random function. Each character corresponds to an index value. The encrypted data is divided into a plurality of parts. Each part is sectioned into a plurality of groups. Each group of the plurality of groups is encoded by mapping the group to a character in the set of characters according to its corresponding index value. The mapped characters are transmitted through the communication network.
Abstract:
Embodiments of the present invention are directed to Web-Services- based data backup and data-archiving applications that provide remote data backup and data archiving to private individuals, small businesses, and other organizations that need reliable, secure, geographically remote, and cost-effective data backup, data archiving, and backed-up and archived-data retrieval. In one embodiment of the present invention, a private or small-business client contracts with a service provider for data-backup and data-archiving services. The service provider, in turn, contracts with a remote data-storage facility to provide secure, reliable data backup and data archiving to the personal or small-business client. A client-side application is downloaded to the client computer and configured to allow the client to store locally encrypted data at the remote, data-storage facilities. Neither the service provider nor the data-storage facility can decrypt or otherwise access the information stored by the client. In addition, the encryption key or encryption keys used by the client to encrypt the data for remote storage are securely stored at the remote, data-storage facility for subsequent recovery by the client, should the client suffer damage or loss to a local computer system. However, the client encryption key is stored in a doubly encrypted fashion, preventing access to the client's encryption key by either the service provider or the data-storage facility. Certain embodiments of the present invention also provide local indexing for remotely stored, encrypted data and efficient storage of updates to already remotely stored data.
Abstract:
Systems and methods are provided which allow for the secure exchange of information between a sender and a receiver. The systems and methods utilize a mutually trusted credential creator (figure 9, 940) to authenticate the identities of at least the sender and optionally the receiver. The systems and methods also provide for the use of host applications capable of encrypting and digitally signing a secure file format. The secure file format is preferably only alterable with the consent of the sender.