TCC 2012:

Ronald Cramer (Ed.):
Theory of Cryptography - 9th Theory of Cryptography Conference - TCC 2012,
TCC 2012,
Taormina, Sicily, Italy,
March 19-21, 2012
Proceedings.

• On Efficient Zero-Knowledge PCPs , 151-168, Amit Sahai , Yuval Ishai , Mohammad Mahmoody
  bib info
• Confidentiality and Integrity: A Constructive Perspective , 209-229, Ueli M. Maurer , Andreas Rüedlinger , Björn Tackmann
  bib info
• On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction , 285-302, Jacques Patarin , Yannick Seurin , Avradip Mandal
  bib info
• Computing on Authenticated Data , 1-20, Jan Camenisch , Dan Boneh , Susan Hohenberger , Abhi Shelat , Brent Waters , Jae Hyun Ahn
  bib info
• Computational Extractors and Pseudorandomness , 383-403, Rosario Gennaro , Tal Malkin , Hugo Krawczyk , Dana Dachman-Soled
  bib info
• On the Security of the "Free-XOR" Technique , 39-53, Jonathan Katz , Seung Geol Choi , Hong-Sheng Zhou , Ranjit Kumaresan
  bib info
• Lower Bounds in Differential Privacy , 321-338, Anindya De
  bib info
• Leakage-Tolerant Interactive Protocols , 266-284, Shai Halevi , Ran Canetti , Nir Bitansky
  bib info
• From Non-adaptive to Adaptive Pseudorandom Functions , 357-368, Iftach Haitner , Itay Berman
  bib info
• Functional Re-encryption and Collusion-Resistant Obfuscation , 404-421, Vinod Vaikuntanathan , Melissa Chase , Nishanth Chandran
  bib info
• Lossy Functions Do Not Amplify Well , 458-475, Krzysztof Pietrzak , Alon Rosen , Gil Segev
  bib info
• On the Instantiability of Hash-and-Sign RSA Signatures , 112-132, Yevgeniy Dodis , Iftach Haitner , Aris Tentes
  bib info
• A Parallel Repetition Theorem for Leakage Resilience , 248-265, Yael Tauman Kalai , Zvika Brakerski
  bib info
• Identifying Cheaters without an Honest Majority , 21-38, Rafail Ostrovsky , Hakan Seyalioglu , Yuval Ishai
  bib info
• Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations , 636-653, Dario Fiore , Dominique Schröder
  bib info
• Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions , 94-111, David Pointcheval , Damien Vergnaud , Olivier Blazy
  bib info
• Non-interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions , 75-93, Benoît Libert , Moti Yung
  bib info
• Secure Two-Party Computation with Low Communication , 54-74, Ivan Damgård , Carmit Hazay , Sebastian Faust
  bib info
• Subspace LWE , 548-563, Krzysztof Pietrzak
  bib info
• Resettable Statistical Zero Knowledge , 494-511, Ivan Visconti , Rafail Ostrovsky , Sanjam Garg , Akshay Wadia
  bib info
• Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures , 133-150, Jung Hee Cheon , Jae Hong Seo
  bib info
• Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry , 303-320, Martijn Stam , Dimitar Jetchev , Onur Özen
  bib info
• The Knowledge Tightness of Parallel Zero-Knowledge , 512-529, Rafael Pass , Wei-Lung Dustin Tseng , Kai-Min Chung
  bib info
• On Black-Box Reductions between Predicate Encryption Schemes , 440-457, Vipul Goyal , Virendra Kumar , Satyanarayana V. Lokam , Mohammad Mahmoody
  bib info
• How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption , 422-439, Vinod Vaikuntanathan , Bryan Parno , Mariana Raykova
  bib info
• A Dichotomy for Local Small-Bias Generators , 600-617, Andrej Bogdanov , Alon Rosen , Benny Applebaum
  bib info
• Leakage-Resilient Circuits without Computational Assumptions , 230-247, Stefan Dziembowski , Sebastian Faust
  bib info
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments , 169-189, Helger Lipmaa
  bib info
• Bounded-Collusion IBE from Key Homomorphism , 564-581, Shafi Goldwasser , David A. Wilson , Allison B. Lewko
  bib info
• Hardness Preserving Constructions of Pseudorandom Functions , 369-382, Krzysztof Pietrzak , Abhishek Jain , Aris Tentes
  bib info
• Iterative Constructions and Private Data Release , 339-356, Jonathan Ullman , Anupam Gupta , Aaron Roth
  bib info
• Point Obfuscation and 3-Round Zero-Knowledge , 190-208, Nir Bitansky , Omer Paneth
  bib info
• A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy , 582-599, Leonid Reyzin , Adam O'Neill , Benjamin Fuller
  bib info
• Counterexamples to Hardness Amplification beyond Negligible , 476-493, Yevgeniy Dodis , Tal Moran , Daniel Wichs , Abhishek Jain
  bib info
• Simultaneously Resettable Arguments of Knowledge , 530-547, Ivan Visconti , Rafail Ostrovsky , Chongwon Cho , Alessandra Scafuro
  bib info