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.