GTACS

Speaker: Ron Rothblum (WIS)
Title: Proofs and Arguments of Proximity: Verifying Correctness in Sub-Linear Time

Speaker: Stefano Tessaro, UC Santa Barbara
Title: Provably secure block ciphers from keyless functions: Full-domain and related-key security

Abstract.

Speaker: Yuval Yarom, University of Adelaide

Title: Side-channel attack on OpenSSL ECDSA

Location: Schreiber 309

In this talk we describe some significant improvements to the collision attack of SHA-1:
The first improvement is in the computation of SHA-1 in a collision search: We show that given the intermediate data of SHA-1(M) it is easier to compute SHA-1(M+delta). In the context of a collision search this type of computation is about 3 times faster.

(See note about location below)

Speaker:
Adi Shamir, Weizmann Institute of Science

Title:
How to Reach Unreachable Computers

Cryptography with Tamperable and Leaky Memory

Speaker: Yael Kalai, MSR New England

A large and growing body of research has sought to secure cryptographic systems against physical attacks.
Motivated by real-world physical attacks on memory, an important line of work was initiated by Akavia, Goldwasser, and
Vaikuntanathan [AGV09], where security is sought under the assumptions that (1) all memory is leaky, and
(2) leakage can be an arbitrary (efficient) shrinking function of the memory.

Speaker: Ran Canetti
12pm, TAU (Schreiber 210)

Homomorphic Encryption: from Private-Key to Public-Key

Speaker: Ron Rothblum, Weizmann