time

speaker

title

19:30

Jesper Nielsen

19:35

Yehuda Lindell

An Implementation of Online/Offline Yao with Security Against Malicious Adversaries

19:38

Benny Applebaum

Incompressible functions, relative-error extractors, and the power of nondeterministic reductions

19:46

Antigoni Polychroniadou

Efficient Secure Multi-Party Computation via Secure SIMD Circuits

19:52

Stefano Tessaro

Optimally secure block ciphers from keyless functions

19:59

Muthuramakrishnan Venkitasubramaniam

On the Black-box Complexity of UC-Security

20:04

Kai-Min Chung

iO for Computation and Its Applications

20:10

Mor Weiss

How to make the best of a leaky situation

20:16

Mor Weiss

Protecting obfuscation against arithmetic attacks

20:18

Ran Cohen

Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation

20:25

Samuel Ranellucci

Reactive Garbling Scheme

20:30

Roberto Trifiletti

TinyLEGO

20:35

Rafael Pass

Implementing a Large-scale Anonymous Survey System

20:42

Muthuramakrishnan Venkitasubramaniam

Rethinking Secure Computation - A Greedy Approach