Researcher Discovers Method to Fully Process Encrypted Data Without Knowing its Content

( -- An IBM Researcher has solved a thorny mathematical problem that has confounded scientists since the invention of public-key encryption several decades ago. The breakthrough, called "privacy homomorphism," or "fully homomorphic encryption," makes possible the deep and unlimited analysis of encrypted information -- data that has been intentionally scrambled -- without sacrificing confidentiality.

IBM's solution, formulated by IBM Researcher Craig Gentry, uses a mathematical object called an "ideal lattice," and allows people to fully interact with encrypted data in ways previously thought impossible. With the breakthrough, computer vendors storing the confidential, electronic data of others will be able to fully analyze data on their clients' behalf without expensive interaction with the client, and without seeing any of the private data. With Gentry's technique, the analysis of encrypted information can yield the same detailed results as if the original data was fully visible to all.

Using the solution could help strengthen the business model of "cloud computing," where a computer vendor is entrusted to host the confidential data of others in a ubiquitous Internet presence. It might better enable a cloud computing vendor to perform computations on clients' data at their request, such as analyzing sales patterns, without exposing the original data.

Other potential applications include enabling filters to identify spam, even in encrypted email, or protecting information contained in electronic medical records. The breakthrough might also one day enable computer users to retrieve information from a search engine with more confidentiality.

"At IBM, as we aim to help businesses and governments operate in more intelligent ways, we are also pursuing the future of privacy and security," said Charles Lickel, vice president of Software Research at IBM. "Fully homomorphic encryption is a bit like enabling a layperson to perform flawless neurosurgery while blindfolded, and without later remembering the episode. We believe this breakthrough will enable businesses to make more informed decisions, based on more studied analysis, without compromising privacy. We also think that the lattice approach holds potential for helping to solve additional cryptography challenges in the future."

Two fathers of modern encryption -- Ron Rivest and Leonard Adleman -- together with Michael Dertouzos, introduced and struggled with the notion of fully homomorphic encryption approximately 30 years ago. Although advances through the years offered partial solutions to this problem, a full solution that achieves all the desired properties of homomorphic encryption did not exist until now.

In the past IBM made several major cryptography breakthroughs, such as the design of the Data Encryption Standard (DES); Hash Message Authentication Code (HMAC); the first lattice-based with a rigorous proof-of-security; and numerous other solutions that have helped advance Internet security.

Craig Gentry conducted research on privacy homomorphism while he was a summer student at IBM Research and while working on his PhD at Stanford University.

Provided by IBM

Explore further

IBM releases encryption for data tapes

Citation: Researcher Discovers Method to Fully Process Encrypted Data Without Knowing its Content (2009, June 25) retrieved 19 August 2019 from
This document is subject to copyright. Apart from any fair dealing for the purpose of private study or research, no part may be reproduced without the written permission. The content is provided for information purposes only.

Feedback to editors

User comments

Jun 25, 2009
Ok, this is officially over my head. How do you get the data without getting the data?

Jun 25, 2009
If they say that they can read my encrypted hard drive than how does this protect my private data? They should not even try to do it the same way we are asked not to make illegal copies. What they are trying to say is that they broke the encryptions but they realy have to prove it somehow.

Jun 25, 2009
I'm not a math expert, and the article doesn't provide enough detail to understand this unequivocally, but from the word "homomorphic" I'd surmise that their encryption method somehow preserves fundamental qualities of the data being scrambled -- so e.g. if I encrypt two numbers x and y, such that x = a * y for some constant a, the encrypted versions x' and y' will have the property that x' = b * y' for some constant b (heck, maybe a and b are even the same number...) Or something to that effect.

Can any math whizzes confirm this conception, or set me straight?

Jun 25, 2009
I thought: who cares what the data is or what type it is. Just run their encryption algorithm on it.

Jun 26, 2009
Homomorphic encryption means that you can do addition or multiplication operations on the encrypted data, to give the correct encrypted result. All numbers involved are encrypted.

Jun 26, 2009
devil is in subtraction and division

Jun 26, 2009
I got a book on approaches to that back in the 70's. There the idea was to develop numerical representations such that the ideal scheme for encoding numbers for error correction would allow correct numerical operations with the encoded numbers. This is clearly a subset of the whole homomorphic encryption problem.

Jul 15, 2009
Chimera Englewood

There is a factor which nobody has mentioned

Please sign in to add a comment. Registration is free, and takes less than a minute. Read more