Theory of Cryptography Conference (TCC) 2019:

Alon Rosen and Dennis Hofheinz (Eds.):
TCC 2019,
Nuremberg, Germany
December 01-05, 2019
Proceedings.

• Algebraically Structured LWE, Revisited, 1-23, Chris Peikert, Zachary Pepin
  bib info
• Lattice Trapdoors and IBE from Middle-Product LWE, 24-54, Vinod Vaikuntanathan, Alex Lombardi, Thuy Duong Vuong
  bib info
• Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation, 55-80, Vinod Vaikuntanathan, Hoeteck Wee, Yilei Chen, Minki Hhan
  bib info
• Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems, 81-110, Steven D. Galbraith, Lukas Zobernig
  bib info
• A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement, 111-130, Daniele Venturi, Daniel Masny, Daniele Friolo
  bib info
• Synchronous Consensus with Optimal Asynchronous Fallback Guarantees, 131-150, Jonathan Katz, Julian Loss, Erica Blum
  bib info
• Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank, 151-173, Josh Alman, Robin Hui
  bib info
• Optimal Bounded-Collusion Secure Functional Encryption, 174-198, Vinod Vaikuntanathan, Prabhanjan Ananth
  bib info
• From FE Combiners to Secure MPC and Back, 199-228, Amit Sahai, Prabhanjan Ananth, Saikrishna Badrinarayanan, Aayush Jain, Nathan Manohar
  bib info
• (Pseudo) Random Quantum States with Binary Phase, 229-250, Zvika Brakerski, Omri Shmueli
  bib info
• General Linear Group Action on Tensors: A Candidate for Post-quantum Cryptography, 251-281, Aaram Yun, Fang Song, Zhengfeng Ji, Youming Qiao
  bib info
• Composable and Finite Computational Security of Quantum Message Transmission, 282-311, Christopher Portmann, Ueli Maurer, Fabio Banfi, Jiamin Zhu
  bib info
• Invited Talk: A Complexity-Theoretic Perspective on Algorithmic Fairness, Omer Reingold
• On Fully Secure MPC with Solitary Output, 312-340, Shai Halevi, Eyal Kushilevitz, Tal Rabin, Yuval Ishai, Nikolaos Makriyannis
  bib info
• Secure Computation with Preprocessing via Function Secret Sharing, 341-371, Yuval Ishai, Niv Gilboa, Elette Boyle
  bib info
• Efficient Private PEZ Protocols for Symmetric Functions, 372-392, Kazuo Ohta, Mitsugu Iwamoto, Yoshiki Abe
  bib info
• Best young researcher award
  The Function-Inversion Problem: Barriers and Opportunities, 393-421, Henry Corrigan-Gibbs, Dmitry Kogan
  bib info
• On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations, 422-450, Nir Bitansky, Akshay Degwekar
  bib info
• Characterizing Collision and Second-Preimage Resistance in Linicrypt, 451-470, Mike Rosulek, Ian McQuoid, Trevor Swope
  bib info
• Efficient Information-Theoretic Secure Multiparty Computation over Z/p^kZ via Galois Rings, 471-501, Ronald Cramer, Chen Yuan, Ivan DamgÃ¥rd, Daniel Escudero, Mark Abspoel
  bib info
• Is Information-Theoretic Topology-Hiding Computation Possible?, 502-530, Tal Malkin, Tal Moran, Elette Boyle, Ran Cohen, Marshall Ball
  bib info
• Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation, 531-560, Ronen Shaltiel, Iftach Haitner, Noam Mazor, Jad Silbak
  bib info
• On Perfectly Secure 2PC in the OT-Hybrid Model, 561-595, Anat Paskin-Cherniavsky, Bar Alon
  bib info
• Succinct Arguments in the Quantum Random Oracle Model, 1-29, Alessandro Chiesa, Nicholas Spooner, Peter Manohar
  bib info
• Delegating Quantum Computation in the Quantum Random Oracle Model, 30-60, Jiayu Zhang
  bib info
• Tighter Proofs of CCA Security in the Quantum Random Oracle Model, 61-90, Edoardo Persichetti, Mike Hamburg, Andreas Hülsing, Nina Bindel, Kathrin Hövelmanns
  bib info
• Invited Talk: Indistinguishability Obfuscation without Multilinear Maps, Rachel Lin
• New Approaches to Traitor Tracing with Embedded Identities, 149-179, Brent Waters, Venkata Koppula, Rishab Goyal
  bib info
• CPA-to-CCA Transformation for KDM Security, 118-148, Takahiro Matsuda, Fuyuki Kitagawa
  bib info
• Attribute Based Encryption for Deterministic Finite Automata from DLIN, 91-117, Shweta Agrawal, Shota Yamada, Monosij Maitra
  bib info
• A Unified and Composable Take on Ratcheting, 180-210, Ueli Maurer, Daniel Jost, Marta Mularczyk
  bib info
• Continuously Non-malleable Secret Sharing for General Access Structures, 211-232, Daniele Venturi, Antonio Faonio, Gianluca Brian
  bib info
• Interactive Non-malleable Codes, 233-263, Vipul Goyal, Abhishek Jain, Anat Paskin-Cherniavsky, Nils Fleischhacker, Slava Radune
  bib info
• Stronger Lower Bounds for Online ORAM, 264-284, Pavel Hubáček, Michal Koucký, Karel Král, Veronika Slívová
  bib info
• Adaptively Secure Garbling Schemes for Parallel Computations, 285-310, Kai-Min Chung, Luowen Qian
  bib info
• TCC test of time award talk: How bad is worst-case data if you know where it comes from?, Paul Valiant
• Statistical Difference Beyond the Polarizing Regime, 311-332, Itay Berman, Ron D. Rothblum, Prashant Nalini Vasudevan, Akshay Degwekar
  bib info
• Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions and Hardness, 333-355, Hemanta K. Maji, Hamidreza Amini Khorasgani, Tamalika Mukherjee
  bib info
• Fully Homomorphic NIZK and NIWI Proofs, 356-385, Anna Lysyanskaya, Yael Tauman Kalai, Prabhanjan Ananth, Apoorvaa Deshpande
  bib info
• Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND, 386-406, Rafail Ostrovsky, Damien Vergnaud, Emmanuel Prouff, Eyal Kushilevitz, Adi Rosén, Adrian Thillard
  bib info
• Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles, 407-437, Sanjam Garg, Zvika Brakerski, Nico Döttling, Giulio Malavolta
  bib info
• Compressible FHE with Applications to PIR, 438-464, Shai Halevi, Craig Gentry
  bib info
• Permuted Puzzles and Cryptographic Hardness, 465-493, Elette Boyle, Mor Weiss, Justin Holmgren
  bib info
• Linear-Size Constant-Query IOPs for Delegating Computation, 494-521, Alessandro Chiesa, Eli Ben-Sasson, Nicholas Spooner, Michael Riabzev, Lior Goldberg, Tom Gur
  bib info Nicholas Spooner
• On the (In)security of Kilian-Based SNARGs (paper not available), 522-551, Ron D. Rothblum, Justin Holmgren, Fermi Ma, James Bartusek, Liron Bronfman
  bib info