~~
Speaker: Michael Zabejansky
M.Sc. student under the supervision of Prof. Haim Wolfson and Prof. Boaz Pat-Shamir

Wednesday, July 27th, 2016 at 15:30
Room 011, Kitot Bldg., Faculty of Engineering

Generating funnel graphs efficiently using GPU accelerated docking

Abstract

Protein docking is commonly described as a search for the minimum binding energy conformation of a complex. Sampling multiple receptor-ligand conformation binding energies in the surrounding of the conformation can result in an ensemble of low-energy conformations, which will form a funnel like energy landscape in the energy-rmsd graph.
The energy landscape in a graph can inform us on different low energy conformations. Generating a dense binding energy graph can provide a powerful tool not only for validating prediction solutions, but also for searching better complex conformations around. However, generating such a graph demands sampling an accurate energy function thousands of times, which is computationally demanding. This task can take days with currently available algorithms.
The task of performing multiple independent calculations fits perfectly for Graphic Processing Units (GPU) hardware. We developed a dedicated algorithm for generating multiple samples of a complex binding energy, which exploits the power of GPUs to provide input for funnel graphs.
In this talk, I will present our algorithm, which accelerates the FiberDock docking algorithm using GPUs and parallelization in order to perform multiple calculations of the binding score fast and efficiently. The algorithm provides a useful tool for generating funnel graphs for different needs.

~~
Speaker: Nimrod Aviram
PhD student under the supervision of Prof. Yuval Shavitt

Wednesday, July 27th, 2016 at 15:00
Room 011, Kitot Bldg., Faculty of Engineering

DROWN: Breaking TLS using SSLv2

Abstract

We present DROWN, a novel cross-protocol attack on TLS that uses a server supporting SSLv2 as an oracle to decrypt modern TLS connections.

We introduce two versions of the attack. The more general form exploits multiple unnoticed protocol flaws in SSLv2 to develop a new and stronger variant of the Bleichenbacher RSA padding-oracle attack.  To decrypt a 2048-bit RSA TLS ciphertext, an attacker must observe 1,000 TLS handshakes, initiate 40,000 SSLv2 connections, and perform 250 offline work. The victim client never initiates SSLv2
connections. We implemented the attack and can decrypt a TLS 1.2 handshake using
2048-bit RSA in under 8 hours, at a cost of $440 on Amazon EC2. Using Internet-wide scans, we find that 33% of all HTTPS servers and 22% of those with browser-trusted certificates are vulnerable to this protocol-level attack due to widespread key and certificate reuse.

For an even cheaper attack, we apply our new techniques together with a newly
discovered vulnerability in OpenSSL that was present in releases from 1998 to
early 2015.  Given an unpatched SSLv2 server to use as an oracle, we can
decrypt a TLS ciphertext in one minute on a single CPU --- fast enough to enable
man-in-the-middle attacks against modern browsers. We find that 26% of HTTPS servers are vulnerable to this attack.

We further observe that the QUIC protocol is vulnerable to a variant of our attack that allows an attacker to impersonate a server indefinitely after performing as few as
217 SSLv2 connections and 258 offline work.

We conclude that SSLv2 is not only weak, but actively harmful to the TLS ecosystem.