TCC 2013:

Amit Sahai (Ed.):
Theory of Cryptography - 10th Theory of Cryptography Conference - TCC 2013,
Tokyo, Japan,
March 3-6, 2013
Proceedings.

• Overcoming Weak Expectations , 1, Yevgeniy Dodis , Yu Yu
  bib info
• A Counterexample to the Chain Rule for Conditional HILL Entropy, and what Deniable Encryption has to do with it , 23, Krzysztof Pietrzak , Stephan Krenn , Akshay Wadia
  bib info
• Hardness Preserving Reductions via Cuckoo Hashing , 40, Moni Naor , Iftach Haitner , Itay Berman , Ilan Komargodski
  bib info
• Concurrent Zero Knowledge in the Bounded Player Model , 60, Ivan Visconti , Rafail Ostrovsky , Vipul Goyal , Abhishek Jain , Silas Richelson
  bib info
• Public-Coin Concurrent Zero-Knowledge in the Global Hash Model , 80, Ran Canetti , Huijia Lin , Omer Paneth
  bib info
• Succinct Malleable NIZKs and an Application to Compact Shuffles , 100, Anna Lysyanskaya , Melissa Chase , Markulf Kohlweiss , Sarah Meiklejohn
  bib info
• Encrypted Messages from the Heights of Cryptomania , 120, Craig Gentry
  bib info
• Attribute-Based Functional Encryption on Lattices , 122, Xavier Boyen
  bib info
• When Homomorphism Becomes a Liability , 142, Zvika Brakerski
  bib info
• Garbling XOR Gates "For Free" in the Standard Model , 161, Benny Applebaum
  bib info
• Why "Fiat-Shamir for Proofs" Lacks a Proof , 181, Yael Tauman Kalai , Daniel Wichs , Dana Dachman-Soled , Sanjam Garg , Abhishek Jain , Nir Bitansky , Adriana Lopez-Alt
  bib info NULL
• On the (In)security of Fischlin's Paradigm , 201, Vipul Goyal , Raghav Bhaskar , Vanishree Rao , Prabhanjan Ananth
  bib info
• Signatures of Correct Computation , 221, Roberto Tamassia , Elaine Shi , Charalampos Papamanthou
  bib info
• A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness , 241, Yehuda Lindell , Tal Rabin , Gilad Asharov
  bib info
• Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities , 261, Mike Rosulek , R. Amzi Jeffs
  bib info
• Feasibility and Completeness of Cryptographic Tasks in the Quantum World , 279, Serge Fehr , Jonathan Katz , Hong-Sheng Zhou , Vassilis Zikas , Fang Song
  bib info
• Languages with Efficient Zero-Knowledge PCPs are in SZK , 295, David Xiao , Mohammad Mahmoody
  bib info
• Succinct Non-Interactive Arguments via Linear Interactive Proofs , 315, Rafail Ostrovsky , Yuval Ishai , Nir Bitansky , Omer Paneth , Alessandro Chiesa
  bib info
• Barriers to Provably-Secure Perfect NIZK and Non-interactive Non-malleable Commitments , 334, Rafael Pass
  bib info
• Secure Computation for Big Data , 354, Tal Malkin
  bib info
• Communication Locality in Secure Multi-Party Computation: How to Run Sublinear Algorithms in a Distributed Setting , 355, Shafi Goldwasser , Stefano Tessaro , Elette Boyle
  bib info
• Distributed Oblivious RAM for Secure Two-Party Computation , 375, Rafail Ostrovsky , Steve Lu
  bib info
• Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead , 395, abhi shelat , Steven Myers , Mona Sergi
  bib info
• Testing the Lipschitz Property over Product Distributions with Applications to Data Privacy (paper not available), 415, Abhradeep Thakurta , Kashyap Dixit , Madhav Jha , Sofya Raskhodnikova
  bib info
• Limits on the Usefulness of Random Oracles , 435, Iftach Haitner , Eran Omri , Hila Zarosim
  bib info
• Analyzing Graphs with Node Differential Privacy , 455, Adam Smith , Kobbi Nissim , Sofya Raskhodnikova , Shiva Kasiviswanathan
  bib info
• Universally Composable Synchronous Computation , 475, Ueli M. Maurer , Jonathan Katz , Vassilis Zikas , Bjorn Tackmann
  bib info
• Multi-Client Non-Interactive Verifiable Computation , 497, Carlos Cid , Jonathan Katz , Seung Geol Choi , Ranjit Kumaresan
  bib info
• On the Feasibility of Extending Oblivious Transfer , 517, Yehuda Lindell , Hila Zarosim
  bib info
• Computational Soundness of Coinductive Symbolic Security under Active Attacks , 537, Mohammad Hajiabadi , Bruce M. Kapron
  bib info
• Revisiting Lower and Upper Bounds for Selective Decommitments , 557, Ivan Visconti , Rafail Ostrovsky , Vanishree Rao , Alessandra Scafuro
  bib info
• On the Circular Security of Bit-Encryption , 577, Ron D. Rothblum
  bib info
• Cryptographic Hardness of Random Local Functions -- Survey , 597, Benny Applebaum
  bib info
• On the Power of Correlated Randomness in Secure Computation , 598, Eyal Kushilevitz , Yuval Ishai , Claudio Orlandi , Sigurd Meldgaard , Anat Paskin-Cherniavsky
  bib info
• Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing , 618, Ivan Damgård , Sarah Zakarias
  bib info
• Implementing resettable UC-functionalities with untrusted tamper-proof hardware-tokens , 639, Jörn Müller-Quade , Nico Döttling , Thilo Mie , Tobias Nilges
  bib info
• A Cookbook for Black-Box Separations and a Recipe for UOWHFs , 659, Thomas Holenstein , Kfir Barhum
  bib info
• Algebraic (Trapdoor) One Way Functions and their Applications , 679, Dario Catalano , Rosario Gennaro , Dario Fiore , Konstantinos Vamvourellis
  bib info
• Randomness-Dependent Message Security , 699, Rafael Pass , Eleanor Birrell , Kai-Min Chung , Sidharth Telang
  bib info
• ERRATA: (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks , 719, David Xiao
  bib info