ARMONK, NY  IBM inventors have received a patent for a breakthrough data encryption technique that is expected to further data privacy and strengthen cloud computing security.

The patented breakthrough, called "fully homomorphic encryption," could enable deep and unrestricted analysis of encrypted information  intentionally scrambled data  without surrendering confidentiality. IBM's solution has the potential to advance cloud computing privacy and security by enabling vendors to perform computations on client data, such as analyzing sales patterns, without exposing or revealing the original data.

IBM's homomorphic encryption technique solves a daunting mathematical puzzle that confounded scientists since the invention of public-key encryption over 30 years ago.

Invented by IBM cryptography Researcher Craig Gentry, fully homomorphic encryption uses a mathematical object known as an "ideal lattice" that allows people to interact with encrypted data in ways previously considered impossible. The breakthrough facilitates analysis of confidential encrypted data without allowing the user to see the private data, yet it will reveal the same detailed results as if the original data was completely visible.

IBM received U.S. Patent #8,565,435: Efficient implementation of fully homomorphic encryption for the invention, which is expected to help cloud computing clients to make more informed business decisions, without compromising privacy and security.

"Our patented invention has the potential to pave the way for more secure cloud computing services  without having to decrypt or reveal original data," said Craig Gentry, IBM Researcher and co-inventor on the patent. "Fully homomorphic encryption will enable companies to confidently share data and more easily and quickly overcome challenges or take advantage of emerging opportunities."

Following the initial revelation of the homomorphic encryption breakthrough in 2009 Gentry and co-inventor Shai Halevi began testing, refining and pursuing a working implementation of the invention. In 2011, the scientists reported a number of optimizations that advanced their goal of implementing of the scheme. The researchers continue to investigate homomorphic encryption and test its practical applicability.

IBM invests more than $6 billion annually in R&D and consistently explores new approaches to cloud computing that will deliver a competitive advantage to the company and its clients.

For 20 consecutive years, IBM has topped the list of U.S. patent recipients. The company's invention and patent leadership is illustrated at http://ibm.co/11k6fRn.

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

More information about how IBM inventors are propelling cloud computing innovations is available at http://ibm.co/174A8tS.

I believe they’re saying they can get any information anywhere without anyone knowing. I can’t see where it would benefit me, I’ll be even more directly targeted by advertisers and I’m sure it will make the NSA’s job easier but I don’t believe that will benefit me either. And then there’s the IRS.

It means you can give a third party access to the still encrypted data, they can run analysis on it, but their results will be encrypted. They can than give you the encrypted results, and you can unencrypt them.

A homomorphism is a map that preserves selected structure between two algebraic structures, with the structure to be preserved being given by the naming of the homomorphism. Particular definitions of homomorphism include the following:

A semigroup homomorphism is a map that preserves an associative binary operation.

A monoid homomorphism is a semigroup homomorphism that maps the identity element to the identity of the codomain.

A group homomorphism is a homomorphism that preserves the group structure. It may equivalently be defined as a semigroup homomorphism between groups.

A ring homomorphism is a homomorphism that preserves the ring structure. Whether the multiplicative identity is to be preserved depends upon the definition of ring in use.

A linear map is a homomorphism that preserves the vector space structure, namely the abelian group structure and scalar multiplication. The scalar type must further be specified to specify the homomorphism, e.g. every R-linear map is a Z-linear map, but not vice versa.

An algebra homomorphism is a homomorphism that preserves the algebra structure.

A functor is a homomorphism between two categories.

Is it clear, now?

27
posted on 12/28/2013 1:13:08 PM PST
by gitmo
(If your theology doesn't become your biography, what good is it?)

I am uncomfortable with “A functor is a homomorphism between two categories.”. Homomorphism preserves some structure, and while categories have object with structure, I’m unclear what they have themselves. (I shouldn’t anthropomorphize, but some categories cute.)

Disclaimer:
Opinions posted on Free Republic are those of the individual
posters and do not necessarily represent the opinion of Free Republic or its
management. All materials posted herein are protected by copyright law and the
exemption for fair use of copyrighted works.