Cryptography and Information Security (CIS) Seminar
 |
Leo de Castro: Functional Commitments for All Functions, under Transparent Setup and Standard Lattice Assumptions Friday, February 17, 2023 - 10:30am to 12:00pm Abstract: A functional commitment scheme enables a user to concisely commit to a function from a specified family, then later concisely and verifiab |
 |
Lakyah Tyner: Nearly Optimal Property Preserving Hashing Friday, February 10, 2023 - 10:30am to 12:00pm Abstract: Property-preserving hashing (PPH) consists of a family of compressing hash functions h such that, for any two inputs x, y, we can correctly identify whether some property P(x, y) holds given only the digests h(x), h(y). |
 |
In-person CryptoDay at Northeastern Friday, April 29, 2022 - 9:00am to 4:00pm
|
 |
Anne Broadbent: Bob's sidekick(or how limitations on tripartite quantum correlations are useful for cryptography) Friday, March 4, 2022 - 10:30am to 12:00pm Abstract: |
 |
Anne Broadbent: Bob’s sidekick (or how tripartite quantum correlations are weaker than you thought and how this is useful for cryptography) Friday, December 10, 2021 - 1:00pm Abstract: |
 |
Merav Parter: A Graph Theoretic Approach for Resilient Distributed Algorithms Monday, December 6, 2021 - 4:00pm to 5:00pm Abstract: |
 |
Lior Rotem: Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Sigma- Protocols Friday, November 5, 2021 - 1:00pm to 2:30pm Abstract: |
 |
Qipeng Liu: Hidden Cosets and Applications to Unclonable Cryptography Friday, October 29, 2021 - 1:00pm to 2:30pm Abstract:
|
 |
Katerina Sotiraki: Sumcheck Arguments and their Applications Friday, October 22, 2021 - 1:00pm to 2:30pm Abstract: In this talk, I will present sumcheck arguments; a new class |
 |
Gregory Meyer: Classical Verification of Quantum Computational Advantage Friday, October 8, 2021 - 1:00pm to 2:30pm ABSTRACT: Recent |
 |
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 |
 |
Alex Lombardi: Fiat-Shamir via List-Recoverable Codes Friday, March 5, 2021 - 1:00pm to 2:30pm Abstract: We construct hash functions that, assuming the hardness of LWE, securely realize the Fiat-Shamir transform (in the standard model) for the following rich classes of protocols: |
|
|
Jiayu Zhang: Succinct Blind Quantum Computation Using a Random Oracle Friday, March 19, 2021 - 1:00pm to 2:30pm |
 |
Rachel Zhang: SNARGs for Bounded Depth Computations Friday, February 26, 2021 - 1:00pm to 2:30pm Abstract: The Fiat-Shamir heuristic allows one to make interactive protocols non-interactive by replacing the verifier with hash functions. |
 |
Rafael Pass: On One-way Functions and Kolmogorov Complexity Friday, February 19, 2021 - 1:00pm to 2:30pm
Abstract:
We prove the equivalence of two fundamental problems in the theory of computing. |
 |
Yantian (Tina) Zhang: Classical proofs of quantum knowledge Friday, February 5, 2021 - 10:30am to 12:00pm Abstract: We define the notion of a proof of knowledge in the setting where the verifier is classical, but the prover is quantum, and where the witness that the prover holds is in general a quantum state. |
 |
2 Part Seminar, Aayush Jain, Huijia (Rachel) Lin and Amit Sahai: Indistinguishability Obfuscation from Well-Founded Assumptions Friday, December 4, 2020 - 1:00pm to 4:00pm Abstract:
|
 |
Romain Gay: Indistinguishability Obfuscation from Circular Security Friday, November 20, 2020 - 1:00pm to 2:30pm Abstract:
We show the existence of indistinguishability obfuscators (iO) for general circuits assuming subexponential security of: - the Learning with Error (LWE) assumption (with subexponential modulus-to-noise ratio); |
 |
Daniel Wichs: Candidate Obfuscation via Oblivious LWE Sampling Friday, October 30, 2020 - 1:00pm to 2:30pm Abstract: We present a new, simple candidate construction of indistinguishability obfuscation (iO). Our scheme is inspired by lattices and learning-with-errors (LWE) techniques, but we are unable to prove security under a standard assumption. |
 |
Benny Applebaum: The Round Complexity of Perfectly-Secure Multiparty Computation Thursday, July 2, 2020 - 1:00pm to 2:00pm Abstract: This talk is a follow-up to June 11th CIS seminar, but will be mostly self-contained. |
 |
Benny Applebaum: The Round Complexity of Perfectly-Secure Multiparty Computation Thursday, June 11, 2020 - 12:00pm to 1:30pm Abstract: |
Pages
