TCC 2015:

Jesper Buus Nielsen and Yevgeniy Dodis (Eds.):
Theory of Cryptography - 12th Theory of Cryptography Conference
TCC 2015
Warsaw, Poland,
March 23-25, 2015, Proceedings

• On Basing Size-Verifiable One-Way Functions on NP-Hardness , 1-6, Christina Brzuska , Andrej Bogdanov
  bib info
• The Randomized Iterate, Revisited - Almost Linear Seed Length PRGs from a Broader Class of One-Way Functions , 7-35, Dawu Gu , Jian Weng , Xiangxue Li , Yu Yu
  bib info
• The Power of Negations in Cryptography , 36-65, Tal Malkin , Alon Rosen , Siyao Guo , Igor Carboni Oliveira
  bib info
• From Weak to Strong Zero-Knowledge and Applications , 66-92, Rafael Pass , Kai-Min Chung , Edward Lui
  bib info
• From Weak to Strong Zero-Knowledge and Applications , 66-92, Rafael Pass , Kai-Min Chung , Edward Lui
  bib info
• An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle , 93-109, Yehuda Lindell
  bib info

• On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation , 110-133, Dongdai Lin , Chun Guo
  bib info

• A Little Honesty Goes a Long Way - The Two-Tier Model for Secure Multiparty Computation , 134-158, Moti Yung , Aggelos Kiayias , Juan A. Garay , Ran Gelles , David S. Johnson
  bib info
• Topology-Hiding Computation , 159-181, Tal Moran , Ilan Orlov , Silas Richelson
  bib info
• Secure Physical Computation Using Disposable Circuits , 182-198, Moni Naor , Daniel Freund , Ben A. Fisch
  bib info
• Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions , 199-228, Amos Beimel , Eran Omri , Gilad Asharov , Nikolaos Makriyannis
  bib info
• Richer Efficiency/Security Trade-offs in 2PC , 229-259, Vladimir Kolesnikov , Payman Mohassel , Mike Rosulek , Ben Riva
  bib info

• Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma , 260-289, Rafael Pass , Vipul Goyal , Amit Sahai , Omkant Pandey , Huijia Lin
  bib info
• An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting , 290-318, Susumu Kiyoshima
  bib info
• General Statistically Secure Computation with Bounded-Resettable Hardware Tokens , 319-344, Nico Döttling , Daniel Kraschewski , Tobias Nilges , Jörn Müller-Quade
  bib info
• Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way , 345-374, Rafail Ostrovsky , Muthuramakrishnan Venkitasubramaniam , Alessandra Scafuro
  bib info

• A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations , 375-397, Manoj Prabhakaran , Omkant Pandey , Hemanta K. Maji , Shashank Agrawal , Divya Gupta
  bib info
• Leakage-Resilient Non-malleable Codes , 398-426, Stefan Dziembowski , Divesh Aggarwal , Tomasz Kazana , Maciej Obremski
  bib info
• Locally Decodable and Updatable Non-malleable Codes and Their Applications , 427-450, Hong-Sheng Zhou , Dana Dachman-Soled , Elaine Shi , Feng-Hao Liu
  bib info
• Tamper Detection and Continuous Non-malleable Codes , 451-480, Daniel Wichs , Zahra Jafargholi
  bib info
• Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model , 481-501, Ronald Cramer , Chaoping Xing , Carles Padró
  bib info

• Non-malleable Condensers for Arbitrary Min-entropy, and Almost Optimal Protocols for Privacy Amplification , 502-531, Xin Li
  bib info

• From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes , 532-560, Ueli M. Maurer , Daniele Venturi , Sandro Coretti , Björn Tackmann
  bib info
• Constructing and Understanding Chosen Ciphertext Security via Puncturable Key Encapsulation Mechanisms , 561-590, Goichiro Hanaoka , Takahiro Matsuda
  bib info
• Non-committing Encryption from Φ-hiding , 591-608, Rafail Ostrovsky , Alon Rosen , Brett Hemenway
  bib info
• On the Regularity of Lossy RSA - Improved Bounds and Applications to Padding-Based Encryption , 609-628, Adam Smith , Ye Zhang
  bib info
• Pseudorandom Functions and Applications
• Tightly-Secure Authenticated Key Exchange , 629-658, Eike Kiltz , Dennis Hofheinz , Yong Li , Tibor Jager , Christoph Bader
  bib info
• Key-Homomorphic Constrained Pseudorandom Functions , 31-60, Chris Peikert , Krzysztof Pietrzak , Georg Fuchsbauer , Abhishek Banerjee , Sophie Stevens
  bib info
• Aggregate Pseudo-Random
• Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs , 90-120, Carmit Hazay
  bib info
• Verifiable Random Functions from Weaker Assumptions , 121-143, Tibor Jager
  bib info

• Multi-Client Verifiable Computation with Stronger Security Guarantees , 144-168, Jonathan Katz , Hong-Sheng Zhou , S. Dov Gordon , Elaine Shi , Feng-Hao Liu
  bib info
• Public Verification of Private Effort , 169-198, Tal Moran , Alon Rosen , Giulia Alberini
  bib info
• Primary-Secondary-Resolver Membership Proof Systems , 199-228, Moni Naor , Asaf Ziv
  bib info
• Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence , 229-246, Rafael Pass , Kai-Min Chung
  bib info
• Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability , 247-276, Carla Ràfols
  bib info

• Outlier Privacy , 277-305, Rafael Pass , Edward Lui
  bib info

• Function-Private Functional Encryption in the Private-Key Setting , 306-324, Gil Segev , Zvika Brakerski
  bib info
• Functional Encryption for Randomized Functionalities , 325-351, Vipul Goyal , Amit Sahai , Venkata Koppula , Abhishek Jain
  bib info
• Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions , 352-377, Gil Segev , Ilan Komargodski , Eylon Yogev
  bib info

• Separations in Circular Security for Arbitrary Length Key Cycles , 378-400, Brent Waters , Kim Ramchen , Venkata Koppula
  bib info
• ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation , 401-427, Nir Bitansky , Omer Paneth
  bib info
• Random-Oracle Uninstantiability from Indistinguishability Obfuscation , 428-455, Pooya Farshim , Christina Brzuska , Arno Mittelbach
  bib info
• On Obfuscation with Random Oracles , 456-467, Ran Canetti , Yael Tauman Kalai , Omer Paneth
  bib info
• Obfuscation of Probabilistic Circuits and Applications , 468-497, Ran Canetti , Vinod Vaikuntanathan , Stefano Tessaro , Huijia Lin
  bib info
• Graph-Induced Multilinear Maps from Lattices , 498-527, Shai Halevi , Craig Gentry , Sergey Gorbunov
  bib info
• Obfuscating Circuits via Composite-Order Graded Encoding , 528-556, Benny Applebaum , Zvika Brakerski
  bib info
• Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds , 586-613, Jonathan Katz , Dana Dachman-Soled , Vanishree Rao
  bib info
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation , 614-637, Sanjam Garg , Antigoni Polychroniadou
  bib info
• Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP , 638-667, Amit Sahai , Manoj Prabhakaran , Omkant Pandey
  bib info
• Public-Coin Differing-Inputs Obfuscation and Its Applications , 668-697, Amit Sahai , Yuval Ishai , Omkant Pandey
  bib info