TCC 2014:

Yehuda Lindell (Ed.):
Theory of Cryptography - 11th Theory of Cryptography Conference,
TCC 2014 ,
San Diego, CA, USA,
February 24-26, 2014
Proceedings.

• Obfuscation
  • Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding , 1-25, Guy N. Rothblum , Zvika Brakerski
    bib info
  • Obfuscation for Evasive Functions , 26-51, Ran Canetti , Amit Sahai , Boaz Barak , Yael Tauman Kalai , Nir Bitansky , Omer Paneth
    bib info
  • On Extractability Obfuscation , 52-73, Rafael Pass , Kai-Min Chung , Elette Boyle
    bib info
• Applications of Obfuscation
  • Two-Round Secure MPC from Indistinguishability Obfuscation , 74-94, Shai Halevi , Craig Gentry , Sanjam Garg , Mariana Raykova
    bib info
  • Chosen Ciphertext Security via Point Obfuscation , 95-120, Goichiro Hanaoka , Takahiro Matsuda
    bib info
• Invited Talk: Collusion and Privacy in Mechanism Design , Silvio Micali
• Zero Knowledge
  • Probabilistically Checkable Proofs of Proximity with Zero-Knowledge , 121-145, Yuval Ishai , Mor Weiss
    bib info
  • Achieving Constant Round Leakage-Resilient Zero-Knowledge , 146-166, Omkant Pandey
    bib info
  • Statistical Concurrent Non-malleable Zero Knowledge , 167-191, Ivan Visconti , Rafail Ostrovsky , Amit Sahai , Claudio Orlandi , Vanishree Rao
    bib info
  • 4-Round Resettably-Sound Zero Knowledge , 192-216, Ivan Visconti , Rafail Ostrovsky , Rafael Pass , Muthuramakrishnan Venkitasubramaniam , Kai-Min Chung
    bib info
• Black-Box Separations
  • Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? , 217-239, Tal Malkin , Dana Dachman-Soled , Mohammad Mahmoody
    bib info
  • On the Power of Public-Key Encryption in Secure Computation , 240-264, Manoj Prabhakaran , Hemanta K. Maji , Mohammad Mahmoody
    bib info
  • On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations , 265-290, Takahiro Matsuda
    bib info
• Secure Computation
  • Towards Characterizing Complete Fairness in Secure Two-Party Computation , 291-316, Gilad Asharov
    bib info
  • On the Cryptographic Complexity of the Worst Functions , 317-342, Eyal Kushilevitz , Yuval Ishai , Amos Beimel , Ranjit Kumaresan
    bib info
  • Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol , 343-367, Tatsuaki Okamoto , Yoshifumi Manabe , Susumu Kiyoshima
    bib info
  • One-Sided Adaptively Secure Two-Party Computation , 368-393, Carmit Hazay , Arpita Patra
    bib info
  • Multi-linear Secret-Sharing Schemes , 394-418, Amos Beimel , Carles Padró , Aner Ben-Efraim , Ilya Tyomkin
    bib info
  • Broadcast Amplification , 419-439, Martin Hirt , Ueli Maurer , Pavel Raykov
    bib info
• Coding and Cryptographic Applications
  • Non-malleable Coding against Bit-Wise and Split-State Tampering , 440-464, Mahdi Cheraghchi , Venkatesan Guruswami
    bib info
  • Continuous Non-malleable Codes , 465-488, Jesper Buus Nielsen , Sebastian Faust , Daniele Venturi , Pratyay Mukherjee
    bib info
  • Locally Updatable and Locally Decodable Codes , 489-514, Rafail Ostrovsky , Nishanth Chandran , Bhavana Kanukurthi
    bib info
• Leakage
  • Leakage Resilient Fully Homomorphic Encryption , 515-539, Feng-Hao Liu , Alexandra Berkoff
    bib info
  • Securing Circuits and Protocols against 1/poly(k) Tampering Rate , 540-565, Yael Tauman Kalai , Dana Dachman-Soled
    bib info
  • How to Fake Auxiliary Input , 566-590, Krzysztof Pietrzak , Dimitar Jetchev
    bib info
• Encryption
  • Standard versus Selective Opening Security: Separation and Equivalence Results , 591-615, Andy Rupp , Dennis Hofheinz
    bib info
  • Dual System Encryption via Predicate Encodings , 616-637, Hoeteck Wee
    bib info
• Invited Talk: General Versus Specific Hardness Assumptions in Cryptography , Russell Impagliazzo
• Hardware-Aided Secure Protocols
  • (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens , 638-662, Jonathan Katz , Seung Geol Choi , Hong-Sheng Zhou , Dominique Schröder , Arkady Yerukhimovich
    bib info
  • Lower Bounds in the Hardware Token Model , 663-687, Vipul Goyal , Alon Rosen , Manoj Prabhakaran , Shashank Agrawal , Prabhanjan Ananth
    bib info
• Encryption and Signatures
  • Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures , 688-712, Masayuki Abe , Miyako Ohkubo , Jens Groth , Mehdi Tibouchi
    bib info
  • On the Impossibility of Structure-Preserving Deterministic Primitives , 713-738, Masayuki Abe , Jan Camenisch , Rafael Dowsley , Maria Dubovitskaya
    bib info