In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , x...
Modern Graphics Processing Units (GPU) have reached a dimension with respect to performance and gate count exceeding conventional Central Processing Units (CPU) by far. Many modern...
In this paper, we examine the resistance of the popular hash function SHA-1 and its predecessor SHA-0 against dedicated preimage attacks. In order to assess the security margin of ...
We describe a public-key encryption system that remains secure even encrypting messages that depend on the secret keys in use. In particular, it remains secure under a "key cy...
Dan Boneh, Shai Halevi, Michael Hamburg, Rafail Os...