Cryptography and Information Security (CIS) Seminar

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
Abstract:
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:

The stock markets have two primary functions, that of providing liquidity and price discovery. While the market micro-structure

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
(Notices of AMS, June/July  2013, Volume 60, Issue 06, pp. 733-739) gave 3 examples
of parallel research about cryptographic Cayley hash functions and Babai's conjecture on the

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.

Pages

Subscribe to Cryptography and Information Security (CIS) Seminar