Theory of Cryptography: 17th International Conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019, Proceedings, Part II (Lecture Notes in Computer Science Book 11892)

The two-volume set LNCS 11891 and 11892 constitutes the proceedings of the 17th International Conference on Theory of Cryptography, TCC 2019, held in Nuremberg, Germany, in December 2019. The 43 full papers presented were carefully reviewed and selected from 147 submissions. The Theory of Cryptography Conference deals with the paradigms, approaches, and techniques used to conceptualize natural cryptographic problems and provide algorithmic solutions to them and much more. -- Provided by publisher Front Matter ....Pages i-xiv Succinct Arguments in the Quantum Random Oracle Model (Alessandro Chiesa, Peter Manohar, Nicholas Spooner)....Pages 1-29 Delegating Quantum Computation in the Quantum Random Oracle Model (Jiayu Zhang)....Pages 30-60 Tighter Proofs of CCA Security in the Quantum Random Oracle Model (Nina Bindel, Mike Hamburg, Kathrin Hövelmanns, Andreas Hülsing, Edoardo Persichetti)....Pages 61-90 Attribute Based Encryption for Deterministic Finite Automata from \(\mathsf{DLIN}\) (Shweta Agrawal, Monosij Maitra, Shota Yamada)....Pages 91-117 CPA-to-CCA Transformation for KDM Security (Fuyuki Kitagawa, Takahiro Matsuda)....Pages 118-148 New Approaches to Traitor Tracing with Embedded Identities (Rishab Goyal, Venkata Koppula, Brent Waters)....Pages 149-179 A Unified and Composable Take on Ratcheting (Daniel Jost, Ueli Maurer, Marta Mularczyk)....Pages 180-210 Continuously Non-malleable Secret Sharing for General Access Structures (Gianluca Brian, Antonio Faonio, Daniele Venturi)....Pages 211-232 Interactive Non-malleable Codes (Nils Fleischhacker, Vipul Goyal, Abhishek Jain, Anat Paskin-Cherniavsky, Slava Radune)....Pages 233-263 Stronger Lower Bounds for Online ORAM (Pavel Hubáček, Michal Koucký, Karel Král, Veronika Slívová)....Pages 264-284 Adaptively Secure Garbling Schemes for Parallel Computations (Kai-Min Chung, Luowen Qian)....Pages 285-310 Statistical Difference Beyond the Polarizing Regime (Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan)....Pages 311-332 Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions and Hardness (Hamidreza Amini Khorasgani, Hemanta K. Maji, Tamalika Mukherjee)....Pages 333-355 Fully Homomorphic NIZK and NIWI Proofs (Prabhanjan Ananth, Apoorvaa Deshpande, Yael Tauman Kalai, Anna Lysyanskaya)....Pages 356-385 Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND (Eyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adi Rosén, Adrian Thillard, Damien Vergnaud)....Pages 386-406 Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles (Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta)....Pages 407-437 Compressible FHE with Applications to PIR (Craig Gentry, Shai Halevi)....Pages 438-464 Permuted Puzzles and Cryptographic Hardness (Elette Boyle, Justin Holmgren, Mor Weiss)....Pages 465-493 Linear-Size Constant-Query IOPs for Delegating Computation (Eli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Tom Gur, Michael Riabzev, Nicholas Spooner)....Pages 494-521 On the (In)security of Kilian-Based SNARGs (James Bartusek, Liron Bronfman, Justin Holmgren, Fermi Ma, Ron D. Rothblum)....Pages 522-551 Incrementally Verifiable Computation via Incremental PCPs (Moni Naor, Omer Paneth, Guy N. Rothblum)....Pages 552-576 Back Matter ....Pages 577-578