TCC 2016:

Tal Malkin and Eyal Kushilevitz (Eds.):
Theory of Cryptography - 13th International Conference,
TCC 2016 (A),
Tel Aviv, Israel,
January 10-13, 2016,

• Obfuscation I
  • Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings , 3-17, Rafael Pass , Abhi Shelat
    bib info
  • On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models , 18-48, Mohammad Mahmoody , Ameer Mohammed , Soheil Nematihaji
    bib info
  • Lower Bounds on Assumptions Behind Indistinguishability Obfuscation , 49-66, Rafael Pass , Abhi Shelat , Mohammad Mahmoody , Ameer Mohammed , Soheil Nematihaji
    bib info
  • Indistinguishability Obfuscation: From Approximate to Exact , 67-95, Vinod Vaikuntanathan , Nir Bitansky
    bib info
  • Output-Compressing Randomized Encodings and Applications , 96-124, Rafael Pass , Huijia Lin , Sidharth Telang , Karn Seth
    bib info
  • Functional Encryption for Turing Machines , 125-153, Amit Sahai , Prabhanjan Vijendra Ananth
    bib info
• Differential Privacy
  • The Complexity of Computing the Optimal Composition of Differential Privacy , 157-175, Salil P. Vadhan , Jack Murtagh
    bib info
  • Order-Revealing Encryption and the Hardness of Private Learning , 176-206, Mark Zhandry , Mark Bun
    bib info
• LWR and LPN
  • On the Hardness of Learning with Rounding over Small Modulus , 209-224, Alon Rosen , Silas Richelson , Andrej Bogdanov , Daniel Masny , Siyao Guo
    bib info
  • Two-Round Man-in-the-Middle Security from LPN , 225-248, Eike Kiltz , Stefano Tessaro , David Cash
    bib info
• Public Key Encryption, Signatures, and VRF
  • Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography , 251-281, Dennis Hofheinz
    bib info
  • Standard Security Does Imply Security Against Selective Opening for Markov Distributions , 282-305, Georg Fuchsbauer , Felix Heuer , Eike Kiltz , Krzysztof Pietrzak
    bib info
  • Non-Malleable Encryption: Simpler, Shorter, Stronger , 306-335, Yevgeniy Dodis , Daniele Venturi , Sandro Coretti , Björn Tackmann
    bib info
  • Verifiable Random Functions from Standard Assumptions , 336-362, Dennis Hofheinz , Tibor Jager
    bib info
• Complexity of Cryptographic Primitives
  • Homomorphic Evaluation Requires Depth , 365-371, Andrej Bogdanov , Chin Ho Lee
    bib info
  • On Basing Private Information Retrieval on NP-Hardness , 372-386, Vinod Vaikuntanathan , Tianren Liu
    bib info
• Obfuscation II
  • On the Correlation Intractability of Obfuscated Pseudorandom Functions , 389-415, Leonid Reyzin , Ran Canetti , Yilei Chen
    bib info
  • Reconfigurable Cryptography: A Flexible Approach to Long-Term Security , 416-445, Andy Rupp , Dennis Hofheinz , Julia Hesse
    bib info
  • Multilinear Maps from Obfuscation , 446-473, Kenneth G. Paterson , Dennis Hofheinz , Pooya Farshim , Martin R. Albrecht , Enrique Larraia
    bib info
  • Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation , 474-502, Daniel Wichs , Nir Bitansky , Omer Paneth
    bib info
• Cryptographic Assumptions (Invited Talk followed by Panel)
  by Shafi Goldwasser and Yael Tauman Kalai
• Multiparty Computation
  • Adaptive Security with Quasi-Optimal Rate , 525-541, Rafail Ostrovsky , Alon Rosen , Brett Hemenway , Silas Richelson
    bib info
  • On the Complexity of Additively Homomorphic UC Commitments , 542-565, Jesper Buus Nielsen , Thomas P. Jakobsen , Tore Kasper Frederiksen , Roberto Trifiletti
    bib info
  • Simplified Universal Composability Framework , 566-595, Douglas Wikström
    bib info
  • Characterization of Secure Multiparty Computation Without Broadcast , 596-616, Iftach Haitner , Eran Omri , Ran Cohen , Lior Rotem
    bib info
• Zero Knowledge and PCP
  • Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits , 3-32, Yuval Ishai , Guang Yang , Mor Weiss
    bib info
  • Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs , 33-64, Alessandro Chiesa , Eli Ben-Sasson , Madars Virza , Ariel Gabizon
    bib info
  • From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back , 65-82, Benny Applebaum , Pavel Raykov
    bib info
  • A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles , 83-111, Giuseppe Persiano , Ivan Visconti , Michele Ciampi , Luisa Siniscalchi
    bib info
  • Improved OR-Composition of Sigma-Protocols , 112-141, Giuseppe Persiano , Ivan Visconti , Alessandra Scafuro , Michele Ciampi , Luisa Siniscalchi
    bib info
• Oblivious RAM
  • Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM , 145-174, Srinivas Devadas , Marten van Dijk , Daniel Wichs , Elaine Shi , Ling Ren , Christopher W. Fletcher
    bib info
  • Oblivious Parallel RAM and Applications , 175-204, Rafael Pass , Kai-Min Chung , Elette Boyle
    bib info
  • Oblivious Parallel RAM: Improved Efficiency and Generic Constructions , 205-234, Stefano Tessaro , Huijia Lin , Binyi Chen
    bib info
• ABE and IBE
  • Déjà Q: Encore! Un Petit IBE , 237-258, Hoeteck Wee
    bib info
  • A Study of Pair Encodings: Predicate Encryption in Prime Order Groups , 259-288, Melissa Chase , Shashank Agrawal
    bib info
• Codes and Interactive Proofs
  • Optimal Amplification of Noisy Leakages , 291-318, Stefan Dziembowski , Sebastian Faust , Maciej Skórski
    bib info
  • Rational Sumchecks , 319-351, Alon Rosen , Pavel Hubácek , Margarita Vald , Siyao Guo
    bib info
  • Interactive Coding for Interactive Proofs , 352-366, Yevgeniy Dodis , Allison Bishop
    bib info
  • Information-Theoretic Local Non-malleable Codes and Their Applications , 367-392, Nishanth Chandran , Bhavana Kanukurthi , Srinivasan Raghuraman
    bib info
  • Optimal Computational Split-state Non-malleable Codes , 393-417, Manoj Prabhakaran , Omkant Pandey , Divesh Aggarwal , Hemanta K. Maji , Shashank Agrawal , Divya Gupta
    bib info
• Obfuscation III
  • How to Avoid Obfuscation Using Witness PRFs , 421-448, Mark Zhandry
    bib info
  • Cutting-Edge Cryptography Through the Lens of Secret Sharing , 449-479, Mark Zhandry , Ilan Komargodski
    bib info
    
  • Functional Encryption without Obfuscation , 480-511, Sanjam Garg , Craig Gentry , Shai Halevi , Mark Zhandry ,
    bib info
    
  • On Constructing One-Way Permutations from Indistinguishability Obfuscation , 512-541, Gil Segev , Gilad Asharov
    bib info
  • Contention in Cryptoland: Obfuscation, Leakage and UCE , 542-564, Mihir Bellare , Stefano Tessaro , Igors Stepanovs
    bib info
  • Point-Function Obfuscation: A Framework and Generic Constructions , 565-594, Mihir Bellare , Igors Stepanovs
    bib info
  
  

  ---

  
  Author Index