Eleventh IACR Theory of Cryptography Conference
TCC 2014
February 24-26, 2014
San Diego, CA, USA
Supported by:
List of Accepted Papers
| Characterizing Complete Fairness in Secure Two-Party Computation Gilad Asharov Affiliations: Bar-Ilan University |
| Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol Susumu Kiyoshima and Yoshifumi Manabe and Tatsuaki Okamoto Affiliations: NTT and Kogakuin University and NTT |
| Probabilistically Checkable Proofs of Proximity with Zero-Knowledge Yuval Ishai and Mor Weiss Affiliations: Technion and Technion |
| On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations Takahiro Matsuda Affiliations: RISEC, AIST, Japan |
| One-Sided Adaptively Secure Two-Party Computation Carmit Hazay and Arpita Patra Affiliations: Bar-Ilan University and University of Bristol |
| Dual System Encryption via Predicate Encodings Hoeteck Wee Affiliations: CNRS, ENS Paris |
| Non-Malleable Coding Against Bit-wise and Split-State Tampering Mahdi Cheraghchi and Venkatesan Guruswami Affiliations: MIT and Carnegie Mellon University |
| Locally Updatable and Locally Decodable Codes Nishanth Chandran and Bhavana Kanukurthi and Rafail Ostrovsky Affiliations: AT&T Labs/Microsoft Research India and UCLA and UCLA |
| Standard versus Selective Opening Security: Separation and Equivalence Results Dennis Hofheinz and Andy Rupp Affiliations: Karlsruhe Institute of Technology and Karlsruhe Institute of Technology |
| Chosen Ciphertext Security via Point Obfuscation Takahiro Matsuda and Goichiro Hanaoka Affiliations: RISEC, AIST, Japan and RISEC, AIST, Japan |
| Achieving Constant Round Leakage-Resilient Zero-Knowledge Omkant Pandey Affiliations: University of Illinois at Urbana-Champaign |
| Broadcast Amplification Martin Hirt and Ueli Maurer and Pavel Raykov Affiliations: ETH Zürich and ETH Zürich and ETH Zürich |
| Multi-Linear Secret Sharing Schemes Amos Beimel and Aner M Ben-Efraim and Carles Padró and Ilya Tomkin Affiliations: Ben-Gurion University and Ben-Gurion University and Nanyang Technological University and Ben-Gurion University |
| How to Fake Auxiliary Input Dimitar Jetchev and Krzysztof Pietrzak Affiliations: EPFL, Lausanne, Switzerland and IST, Vienna, Austria |
| Statistical Concurrent Non-Malleable Zero Knowledge Claudio Orlandi and Rafail Ostrovsky and Vanishree Rao and Amit Sahai and Ivan Visconti Affiliations: Aarhus University and UCLA and UCLA and UCLA and University of Salerno |
| Leakage Resilient Fully Homomorphic Encryption Alexandra Berkoff and Feng-Hao Liu Affiliations: Brown University and University of Maryland |
| Two-round secure MPC from Indistinguishability Obfuscation Sanjam Garg and Craig Gentry and Shai Halevi and Mariana Raykova Affiliations: IBM TJ Watson and IBM TJ Watson and IBM TJ Watson and IBM TJ Watson |
| Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding Zvika Brakerski and Guy N. Rothblum Affiliations: The Weizmann Institute and Microsoft Research |
| On the Cryptographic Complexity of the Worst Functions Amos Beimel and Yuval Ishai and Ranjit Kumaresan and Eyal Kushilevitz Affiliations: Ben-Gurion University and Technion and Technion and Technion |
| Universal, Minimal and Selectively Randomizable Structure-Preserving Signatures Masayuki Abe and Jens Groth and Miyako Ohkubo and Mehdi Tibouchi Affiliations: NTT and UCL and NICT and NTT |
| Securing Circuits and Protocols Against 1/poly(k) Tampering Rate Dana Dachman-Soled and Yael Tauman Kalai Affiliations: University of Maryland and Microsoft Research New England |
| Continuous Non-malleable Codes Sebastian Faust and Pratyay Mukherjee and Jesper Buus Nielsen and Daniele Venturi Affiliations: EFPL, Lausanne and Aarhus University and Aarhus University and Sapienza University |
| Lower Bounds in the Hardware Token Model Shashank Agrawal and Prabhanjan Ananth and Vipul Goyal and Manoj Prabhakaranand Alon Rosen Affiliations: UIUC and UCLA and Microsoft Research India and UIUC and IDC Herzliya |
| On The Impossibility of Structure-Preserving Deterministic Primitives Masayuki Abe and Jan Camenisch and Rafael Dowsley and Maria Dubovitskaya Affiliations: NTT Secure Platform Laboratories, Japan and IBM Research Zürich and Karlsruhe Institute of Technology and IBM Research Zürich/ETH Zürich |
| Obfuscation for Evasive Functions Boaz Barak and Nir Bitansky and Ran Canetti and Yael Tauman Kalai and Omer Paneth and Amit Sahai Affiliations: Microsoft Research and Tel Aviv University and Boston University/Tel Aviv University and Microsoft Research and Boston University and University of California Los Angeles |
| On the Power of Public-key Encryption in Secure Computation Mohammad Mahmoody and Hemanta K Maji and Manoj Prabhakaran Affiliations: Cornell University and UCLA and UIUC |
| Can Optimally-Fair Coin Tossing be Based on One-Way Functions? Dana Dachman-Soled and Mohammad Mahmoody and Tal Malkin Affiliations: University of Maryland and University of Virginia and Columbia University/Bar-Ilan University |
| (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens Seung Geol Choi and Jonathan Katz and Dominique Schröder and Arkady Yerukhimovich and Hong Sheng Zhou Affiliations: USNA and UMD and Saarland University and MIT Lincoln Laboratory and VCU |
| 4-Round Resettably-Sound Zero Knowledge Kai-Min Chung and Rafail Ostrovsky and Rafael Pass and Muthuramakrishnan Venkitasubramaniam and Ivan Visconti Affiliations: Academia Sinica and UCLA and Cornell University and University of Rochester and University of Salerno |
| Extractable Obfuscation and Applications Elette Boyle and Kai-Min Chung and Rafael Pass Affiliations: Cornell NYC Tech and Academia Sinica and Cornell NYC Tech |