Cryptography and Information Security (CIS) Seminar
 |
Tancrede Lepoint: Using the Rényi Divergence Rather than the Statistical Distance in Lattice Crypto Friday, November 4, 2016 - 10:30am to 12:00pm Abstract: |
 |
Zahra Jafargholi: Adaptive Security of Yao's Garbled Circuits Friday, August 5, 2016 - 10:30am to 12:00pm Abstract: |
 |
Renen Perlman: Lattice-Based Fully Dynamic Multi-Key FHE with Short Ciphertexts Friday, August 26, 2016 - 10:30am to 12:00pm Abstract: A fully homomorphic encryption scheme (FHE) allows one to convert an encryption of a message into an encryption of some arbitrary function of that message, without compromising the secrecy of the encrypted message. |
 |
Amit Sahai: State of the iO: where we stand in the quest for secure obfuscation Friday, July 15, 2016 - 10:30am to 12:00pm Abstract:
|
 |
Ron Rivest: Symmetric Encryption via Keyrings and ECC Friday, July 15, 2016 - 1:00pm to 2:30pm Abstract:
We present a new scheme for implementing a "fuzzy vault", wherein
a message can be encrypted using a biometric (a set of features) or
a set of keywords (a keyring) as a symmetric encryption key. The |
 |
Dakshita Khurana: Two-Message Non-Malleable Commitments Friday, June 24, 2016 - 10:30am to 12:00pm Abstract: We construct two-message non-malleable commitments with respect to opening in the standard model, assuming only one-to-one one-way functions. |
 |
Kobbi Nissim: Accessing Data while Preserving Privacy Friday, May 20, 2016 - 10:30am to 12:00pm Abstract: We initiate a formal study of the privacy-efficiency tradeoff of secure database systems. Such systems allow storing data on a remote server and accessing it efficiently while maintaining the privacy of the stored data. |
 |
Joel Alwen: Data-Independent Memory Hard Functions Tuesday, May 17, 2016 - 4:00pm to 5:00pm Abstract: |
 |
Rafael Pass: Analysis of the Blockchain Protocol in Asynchronous Networks Friday, May 6, 2016 - 10:30am to 12:00pm Abstract: |
 |
Ron Rothblum: Spooky Encryption and its Application Friday, May 13, 2016 - 10:30am to 12:00pm Abstract: Consider a setting where inputs x_1,...,x_n are encrypted under
independent public keys. Given the ciphertexts c_i =
Enc(pk_i,x_i), Alice outputs ciphertexts c'_1,...,c'_n that |
 |
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:
|
 |
Sanjam Garg: Avoiding Sub-Exponential Loss in Obfustopia Friday, December 11, 2015 - 10:30am to 12:00pm Abstract: Various applications of indistinguishability obfuscation suffer from an exponential loss in the security reduction. In this talk, I will describe how this loss can be circumvented in various contexts. |
 |
Power Wars: Surveillance, Drones, and Obama's Post - 9/11 Presidency Friday, December 4, 2015 - 4:00pm to 5:30pm POWER WARS: SURVEILLANCE, DRONES, AND OBAMA’S POST-9/11 PRESIDENCY Charlie Savage, Pulitzer Prize winning, New York Times journalist, |
 |
Yilei Chen: On the Correlation Intractability of Obfuscated Pseudorandom Functions Friday, December 4, 2015 - 10:30am to 12:00pm Abstract: |
 |
Charanjit Jutla: Upending Stock Market Structure Using Secure Computation Friday, November 20, 2015 - 10:30am to 12:00pm Abstract: |
 |
Fabrice Ben Hamouda: New Techniques for SPHFs and Efficient One-Round PAKE Protocols Friday, November 13, 2015 - 10:30am to 12:00pm Abstract: Password-authenticated key exchange (PAKE) protocols allow two players to agree on a shared high entropy secret key, that depends on their own passwords only. |
 |
Jean-Jacques Quisquater: Is the Group Theory Fully Used for Cryptography Friday, March 18, 2016 - 10:30am to 12:00pm Abstract: In "Rubik's for Cryptographers" Christophe Petit and Jean-Jacques Quisquater |
 |
Anne Broadbent: Quantam Homomorphic Encryption for Circuits of Low T-Gate Complexity Friday, October 30, 2015 - 10:30am to 12:00pm Abstract: Fully homomorphic encryption is an encryption method with the property that any computation on the plaintext can be performed by a party having access to the ciphertext only. |
|
|
Charles River Crypto Day at MIT Friday, October 23, 2015 - 9:30am to 4:00pm Please visit https://bostoncryptoday.wordpress.com/2015/10/ for Information |
 |
Sidharth Telang: Output-Compressing Randomized Encodings and Applications Friday, October 9, 2015 - 10:30am to 12:00pm Abstract: We consider randomized encodings (RE) that enable encoding a Turing machine P and input x into its “randomized encoding” \hat{P(x)} in sublinear, or even polylogarithmic, time in the running-time of P(x), independent of its output length. |
 |
Noah Stephens-Davidowitz: Solving SVP (and CVP) in 2^n Time via Discrete Gaussian Sampling Friday, September 25, 2015 - 10:30am to 12:00pm Abstract: We show a $2^{n+o(n)}$-time algorithm for the Shortest Vector Problem on n-dimensional lattices (improving on the previous best-known a |
Pages
