University of California

Hamid R Sadjadpour

Jose Joaquin Garcia-Luna-Aceves

Mohsen Karimzadeh Kiskani

Techniques for secure remote digital storage or transmission of a ciphertext message include determining a maximum storage capacityof an adversary, determining a security parameter k, wherein 1<<k<<m, and determining a prime number n, such that≤0.3kn. A current public portion of random string α, comprising n random elements, is read from a public site. A secret key z, wherein z has 2k elements, comprising k additive co-primes of n and k multiplicative co-primes of n is shared with a receiving site. An encryption key X, based on the secret key and the current public string, is determined and applied to a plaintext message M of length ≤m to encrypt the plaintext message as Y=M⊕X, thereby creating the ciphertext message Y, which can be placed on a public forum for receiving by a receiving node.

Techniques for encryption based on perfect secrecy for bounded storage

Techniques for secure public exposure of digital data include extracting first digital data comprising one or more batches, each batch comprising a plurality of no more than a number T of packets, each packet containing a plurality of a number n of bits. A random binary matrix CK consisting of T rows and n columns is generated. For a first batch, a first random n-bit temporary key is generated and positions of the nT elements of matrix CK are randomized to produce matrix CK(RP). For a packet in the first batch, a first packet vector key is generated based on non-overlapping pairs of bit positions for both the temporary key and for a first packet-corresponding row of matrix CK(RP). An encrypted packet is generated for the packet based on the packet and the first packet vector key. The encrypted packet is exposed publicly.

Extra-compact key with reusable common key for encryption

Techniques for secure public exposure of digital data include extracting first digital data comprising one or more batches, each batch comprising a plurality of no more than a number T of packets, each packet containing a plurality of a number n of bits. A random binary matrix A consisting of T rows and n columns is generated. For a first batch, a first random n-bit temporary key is generated. For a packet in the first batch, a first packet vector key is generated based on random non-overlapping pairs of bit positions for both the temporary key and for a first packet-corresponding row of matrix A. An encrypted packet is generated for the packet based on the packet and the first packet vector key. The encrypted packet is exposed publicly.

Compact key with reusable common key for encryption

Techniques for secure public exposure of digital data include extracting n chunks, each containing Q bits, n=2(Q+1). A random mapping of each chunk to only one batch of M numbered batches is determined and stored securely. A bit based on a random key is combined at a location based on batch number with each of the chunks in the batch to produce a batch of enhanced chunks, each containing Q+1 bits. This is repeated with each non-overlapping batch of chunks, each enhanced chunk of the batch having one bit based on a different bit from the key. A unique set of the enhanced chunks is combined with a XOR to produce an encoded chunk, every bit of which is based on a bit from the key. An encoding vector B that indicates the unique set is stored securely. The encoded chunk can be safely exposed publically.

Compact key encoding of data for public exposure such as cloud storage

A wireless base station having K antennas communicates with M mobile devices using multiuser diversity scheme with opportunistic interference management. The base station transmits K distinct pilot signals from K corresponding antennas and receives feedback from mobile devices. The feedback from each device indicates a strong pilot signal and a weak pilot signal received from the K distinct pilot signals. Using these indications, the base station assigns each of the K antennas to a mobile device. The base station then transmits distinct data streams to the mobile devices using the corresponding antennas assigned to the corresponding mobile devices. The transmission may include multiplying the transmitted distinct data streams by a vector V orthogonal to a vector U, thereby allowing mobile devices not assigned to an antenna to cancel the transmitted distinct data streams.

Growing community of inventors

Santa Cruz, CA, United States of America

Hamid R Sadjadpour