BCD Edition-6
Welcome to the Bengaluru Crypto Day, 6th edition. We will have a day full of exciting topics in cryptography presented by leading researchers and students.Speakers
Venue
Sessions before the lunch break: CSA Seminar hall, room #252
Sessions after the lunch break: CSA Seminar hall, room #112
Schedule
| Time | Speaker | Title |
|---|---|---|
09:25 - 09:30 : Welcome | ||
| 09:30 - 10:15 | Suvradip Chakraborty | Proofs That Evolve: Malleable SNARKs and Their Applications in Cryptography
Abstract:
Succinct non-interactive arguments of knowledge (SNARKs) are a compact and powerful variant of non-interactive zero-knowledge proofs (NIZKs), with wide-ranging impact on verifiable computing, blockchains, and anonymous communication. A central theme in many applications is the concept of recursive SNARKs, where a proof references a previous proof to demonstrate an evolving statement. We introduce malleable SNARKs, a generalization of recursive SNARKs inspired by malleable NIZKs, which allow modifying proofs to establish related statements while remaining indistinguishable from freshly generated ones.
Our construction supports universal languages and unlocks several applications, including:
--- the first post-quantum RCCA-secure rerandomizable and updatable encryption schemes,
--- a generic construction of cryptographic reverse firewalls construction, and
--- unlinkable targeted malleable homomorphic encryption.
Technically, our approach relies on recursive proofs with unbounded depth, enabled by a new primitive, adversarial one-way function (AOWF), that may be of independent interest. We give an AOWF candidate and prove it secure in the random oracle model.
|
| 10:15 - 11:00 | Charanjit S. Jutla | Quantum Physics: Cryptographers' Kryptonite?
Abstract: The talk will review the famous Shor and Grover algorithms targeting factoring and key-search respectively, highlighting the reasons behind the huge difference in complexity. The third most important quantum algorithm is quantum error-correction itself. We show that certain fundamental assumptions about physics can have implication for scalable computing. The talk will end with speculative theories of yet undiscovered physics that can lead to different computational-complexity worlds.
|
11:00 - 11:30 : Tea/Coffee break | ||
| 11:30 - 12.15 | Kartik Nayak | Recent Advances in DAG-based protocols
Abstract: In this talk, I will discuss the advances in latency, throughput, and applicability of DAG-based protocols in both authenticated and unauthenticated settings under partial synchrony.
|
12:15 - 14:00 : Lunch break | ||
| 14:00 - 14:30 | Girisha Shankar | Navigating the PhD journey
|
| 14:30 - 15:00 | Sikhar Patranabis | Reflections on research journey
|
| 15:00 - 16:00 | Informal discussion/ Closing remarks | |