Category: Confidential computing

I have gone through quite a few articles over the last 12 months in my attempt to get a proper understanding of fully homomorphic encryption (FHE) schemes. The process was somewhat frustrating because most of the articles are either too basic, giving just very high-level intuitions, or too deep, assuming too much background on the … More Useful Technical Tutorials on Fully Homomorphic Encryption

Bloom Filters is a popular technique for privacy-preserving record linkage. However, recent work by Christen et al [1] and others have shown that Bloom Filters (BF) are susceptible to different forms of frequency attack. There are many ideas on hardening BF to protect against frequency attacks, and one idea we will explore in this blog article … More Hardening Bloom Filters using Paillier Encryption

As is well known, the Paillier encryption system supports addition of two encrypted numbers and the scalar multiplication of a constant and an encrypted number. I learned recently one can compare two encrypted numbers and multiply two encrypted numbers in Paillier by making a trip to the private key holder. Let’s first look at comparison. … More Multiplication and Comparison Operations in Paillier

Congratulations to the ACSRI-led team for winning $50-million in funding from the Department of Industry, Innovation and Science to set up a new Cyber Security Cooperative Research Centre in Australia. It’s great to see the Australian government putting resources into a key research area that is increasing in importance as the world becomes more and … More Cyber Security Cooperative Research Centre