Cryptography and Information Security (CIS) Seminars
 |
Post-quantum secure signature schemes from isogenies Friday, July 19, 2024 - 10:30am to 12:00pm Most public-key cryptography that is deployed in today’s systems is susceptible to attacks by quantum computers. |
 |
Indistinguishability Obfuscation from Bilinear Maps and LPN Variants Friday, September 27, 2024 - 10:30am to 12:00pm We construct an indistinguishability obfuscation (IO) scheme from the sub-exponential hardness of the decisional linear problem on bilinear groups together with two variants of the learning parity with noise (LPN) problem, namely large-field LPN and (binary-field) sparse |
 |
Universal SNARGs for NP from Proofs of Completeness Friday, May 17, 2024 - 10:30am to 12:00pm We construct a succinct non-interactive argument system (SNARG) for any NP language L, and prove the non-adaptive soundness assuming the security of an FHE scheme, a batch argument (BARG) scheme, as well as the existence of any two-message argument system for L where the |
 |
How to Construct Quantum FHE, Generically Friday, May 3, 2024 - 10:30am to 12:00pm We construct a (compact) quantum fully homomorphic encryption (QFHE) scheme starting from any (classical) fully homomorphic encryption scheme (with decryption in NC^1) together with a dual-mode trapdoor claw-free function family. |
 |
On Succinct Arguments from Ideal Hash Functions Friday, May 31, 2024 - 10:30am to 12:00pm Note: Non-standard location (P |
 |
Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable Friday, April 5, 2024 - 10:30am to 12:00pm A succinct non-interactive argument of knowledge (SNARK) allows a prover to produce a short proof that certifies the veracity of a certain NP-statement. |
 |
Learning from Nisan's natural proofs Friday, March 22, 2024 - 10:30am to 12:00pm |
 |
Adaptively Sound Zero-Knowledge SNARKs for UP Friday, March 15, 2024 - 10:30am to 12:00pm Abstract: |
 |
Unconditionally secure quantum commitments with preprocessing Friday, February 16, 2024 - 10:30am to 12:00pm Abstract: We demonstrate how to build computationally secure commitment schemes wi |
Pages
