Theory of Cryptography Conference (TCC) 2018: 
Amos Beimel and Stefan Dziembowski (Eds.):
Theory of Cryptography - 16th International Conference,
Panaji, Goa, India
November 11-14, 2018
Proceedings.
Crypto database info for TCC 2018
Organizational Committee
Program Chairs:
General Chairs:
General Chairs:
Amos Beimel and Stefan Dziembowski
Shweta Agrawal and Manoj Prabhakaran
Shweta Agrawal and Manoj Prabhakaran
Program Committee
Masayuki Abe
Divesh Aggarwal
Shweta Agrawal
Gilad Asharov
Amos Beimel
Andrej Bogdanov
Zvika Brakerski
Nishanth Chandran
Stefan Dziembowski
Sebastian Faust
Marc Fischlin
Iftach Haitner
Martin Hirt
Pavel Hubáček
Aggelos Kiayias
Eyal Kushilevitz
Anna Lysyanskaya
Tal Malkin
Eran Omri
Chris Peikert
Krzysztof Pietrzak
Antigoni Polychroniadou
Alon Rosen
Mike Rosulek
Vinod Vaikuntanathan
Ivan Visconti
Hoeteck Wee
Mor Weiss
Stefan Wolf
Vassilis Zikas
- Memory-hard functions and complexity theory
- Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries, 3-32,
Stefano Tessaro, Aishwarya Thiruvengadam,
bibinfo - Static-Memory-Hard Functions, and Modeling the Cost of Space vs. Time, 33-66,
Sunoo Park, Thaddeus Dryja, Quanquan C. Liu,
bibinfo - No-signaling Linear PCPs, 67-97,
Susumu Kiyoshima,
bibinfo - On Basing Search SIVP on NP-Hardness, 98-119,
Tianren Liu,
bibinfo
- Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries, 3-32,
- Two-round MPC protocols
- Two-Round MPC: Information-Theoretic and Black-Box, 123-151,
Yuval Ishai, Sanjam Garg, Akshayaram Srinivasan,
bibinfo - Perfect Secure Computation in Two Rounds, 152-174,
Benny Applebaum, Zvika Brakerski, Rotem Tsabary,
bibinfo - Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions, 175-205,
Muthuramakrishnan Venkitasubramaniam, Huijia Lin, Antigoni Polychroniadou, Fabrice Benhamouda,
bibinfo
- Two-Round MPC: Information-Theoretic and Black-Box, 123-151,
- Invited Talk
- Zero knowledge
- One-Message Zero Knowledge and Non-malleable Commitments, 209-234,
Huijia Lin, Nir Bitansky,
bibinfo - Smooth NIZK Arguments, 235-262,
Charanjit S. Jutla, Arnay Roy,
bibinfo - Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations, 263-285,
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam,
bibinfo - Round Optimal Black-Box "Commit-and-Prove", 286-313,
Rafail Ostrovsky, Dakshita Khurana, Akshayaram Srinivasan,
bibinfo
- One-Message Zero Knowledge and Non-malleable Commitments, 209-234,
- Information-theoretic cryptography
- On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate, 317-344,
Benny Applebaum, Barak Arkis,
bibinfo - Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio, 345-369,
Ueli Maurer, Daniel Jost, João Ribeiro,
bibinfo - Information-Theoretic Broadcast with Dishonest Majority for Long Messages, 370-388,
Rafail Ostrovsky, Wutichai Chongchitmate,
bibinfo - Oblivious Transfer in Incomplete Networks, 389-418,
Vinod M. Prabhakaran, Varun Narayanan,
bibinfo
- On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate, 317-344,
- Trapdoor permutations and signatures
- Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?, 421-447,
Gil Segev, Lior Rotem,
bibinfo - Enhancements are Blackbox Non-trivial: Impossibility of Enhanced Trapdoor Permutations from Standard Trapdoor Permutations, 448-475,
Mohammad Hajiabadi,
bibinfo - Certifying Trapdoor Permutations, Revisited, 476-506,
Ran Canetti, Amit Lichtenberg,
bibinfo - On the Security Loss of Unique Signatures, 507-536,
Rafael Pass, Andrew Morgan,
bibinfo
- Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?, 421-447,
- Coin-tossing and fairness
- On the Complexity of Fair Coin Flipping, 539-562,
Iftach Haitner, Eran Omri, Nikolaos Makriyannis,
bibinfo - Game Theoretic Notions of Fairness in Multi-party Coin Toss, 563-596,
Rafael Pass, Elaine Shi, Kai-Min Chung, Wei-Kai Lin, Yue Guo,
bibinfo - Achieving Fair Treatment in Algorithmic Classification, 597-625,
Rafael Pass, Andrew Morgan,
bibinfo
- On the Complexity of Fair Coin Flipping, 539-562,
- Functional and identity-based encryption
- Upgrading to Functional Encryption, 629-658,
Amit Sahai, Brent Waters, Dakshita Khurana, Saikrishna Badrinarayanan,
bibinfo - Impossibility of Simulation Secure Functional Encryption Even with Random Oracles, 659-688,
Brent Waters, Shashank Agrawal, Venkata Koppula,
bibinfo - Registration-Based Encryption: Removing Private-Key Generator from IBE, 689-718,
Sanjam Garg, Mohammad Mahmoody, Mohammad Hajiabadi, Ahmadreza Rahimi,
bibinfo
- Upgrading to Functional Encryption, 629-658,
- MPC protocols
- Topology-Hiding Computation Beyond Semi-Honest Adversaries, 3-35,
Tal Moran, Daniel Tschudi, Ueli Maurer, Rio LaVigne, Chen-Da Liu-Zhang, Marta Mularczyk,
bibinfo - Secure Computation Using Leaky Correlations (Asymptotically Optimal Constructions), 36-65,
Hemanta K. Maji, Divya Gupta, Alexander R. Block, Hai H. Nguyen,
bibinfo - Fine-Grained Secure Computation, 66-97,
Rosario Gennaro, Matteo Campanelli,
bibinfo - On the Structure of Unconditional UC Hybrid Protocols, 98-126,
Mike Rosulek, Morgan Shirley,
bibinfo
- Topology-Hiding Computation Beyond Semi-Honest Adversaries, 3-35,
- Order-revealing encryption and symmetric encryption
- Impossibility of Order-Revealing Encryption in Idealized Models, 129-158,
Mark Zhandry, Cong Zhang,
bibinfo - Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound, 177-191,
Gil Segev, Ido Shahaf,
bibinfo - A Ciphertext-Size Lower Bound for Order-Preserving Encryption with Limited Leakage, 159-176,
David Cash, Cong Zhang,
bibinfo - Towards Tight Security of Cascaded LRW2, 192-222,
Bart Mennink,
bibinfo
- Impossibility of Order-Revealing Encryption in Idealized Models, 129-158,
- Information-theoretic cryptography II and quantum cryptography
- Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments, 225-254,
Tomasz Kazana, Maciej Obremski, Luisa Siniscalchi, Ivan Damgård, Varun Raj,
bibinfo - Best Possible Information-Theoretic MPC, 255-281,
Shai Halevi, Eyal Kushilevitz, Tal Rabin, Yuval Ishai,
bibinfo - Secure Certification of Mixed Quantum States with Application to Two-Party Randomness Generation, 282-314,
Serge Fehr, Louis Salvail, Frédéric Dupuis, Philippe Lamontagne,
bibinfo - Classical Proofs for the Quantum Collapsing Property of Classical Hash Functions, 315-338,
Serge Fehr,
bibinfo
- Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments, 225-254,
- LWE-based cryptography
- Traitor-Tracing from LWE Made Simple and Attribute-Based, 341-369,
Vinod Vaikuntanathan, Brent Waters, Hoeteck Wee, Daniel Wichs, Yilei Chen,
bibinfo - Two-Message Statistically Sender-Private OT from LWE, 370-390,
Zvika Brakerski, Nico Döttling,
bibinfo - Adaptively Secure Distributed PRFs from LWE, 391-421,
Benoît Libert, Damien Stehlé, Radu Titiu,
bibinfo
- Traitor-Tracing from LWE Made Simple and Attribute-Based, 341-369,
- Invited Talk
- Encrypted Computation
Daniel Wichs,
bibinfo
- Encrypted Computation
- iO, authentication and ORAM
- A Simple Construction of iO for Turing Machines, 425-454,
Sanjam Garg, Akshayaram Srinivasan,
bibinfo - Succinct Garbling Schemes from Functional Encryption Through a Local Simulation Paradigm, 455-472,
Prabhanjan Ananth, Alex Lombardi,
bibinfo - FE and iO for Turing Machines from Minimal Assumptions, 473-512,
Shweta Agrawal, Monosij Maitra,
bibinfo - The MMap Strikes Back: Obfuscation and New Multilinear Maps Immune to CLT13 Zeroizing Attacks, 513-543,
Mark Zhandry, Fermi Ma,
bibinfo - Return of GGH15: Provable Security Against Zeroizing Attacks, 544-574,
Mark Zhandry, Fermi Ma, James Bartusek, Jiaxin Guan,
bibinfo - The Security of Lazy Users in Out-of-Band Authentication, 575-599,
Moni Naor, Gil Segev, Lior Rotem,
bibinfo
- A Simple Construction of iO for Turing Machines, 425-454,
- ORAM and PRF
- Is There an Oblivious RAM Lower Bound for Online Reads?, 603-635,
Daniel Wichs, Mor Weiss,
bibinfo - Perfectly Secure Oblivious Parallel RAM, 636-668,
Elaine Shi, T.-H. Hubert Chan, Kartik Nayak,
bibinfo - Watermarking PRFs Under Standard Assumptions: Public Marking and Security with Extraction Queries, 669-698,
Daniel Wichs, Willy Quach, Giorgos Zirdelis,
bibinfo - Exploring Crypto Dark Matter: New Simple PRF Candidates and Their Applications
, 699-729,
Dan Boneh, Amit Sahai, Yuval Ishai, Alain Passelègue, David J. Wu,
bibinfo
- Is There an Oblivious RAM Lower Bound for Online Reads?, 603-635,