Hot answers tagged

7

Yes. There is an $\Omega(\log n)$ lower bound on ORAM. Therefore directly using ORAM to transform a non-oblivious algorithm to oblivious algorithm would incur a logN overhead. It is an open problem to design an ORAM matching the lower bound. No. There exists algorithms that do not have more efficient solution. As an apparent example, accessing a memory cell ...


4

The classic one that I can think of off the top of my head, that also happened relatively recently and posed a pretty widespread threat, was the Heartbleed bug. It was a big security vulnerability that would reveal authentication info in one of the most common ways communication gets encrypted over the internet, SSL/TLS. Most computers were affected, if I ...


3

Here's a classic timing attack against SSH: http://people.eecs.berkeley.edu/~daw/papers/ssh-use01.pdf As SSH is an encrypted terminal, it would send a packet each time you press a key. As you type your password, for example, you leaked the length of your password and also the timing. This could be used to reconstruct your likely password and make it ...



Only top voted, non community-wiki answers of a minimum length are eligible