A Greater Tel-Aviv Area Seminar
Details and registration can be found at here.
Program
09:15-09:45 Gathering & Coffee
09:45-10:45 Elette Boyle on Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
10:45-11:00 Coffee Break
11:00-12:00 Eliad Tsfadia on Fair Coin Flipping: Tighter Analysis and the Many-Party Case
12:00-12:15 Coffee Break
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
