Cryptography and Information Security (CIS) Seminar
 |
Sophia Yakoubov: "Fuzzy Password-Authenticated Key Exchange" Friday, May 18, 2018 - 1:00pm to 2:00pm Abstract: |
 |
Sophia Yakoubov: "Fuzzy Password-Authenticated Key Exchange" Friday, May 11, 2018 - 1:00pm to 2:00pm Abstract: |
 |
Jack Doerner: ORAM for Secure Computation Friday, March 23, 2018 - 10:30am to 12:00pm |
|
|
Hayim Shaul: Scalable Secure Computation of Moments with Application to k-Nearest Neighbors Friday, March 9, 2018 - 10:30am to 12:00pm Abstract: Given a set S of n d-dimensional points, the k-nearest neighbors (kNN) is the problem of quickly finding k points in S that are nearest to a query point q. |
 |
Rio LaVigne: Topology Hiding Computation for All Graphs Friday, March 2, 2018 - 10:30am to 12:00pm Abstract: |
 |
Mukul Kulkarni: on-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering Friday, February 23, 2018 - 10:30am to 12:00pm Abstract:
|
 |
Saleet Klein: The Edited Truth Friday, February 2, 2018 - 10:30am to 12:00pm Abstract: We introduce two new cryptographic notions in the realm of public and symmetric key encryption.
|
 |
Yupeng Zhang: Verifiable Databases and RAM Programs Friday, February 9, 2018 - 10:30am to 12:00pm Abstract: The talk covers the following two papers:
vSQL: Verifying Arbitrary SQL Queries over Dynamic Outsourced Databases
|
 |
Xiao Wang: Authenticated Garbling: Efficient Maliciously Secure Two-Party Computation and Global-Scale Secure Multiparty Computation Friday, January 26, 2018 - 10:30am to 12:00pm Abstract: This talk consists of two papers:
== Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation ==
|
 |
Peter Byerley rindal: Fast and Secure Private Set Intersection Friday, December 8, 2017 - 1:00pm to 2:30pm Abstract: |
 |
Yilei Chen: Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encyrption Friday, December 8, 2017 - 10:30am to 12:00pm Abstract:
We construct simple functions that suffice for realizing the Fiat Shamir paradigm when applied to any interactive proof. More generally, our functions are correlation intractable w.r.t. all relations.
|
 |
Alex Lombardi: Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions Friday, December 1, 2017 - 10:30am to 12:00pm Abstract: |
 |
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. |
|
|
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: |
|
|
Joseph Bonneau: Public Randomness, Blockchains and Proofs-of-delay Friday, November 18, 2016 - 12:30pm to 2:00pm A public, unpredictable source of randomness would enable many exciting applications, starting with verifiable public lotteries. It is an essential building block for many types of smart contract requiring random inputs, from online games to random audits. |
 |
Vassilis Zikas: Fair and Robust Multi-Party Computation using a Global Transaction Ledger Friday, November 18, 2016 - 10:30am to 12:00pm Abstract: |
Pages
