IP Library Granted Patent US 9,282,082
Granted Patent B2
US 9,282,082 · App. 14/581,055 · Granted Mar 8, 2016

Compressing encrypted data without the encryption key

Inventors: Camit Hazay (Yorktown Heights, NY); Ashish Jagmohan (Irvington, NY); Demijan Klinc (Yorktown Heights, NY); Hugo M. Krawczyk (Tarrytown, NY); Tal Rabin (Yorktown Heights, NY)
Assignee: International Business Machines Corporation
H04L63/0428H04L9/0637H04L9/0819H04L69/04G06F2221/2107H04L9/0618H04L2209/24H04L2209/30
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,282,082
App. No.
14/581,055
Granted
Mar 8, 2016
Kind
B2
Abstract

A method, system and computer program product are disclosed for compressing encrypted data, wherein the data is encrypted by using a block encryption algorithm in a chained mode of operation, and the encrypted data is comprised of a set of N encrypted blocks, C 1 . . . C N . In one embodiment, the method comprises leaving block C N uncompressed, and compressing all of the blocks C 1 . . . C N in a defined sequence using a Slepian-Wolf code. In an embodiment, the data is encrypted using an encryption key K, and the compressing includes compressing all of the blocks C 1 . . . C N without using the encryption key. In one embodiment, the compressing includes outputting the blocks C 1 . . . C N as a set of compressed blocks CmprC 1 . . . CmprC N-1 , and the method further comprises decrypting C N to generate a reconstructed block {tilde over (X)} n , and decrypting and decompressing the set of compressed blocks using {tilde over (X)} n .

Claims (17)

1. A method of compressing and decrypting encrypted data, wherein said encrypted data is obtained by selecting one message from a group of M messages and encrypting the selected message using block ciphers in a chained mode of operation to form a first encrypted message, the method comprising:

compressing the first encrypted message by truncating the first encrypted message to obtain a first truncated encrypted message; and

decompressing and decrypting said first truncated encrypted message to obtain a decompressed and decrypted message by

encrypting all of said M messages to obtain a series of encrypted messages, wherein each of the series of encrypted messages is formed from one of the M messages,

truncating each of said series of encrypted messages to obtain a series of truncated encrypted messages, and

comparing the first truncated encrypted message to each of said series of truncated encrypted messages, using defined criteria, to match one of said series of truncated encrypted messages to the first truncated encrypted message, and declaring the one of said M messages from which the matched one of the series of truncated encrypted messages is formed, as the decompressed and decrypted message.

2. The method according to claim 1 , wherein said first encrypted message is encrypted using an encryption key K, and said compressing includes compressing the first encrypted message without using said encryption key K.

3. The method according to claim 2 , wherein the encrypting all of said M messages includes encrypting all of said M messages using said encryption key K.

4. A system for compressing and decrypting encrypted data, wherein said encrypted data is obtained by selecting one message from a group of M messages and encrypting the selected message using block ciphers in a chained mode of operation to form a first encrypted message, the system comprising:

one or more hardware processing units configured for compressing the first encrypted message by truncating the first encrypted message to obtain a first truncated encrypted message; and decompressing and decrypting said first truncated encrypted message to obtain a decompressed and decrypted message

wherein the decompressing and decrypting said first truncated encrypted message is done by

encrypting all of said M messages to obtain a series of encrypted messages, wherein each of the series of encrypted messages is formed from one of the M messages,

truncating each of said series of encrypted messages to obtain a series of truncated encrypted messages, and

comparing the first truncates encrypted message to each of said series of truncated encrypted messages, using defined criteria, to match one of said series of truncated encrypted messages to the first truncated encrypted message, and declaring the one of said M messages from which the matched one of the series of truncated encrypted messages is formed, as the decompressed and decrypted message.

5. The system according to claim 4 , wherein:

said first encrypted message is encrypted using an encryption key K, and said compressing includes compressing the first encrypted message without using said encryption key K; and

the encrypting all of said M messages includes encrypting all of said M messages using said encryption key K.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 23, 2014
From: HAZAY, CAMIT; JAGMOHAN, ASHISH; KLINC, DEMIJAN; KRAWCZYK, HUGO M.; RABIN, TAL
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 034577/0980 →
Continuity (2)
Division 12610754 · Nov 2, 2009
Related Publication 20150156178A1 · Jun 4, 2015