Cryptography and Information Security (CIS) Seminar

Ran Cohen: Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
Friday, November 17, 2017 - 10:30am to 12:00pm
Abstract:
Rafael Pass: Explorations into Algorithmic Fairness
Friday, October 27, 2017 - 10:30am to 12:00pm
Abstract:
 
Adi Akavia: Secure search in the cloud: homomorphic encryption meets coresets
Friday, September 15, 2017 - 10:30am to 12:00pm
Abstract
 
CIS Seminar: Amit Sahai "Why We Rewind"
Friday, July 28, 2017 - 10:30am to 12:00pm

Why do cryptographers who work on protocols keep talking about rewinding? Are they all stuck in the past? Why do we need to rewind anyway, and what does this have to do with obfuscation?

Dakshita Khurana: How to Achieve Non-malleability in One or Two Rounds, or, A Knowledge Extraction Technique for Two Round Protocols
Friday, June 16, 2017 - 10:30am to 12:00pm
Abstract: Knowledge extraction is an important technique central to several cryptographic protocols. Usually, protocols requiring knowledge extraction based on standard assumptions require at least three rounds of interaction.
On the Quantitative Hardness of CVP
Friday, May 26, 2017 - 10:30am to 12:00pm
Abstract
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.

Pages

Subscribe to Cryptography and Information Security (CIS) Seminar