That's the title of the presentation I'll be giving at CloudDevelop 2014, on October 17th, in Columbus, Ohio. If you read my blog at all then you're probably interested in where software development will be headed five years in the future. Two things I recommend that you study are proving systems and homomorphic encryption. I've written about proving systems in the past, and will have more to say in the future, but today we'll talk about homomorphic encryption. Homomorphic encryption will ...

Cloud Security, For Real This Time: Homomorphic Encryption and the Future of Data Privacy. That's the title of my presentation at the next Central Ohio OWASP Quarterly Seminar, on 27 February at 1:00 p.m. Dan King, from Microsoft, will be talking about single sign-on for federated Dynamics CRM, very practical stuff which is in real world use today. I, on the other hand, will be talking about technologies which don't quite exist in fully practical forms today, but which I predict will change the ...

I noticed this morning that Google patent search returns 189 results for the query “homomorphic encryption." I have written about homomorphic encryption in the past; it is a true mathematical breakthrough which has the potential to transform cloud computing security. But the emphasis, here, is on “potential.” There is no fully homomorphic encryption scheme which is efficient enough to be practical for real-world, general-purpose computation. This, apparently, has done nothing to stop the pate...

I'll be speaking at a Slashdot/Geeknet "virtual trade show" today. Moving to Better Secure the Cloud: Governance, Risk, and Compliance Management My presentation will be on the potential business impact on the web if an efficient and fully homomorphic encryption system is invented. I'll be speaking sometime in between 3:15 and 4:00 EST, for about 20 minutes. The target audience is CIOs. Sorry for the short notice, but this came together at the last minute!...

A couple of weeks ago, I wrote What Is Homomorphic Encryption, and Why Should I Care? In that post, I promised to share my C# implementation of the algorithm from Craig Gentry's CACM article. Before I can do that, though, I need to explain some of the math involved. Perhaps surprisingly, it's actually very simple. (I say "surprisingly" because much of the math and technical papers on encryption is decidedly not simple, including that of Gentry's first fully homomorphic scheme, which was based...

The March 2010 issue of the Communications of the ACM includes a technical paper with an introduction entitled "A First Glance of Cryptography's Holy Grail" (ACM subscription required). That's enough to catch my attention. The paper itself, Computing Arbitrary Functions of Encrypted Data, describes a relatively new algorithm for homomorphic encryption. Although these words may be unfamiliar to many, the subject matter is terribly important, because, like public-key encryption, which paved the...