Cryptography and Information Security (CIS) Seminar
 |
Daniel Genkin: Physical Side Channel Attacks on PCs and Mobile Devices Friday, April 15, 2016 - 10:30am to 12:00pm Abstract:
Can secret information be extracted from PCs and mobile devices by measuring their physical properties from the outside? What would it take to extract whole keys from such fast and complex devices? We present myriad ways to do so, including: |
 |
Ari Juels: The Ring of Gyges: Understanding Criminal Smart Contracts Thursday, April 7, 2016 - 3:00pm to 4:00pm Abstract: Thanks to their anonymity (pseudonymity) and lack of trusted intermediaries, cryptocurrencies such as Bitcoin have created or stimulated growth in many businesses and communities, some of them regrettably criminal. |
 |
Valerio Pastro: Essentially Optimal Robust Secret Sharing with Maximal Corruptions Friday, April 29, 2016 - 10:30am to 12:00pm Abstract: |
 |
Prabhanjan Ananth: Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security Friday, April 22, 2016 - 10:30am to 12:00pm Abstract: Over the last few years a new breed of cryptographic primitives has arisen: on one hand they have previously unimagined utility and on the other hand they are not based on simple to state and tried out assumptions. |
 |
Prashant Vasudevan: Fine-Grained Cryptography Friday, April 8, 2016 - 10:30am to 12:00pm Abstract: |
 |
Title: Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13 Friday, April 1, 2016 - 10:30am to 12:00pm Abstract: In this work, we put forward a new class of polynomial-time attacks on the original multilinear maps of Garg, Gentry, and Halevi (2013). |
 |
Adam Sealfon: Network Oblivious Transfer Friday, March 11, 2016 - 10:30am to 12:00pm Abstract: Motivated by the goal of improving the concrete efficiency of secure multiparty computation (MPC), we study the possibility of implementing an infrastructure for MPC. |
 |
Aloni Cohen: GGM is a Weakly One-Way Family of Functions Friday, February 19, 2016 - 10:30am to 12:00pm Abstract: We prove that the for any constant $\epsilon>0$, GGM pseudo-random function family is a $1/n^{2+\epsilon}$-weakly one-way family of fun |
 |
Elette Boyle: New Developments in Function Secret Sharing Friday, February 12, 2016 - 10:30am to 12:00pm
|
 |
Daniel Genkin: Efficient Multi-Party Computation: from Passive to Active Security using Additive-Attack Resilient Circuits Friday, February 5, 2016 - 10:30am to 12:00pm Abstract:
|
Pages
