Slides
Some authors have provided the slides used for the talks.
We collected them in this page.
- Provably-Secure Remote Memory Attestation for Heap Overflow Protection, Alexandra Boldyreva
- Improving Practical UC-Secure Commitments based on the DDH Assumption, Eiichiro Fujisaki
- On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs, Yi Deng
- Naor-Yung Paradigm with Shared Randomness and Applications, Silvio Biagioni
- Pen and Paper Arguments for SIMON and SIMON-like Designs, Christof Beierle
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions, Chethan Kamath
- On Garbling Schemes with and without Privacy, Carsten Baum
- Verifiable Pattern Matching on Outsourced Texts, Dario Catalano
- On Adaptively Secure Multiparty Computation with a Short CRS, Ran Cohen
- Proactive Secret Sharing with a Dishonest Majority, Karim ElDefrawy
- Memory Erasability Amplification, Robert Enderlein
- Virtual Smart Cards: How to Sign with a Password and a Server, Gregory Neven
- How (Not) to Instantiate Ring-LWE, Chris Peikert
- Zero Knowledge Made Easy, So It Won't Make You Dizzy (A Tale of Transaction Put in Verse About an Illicit Kind of Commerce), Trotta Gnam
- Naor-Yung Paradigm with Shared Randomness and Applications, Daniele Venturi
- Signatures Resilient to Uninvertible Leakage, Yuyu Wang