It was great to be featured on The Analytics Show podcast. I really enjoyed my chat with Jason Tan, in which we discussed my somewhat unusual career trajectory (which resembles a Gradient Descent!), my current research and teaching focus, and the new Software Innovation Institute that I’m helping set up at the The Australian National…

# Category: Confidential Computing

## Exponentially Logarithmic – Lifting the Lid on some Bloom Filter Derivations

In one of my previous posts on Bloom Filters, I stated the expressions for both the False Positive rate, ie $$p \approx \left( 1 – e^{\frac{-kn}{m}} \right)^{k}$$ and the optimal number of hash functions, ie $$k = \frac{m}{n} \ln 2$$ In this post I will detail the derivations of both expressions. Derivation of the False…

## In Bloom – Nirvana?

I recently discussed how Confidential Computing allows us to analyse and use data without actually seeing it. A key component of Confidential Computing is Privacy-Preserving Record Linkage (PPRL), and one of the most widely used techniques within PPRL is the Bloom Filter (BF), which is the focus of this post. The aim is to give an overview of…

## How to Detect, Deter and Disrupt Crime & Fraud using Confidential Computing

Blame it on misguided youth, blame it on greed, or blame it on just plain ignorance, but I have a confession to make: I spent the early part of my career working for a major investment bank. To be honest, it was a great opportunity as a young Data Scientist to learn how to apply…