Cryptography and Information Security (CIS) Seminar

Jonathan Ullman: Tight Lower Bounds for Differentially Private Selection
Friday, April 28, 2017 - 10:30am to 12:00pm

Abstract: 

Sunoo Park: New Constructions of Non-Malleable Commitments and Applications
Friday, April 21, 2017 - 10:30am to 12:00pm
Abstract: Non-malleable commitments (NMC) are fundamental cryptographic
primitives.  Since their conception by Dolev, Dwork and Naor (STOC 91),
numerous applications of NMC have been discovered including
round-efficient MPC.  Recently Goyal, Pandey and Richelson (STOC 16)
Nir Bitansky: Verifiable Random Functions from Non-Interactive Witness-Indistinguishable Proofs
Friday, April 14, 2017 - 10:30am to 12:00pm
Abstract:  Verifiable random functions (VRFs), introduced by Micali, Rabin, and Vadhan (FOCS 99), are pseudorandom functions where the owner of the seed, in addition to computing the function's value at any point, can also generate a non-interactive proof that the value is correct, without comp
Aloni Cohen: Cryptography with Updates
Friday, April 7, 2017 - 10:30am to 12:00pm
Abstract: Starting with the work of Bellare, Goldreich and Goldwasser, a rich line of work has studied the design of updatable cryptographic primitives.
From Algebraic Complexity to Zero Knowledge Protocols
Friday, March 24, 2017 - 10:30am to 12:00pm

We present new techniques for achieving unconditional zero knowledge within models that combine probabilisti

Yilei Chen: Constraint-hiding constrained PRFs for NC1 from LWE
Friday, March 10, 2017 - 10:30am to 12:00pm
Abstract: 
 
Itay Berman: Zero-Knowledge Proofs of Proximity
Friday, March 17, 2017 - 10:30am to 12:00pm
Abstract:
Oxana Poburinnaya: Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
Friday, February 24, 2017 - 10:30am to 12:00pm

Abstract: Yao's garbling scheme is one of the basic building blocks of cryptographic protocol design.

Prashant Nalini Vasudevan: Average-Case Fine-Grained Hardness, and what to do with it
Friday, February 10, 2017 - 10:30am to 12:00pm

Abstract:  We present functions that are hard to compute on average for algorithms running in some fixed polynomial time, assuming widely-conjectured worst-case hardness of certain problems from the study of fine-grained complexity.

Rafael Pass: Rethinking Large-Scale Consensus through Blockchains
Friday, December 2, 2016 - 10:30am to 12:00pm

Abstract: 

Pages

Subscribe to Cryptography and Information Security (CIS) Seminar