Since their publication in 1998, power analysis attacks have attracted signiļ¬cant attention within the cryptographic community. So far, they have been successfully applied to diļ...
We present the ļ¬rst cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
We study the problem of searching on data that is encrypted using a public key system. Consider user Bob who sends email to user Alice encrypted under Aliceās public key. An ema...
Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky...
Given two or more parties possessing large, conļ¬dential datasets, we consider the problem of securely computing the kth -ranked element of the union of the datasets, e.g. the med...
Textbooks tell us that a birthday attack on a hash function h with range size r requires r1/2 trials (hash computations) to ļ¬nd a collision. But this is quite misleading, being t...