TCC 2016:

Martin Hirt and Adam Smith (Eds.):
Theory of Cryptography - 14th International Conference
TCC 2016-B,
Beijing, China
October 31 - November 3, 2016
Proceedings.

• TCC Test-of-Time Award
  • From Indifferentiability to Constructive Cryptography (and Back)
    Ueli Maurer and Renato Renner , bib info ; (paper not available)
• Foundations
  • Fast Pseudorandom Functions Based on Expander Graphs , 27-56, Benny Applebaum , Pavel Raykov
    bib info
  • 3-Message Zero Knowledge Against Human Ignorance , 57-83, Vinod Vaikuntanathan , Yael Tauman Kalai , Zvika Brakerski , Nir Bitansky , Omer Paneth
    bib info
  • The GGM Function Family Is a Weakly One-Way Family of Functions , 84-107, Aloni Cohen , Saleet Klein
    bib info
  • On the (In)security of SNARKs in the Presence of Oracles , Dario Fiore and Anca Nitulescu ; bib
  • Leakage Resilient One-Way Functions: The Auxiliary-Input Setting , Ilan Komargodski , bib info
  • Simulating Auxiliary Inputs, Revisited , 159-179, Maciej Skórski
    bib info
• Unconditional Security
  • Pseudoentropy: Lower-Bounds for Chain Rules and Transformations , 183-203, Krzysztof Pietrzak , Maciej Skórski
    bib info
  • Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement , 204-234, Ivan Damgård , Ignacio Cascudo , Samuel Ranellucci , Felipe Lacerda
    bib info
  • Simultaneous Secrecy and Reliability Amplification for a General Channel Model , 235-261, Russell Impagliazzo , Stefano Tessaro , Ragesh Jaiswal , Valentine Kabanets , Bruce M. Kapron , Valerie King
    bib info
  • Proof of Space from Stacked Expanders , 262-285, Srinivas Devadas , Ling Ren
    bib info
  • Perfectly Secure Message Transmission in Two Rounds , 286-304, Gabriele Spini , Gilles Zémor
    bib info
• Foundations of Multi-Party Protocols
  • Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious , 307-335, Eran Omri , Bar Alon
    bib info
  • Binary AMD Circuits from Secure Multiparty Computation , 336-366, Yuval Ishai , Daniel Genkin , Mor Weiss
    bib info
  • Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity , 367-399, Carmit Hazay , Muthuramakrishnan Venkitasubramaniam , Antigoni Polychroniadou
    bib info
  • Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions , 400-432, Carmit Hazay , Muthuramakrishnan Venkitasubramaniam
    bib info
  • Adaptive Security of Yao's Garbled Circuits , 433-458, Daniel Wichs , Zahra Jafargholi
    bib info
• Round Complexity & Efficiency of Multi-Party Computation
  • Efficient Secure Multiparty Computation with Identifiable Abort , 461-490, Emmanuela Orsini , Carsten Baum , Peter Scholl
    bib info
  • Constant-Round Maliciously Secure Two-Party Computation in the RAM Model , 521-553, Carmit Hazay , Avishay Yanai
    bib info
  • More Efficient Constant-Round Multi-party Computation from BMR and SHE , 554-581, Nigel P. Smart , Yehuda Lindell , Eduardo Soria-Vazquez
    bib info
  • Cross and Clean: Amortized Garbled Circuits with Constant Overhead , 582-603, Jesper Buus Nielsen , Claudio Orlandi
    bib info
• Differential Privacy
  • Separating Computational and Statistical Differential Privacy in the Client-Server Model , 607-634, Salil P. Vadhan , Mark Bun , Yi-Hsiu Chen
    bib info
  • Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds , 635-658, Mark Bun , Thomas Steinke
    bib info
  • Strong Hardness of Privacy from Weak Traitor Tracing , 659-689, Tal Malkin , Jonathan Ullman , Mark Zhandry , Lucas Kowalczyk
    bib info
• Delegation and IP
  • Delegating RAM Computations with Adaptive Soundness and Privacy , 3-30, Huijia Lin , Kai-Min Chung , Prabhanjan Ananth , Yu-Chi Chen , Wei-Kai Lin
    bib info
  • Interactive Oracle Proofs , 31-60, Alessandro Chiesa , Eli Ben-Sasson , Nicholas Spooner
    bib info
  • Adaptive Succinct Garbled RAM or: How to Delegate Your Database , 61-90, Ran Canetti , Mariana Raykova , Justin Holmgren , Yilei Chen
    bib info
• Public-Key Encryption
  • Standard Security Does Not Imply Indistinguishability Under Selective Opening , 121-145, Dennis Hofheinz , Daniel Wichs , Vanishree Rao
    bib info
  • Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts , 146-168, Andy Rupp , Dennis Hofheinz , Tibor Jager
    bib info
  • Towards Non-Black-Box Separations of Public Key Encryption and One Way Function , 169-191, Dana Dachman-Soled
    bib info
  • Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms , Ehsan Ebrahimi Targhi and Dominique Unruh , bib info
  • Multi-key FHE from LWE, Revisited , 217-238, Chris Peikert , Sina Shiehian
    bib info
• Obfuscation and Multilinear Maps
  • Secure Obfuscation in a Weak Multilinear Map Model , 241-268, Amit Sahai , Sanjam Garg , Eric Miles , Mark Zhandry , Pratyay Mukherjee , Akshayaram Srinivasan
    bib info
  • Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents , 269-296, Manoj Prabhakaran , Shashank Agrawal , Ching-Hua Yu
    bib info
• Attribute-Based Encryption
  • Deniable Attribute Based Encryption for Branching Programs from LWE , Daniel Apon , Xiong Fan , Feng-Hao Liu , bib info ; (paper not available)
  • Targeted Homomorphic Attribute-Based Encryption , 330-360, Hoeteck Wee , David Cash , Zvika Brakerski , Rotem Tsabary
    bib info
  • Semi-adaptive Security and Bundling Functionalities Made Generic and Easy , 361-388, Brent Waters , Venkata Koppula , Rishab Goyal
    bib info
• Functional Encryption
  • From Cryptomania to Obfustopia Through Secret-Key Functional Encryption , 391-418, Daniel Wichs , Nir Bitansky , Ryo Nishimaki , Alain Passelègue
    bib info
  • Compactness vs Collusion Resistance in Functional Encryption , 443-468, Daniele Micciancio , Baiyu Li
    bib info
• Secret Sharing
  • Threshold Secret Sharing Requires a Linear Size Alphabet , Andrej Bogdanov , Siyao Guo , Ilan Komargodski , bib info ; (paper not available)
  • How to Share a Secret, Infinitely , 485-514, Moni Naor , Ilan Komargodski , Eylon Yogev
    bib info
• New Models
  • Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond , 517-546, Hong-Sheng Zhou , Jeremiah Blocki
    bib info
  • Access Control Encryption: Enforcing Information Flow with Cryptography , Ivan Damgård , Helene Haagh , Claudio Orlandi , bib info