Program
| Sunday, November 12 (Johns Hopkins Club) | |
17:30-18:00 | Registration |
18:00-20:00 | Welcome Reception |
| Monday, November 13 (Charles Commons Conference Center) | |
| 08:55-09:00 | Opening Remarks |
Obfuscation Chair: Zvika Brakerski | |
| 09:00-09:20 | Limits on the Locality of Pseudorandom Generators (with Applications to Indistinguishability Obfuscation) Alex Lombardi and Vinod Vaikuntanathan |
| 09:20-09:40 | Decomposable Obfuscation: A Framework for Building Applications of Obfuscation From Polynomial Hardness Qipeng Liu and Mark Zhandry |
Functional Encryption Chair: Zvika Brakerski | |
| 09:40-10:00 | Attribute-Hiding Predicate Encryption in Bilinear Groups, Revisited Hoeteck Wee |
| 10:00-10:50 | Coffee Break |
Obfuscation and Functional Encryption Chair: Daniel Wichs | |
| 10:50-11:10 | When does Functional Encryption Imply Obfuscation? Sanjam Garg, Mohammad Mahmoody, and Ameer Mohammed |
Delegation Chair: Daniel Wichs | |
| 11:10-11:30 | On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-Interactive Arguments Omer Paneth and Guy N. Rothblum |
Constrained PRFs Chair: Daniel Wichs | |
| 11:30-11:50 | Private Constrained PRFs (and more) from LWE Zvika Brakerski, Rotem Tsabary, Vinod Vaikuntanathan, and Hoeteck Wee |
| 11:50-12:10 | Constrained Keys For Invertible Pseudorandom Functions Dan Boneh, Sam Kim, and David J. Wu |
| 12:10-13:30 | Lunch |
Databases Chair: Hoeteck Wee | |
| 13:30-13:50 | Joint slot for Can We Access a Database Both Locally and Privately? Elette Boyle, Yuval Ishai, Rafael Pass, and Mary Wootters AND Towards Doubly Efficient Private Information Retrieval Ran Canetti, Justin Holmgren, and Silas Richelson |
| 13:50-14:10 | Strengthening the Security of Encrypted Databases: Non-Transitive JOINs Ilya Mironov, Gil Segev, and Ido Shahaf |
Leakage and tampering Chair: Hoeteck Wee | |
| 14:10-14:30 | How to Construct a Leakage-Resilient (Stateless) Trusted Party Daniel Genkin, Yuval Ishai, and Mor Weiss |
| 14:30-14:50 | Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners Saeed Mahloujifar and Mohammad Mahmoody |
| 14:50-15:10 | Coffee Break |
Block-Chains Chair: Tal Rabin | |
| 15:10-15:30 | Overcoming Cryptographic Impossibility Results Using Blockchains Rishab Goyal and Vipul Goyal |
Hardness of Assumptions Chair: Tal Rabin | |
| 15:30-15:50 | On Iterative Collision Search for LPN and Subset Sum Srinivas Devadas, Ling Ren, and Hanshen Xiao |
| 15:50-16:10 | Can PPAD Hardness be Based on Standard Cryptographic Assumptions? Alon Rosen, Gil Segev, and Ido Shahaf |
| 16:10-16:30 | Break |
Impossibilities and Barriers Chair: Alessandra Scafuro | |
| 16:30-16:50 | Barriers to Black-Box Constructions of Traitor Tracing Systems Bo Tang and Jiapeng Zhang |
| 16:50-17:10 | On the impossibility of entropy reversal, and its application to zero-knowledge proofs Shachar Lovett and Jiapeng Zhang |
| 17:10-17:30 | Position-Based Cryptography and Multiparty Communication Complexity Joshua Brody, Stefan Dziembowski, Sebastian Faust, and Krzysztof Pietrzak |
| Tuesday, November 14 (Charles Commons Conference Center) | |
Signatures and VRFs Chair: Elaine Shi | |
| 09:00-09:20 | Joint slot for A Generic Approach to Constructing and Proving Verifiable Random Functions Rishab Goyal, Susan Hohenberger, Venkata Koppula, and Brent Waters AND Verifiable Random Functions from Non-Interactive Witness-Indistinguishable Proofs Nir Bitansky |
| 09:20-09:40 | An Equivalence Between Attribute-Based Signatures and Homomorphic Signatures, and New Constructions for Both Rotem Tsabary |
| 09:40-10:00 | On the One-Per-Message Unforgeability of (EC)DSA and its Variants Manuel Fersch, Eike Kiltz, and Bertram Poettering |
Fully Homomorphic Encryption Chair: Elaine Shi | |
| 10:00-10:20 | Batched Multi-hop Multi-key FHE from Ring-LWE with Compact Ciphertext Extension Long Chen, Zhenfeng Zhang, and Xueqing Wang |
| 10:20-10:50 | Coffee Break |
Encryption Chair: Ran Canetti | |
| 10:50-11:10 | The Edited Truth Shafi Goldwasser, Saleet Klein, and Daniel Wichs |
| 11:10-11:30 | A Modular Analysis of the Fujisaki-Okamoto Transformation Kathrin Hoevelmanns, Dennis Hofheinz, and Eike Kiltz |
| 11:30-11:50 | From Selective IBE to Full IBE and Selective HIBE Nico Döttling and Sanjam Garg |
| 11:50-12:10 | Multi-Key Authenticated Encryption with Corruptions: Reductions are Lossy Tibor Jager, Martijn Stam, Ryan Stanley-Oakes, and Bogdan Warinschi |
| 12:10-13:30 | Lunch |
Proofs of Work and Space Chair: Stefan Dziembowski | |
| 13:30-13:50 | On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i Jeremiah Blocki and Samson Zhou |
| 13:50-14:10 | Bandwidth Hard Functions for ASIC Resistance Ling Ren and Srinivas Devadas |
| 14:10-14:30 | Moderately Hard Functions: Definition, Instantiations, and Applications Joël Alwen and Björn Tackmann |
| 14:30-14:50 | Break |
Secret Sharing Chair: Elette Boyle | |
| 14:50-15:10 | Evolving Secret Sharing: Supporting Dynamic Thresholds and Robustness Ilan Komargodski and Anat Paskin-Cherniavsky |
| 15:10-15:30 | Linear Secret-Sharing Schemes for Forbidden Graph Access Structures Amos Beimel, Oriol Farràs, Yuval Mintz, and Naty Peter |
| 15:30-15:50 | Near-Optimal Secret Sharing and Error Correcting Codes in AC0 Kuan Cheng, Yuval Ishai, and Xin Li |
| 15:50-16:10 | Coffee Break |
Non-malleable Codes Chair: Mark Zhandry | |
| 16:10-16:30 | Inception Makes Non-malleable Codes Stronger Divesh Aggarwal, Tomasz Kazana, and Maciej Obremski |
| 16:30-16:50 | Four-state Non-malleable Codes with Explicit Constant Rate Bhavana Kanukurthi, Lakshmibhavana Obbattu, and Sruthi Sekar |
ORAM Chair: Mark Zhandry | |
| 16:50-17:10 | Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs T-H. Hubert Chan and Elaine Shi |
Functional Encryption Chair: Mark Zhandry | |
| 17:10-17:30 | Functional Encryption for Bounded Collusions, Revisited Shweta Agrawal and Alon Rosen |
Aquarium | |
| 17:30-18:30 | Transition to the Aquarium |
| 18:30-19:45 | Aquarium Tour and Reception |
Invited Talk Chair: Yuval Ishai | |
| 19:45-20:45 | To Cyclicity and Beyond! Chris Peikert and Alon Rosen |
Business Meeting and Rump Session | |
| 20:45-22:00 | Business Meeting and Rump Session |
| Wednesday, November 15 (Charles Commons Conference Center) | |
MPC With Few Rounds Chair: Omer Paneth | |
| 09:00-09:20 | On Secure Two-Party Computation in Three Rounds Prabhanjan Ananth and Abhishek Jain |
| 09:20-09:40 | Four Round Secure Computation without Setup Zvika Brakerski, Shai Halevi, and Antigoni Polychroniadou |
| 09:40-10:10 | Joint slot for Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, and Ivan Visconti AND Round-Optimal Secure Two-Party Computation from Trapdoor Permutations Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, and Ivan Visconti |
| 10:10-10:30 | Round Optimal Concurrent MPC via Strong Simulation Saikrishna Badrinarayanan, Vipul Goyal, Abhishek Jain, Dakshita Khurana, and Amit Sahai |
| 10:30-11:00 | Coffee Break |
Invited Talk Chair: Yael Kalai | |
| 11:00-12:00 | Theory for Society: Fairness in Classification Cynthia Dwork |
| 12:00-13:20 | Lunch |
MPC with Fairness Chair: Eyal Kushilevitz | |
| 13:20-13:40 | Secure Two-Party Computation with Fairness -- A Necessary Design Principle Yehuda Lindell and Tal Rabin |
| 13:40-14:00 | Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions Vanesa Daza and Nikolaos Makriyannis |
UC Secure MPC Chair: Eyal Kushilevitz | |
| 14:00-14:20 | A Unified Approach to Constructing Black-box UC Protocols in Trusted Setup Models Susumu Kiyoshima, Huijia Lin, and Muthuramakrishnan Venkitasubramaniam |
| 14:20-14:40 | Break |
Zero-Knowledge and Nomalleable Protocols Chair: Yuval Ishai | |
| 14:40-15:00 | Resettably-Sound Resettable Zero Knowledge in Constant Rounds Wutichai Chongchitmate, Rafail Ostrovsky, and Ivan Visconti |
| 15:00-15:20 | Round Optimal Concurrent Non-Malleability from Polynomial Hardness Dakshita Khurana |
| 15:20-15:40 | Zero Knowledge Protocols from Succinct Constraint Detection Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, and Nicholas Spooner |
| 15:40-16:00 | Coffee Break |
MPC Tools Chair: Dana Dachman-Soled | |
| 16:00-16:20 | Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model Carmit Hazay, Yuval Ishai, and Muthuramakrishnan Venkitasubramaniam |
| 16:20-16:40 | Adaptively Indistinguishable Garbled Circuits Zahra Jafargholi, Alessandra Scafuro, and Daniel Wichs |
| 16:40-17:00 | Resource-efficient OT combiners with active security Ignacio Cascudo, Ivan Damgård, Oriol Farràs, and Samuel Ranellucci |