Cryptography and Information Security (CIS) Seminar
 |
Ilan Komargodski: A Logarithmic Lower Bound for Oblivious RAM (for all parameters) Friday, September 17, 2021 - 1:00pm to 2:30pm Abstract: |
 |
Hemanta Maji: Computational Hardness of Optimal Fair Computation Friday, September 10, 2021 - 1:00pm to 2:30pm Abstract: Characterizing the limits of achievable security using the
most conservative hardness of computation assumptions is one of the
fundamental principles of cryptographic research. For instance, |
 |
Geoffroy Couteau: Title: Correlated Pseudorandom Functions from Variable-Density LPN Friday, May 28, 2021 - 3:30pm Abstract: Correlated secret randomness is a useful resource for many cryptographic applications. |
 |
Henry Corrigan-Gibbs: Lightweight Techniques for Private Heavy Hitters Friday, May 14, 2021 - 1:00pm to 2:30pm ABSTRACT: This talk will present a new protocol for solving the private heavy-hitters problem. In this problem, there are many clients and a small set of data-collection servers. Each client holds a private bitstring. |
 |
Shuichi Hirahara: Average-Case Hardness of NP from Exponential Worst-Case Hardness Assumptions Friday, April 30, 2021 - 9:30am to 11:30am Abstract: |
 |
Sophia Yakoubov: The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT Friday, April 23, 2021 - 1:00pm to 2:30pm Abstract: |
 |
Dakshita Khurana: On Removing Interaction in Non-Malleable Commitments Friday, April 9, 2021 - 1:00pm to 2:30pm |
 |
Ron Rothblum: Local Proofs Approaching the Witness Length Friday, April 2, 2021 - 1:00pm to 2:30pm Abstract |
 |
Prabhanjan Ananth: Secure Software Leasing Friday, March 26, 2021 - 1:00pm to 2:30pm Abstract: Formulating cryptographic definitions to protect against software piracy is an important research direction that has not received much attention. |
 |
Zhengzhong Jin: Non-Interactive Zero Knowledge from Sub-exponential DDH Friday, April 16, 2021 - 1:00pm to 2:30pm Abstract: We provide the first constructions of non-interactive zero-knowledge and Zap arguments for NP based on the sub-exponential hardness of Decisional Diffie-Hellman against polynomia |
Pages
