What a lovely hat
Is it made out of
tin foil
?
International Association for Cryptologic Research
International Association
for Cryptologic Research
IACR
Events
All IACR events
Asiacrypt
Crypto
Eurocrypt
CHES
FSE
PKC
TCC
RWC
Cryptology Schools
In cooperation with IACR
Publications
All IACR Publications
Journal of Cryptology
Transactions on Symmetric Cryptology
Transactions on CHES
Communications in Cryptology
Cryptology ePrint Archive
Artifact Archive
Access IACR Publications
Museum of Historic Papers
Publication Statistics
News
All News
Awards
Elections
Petitions & Statements
Services
Jobs
CryptoDB
Calendar of Events
Videos
Members
How to Join
Update Membership Information
Access IACR Publications
Subscribe to News Updates
About
About IACR
Board of Directors
Committees
Documents
Privacy Policy
Suggestions from
local search
as you type. Hit enter to search with Google.
Search
Suggestions from
local search
as you type. Hit enter to search with Google.
CryptoDB
General
About CryptoDB
Report errors
Publications
Awards
Invited talks/papers
By year
By venue
With video
Acceptance rates
BibTeX
People
Most publications
Coauthor statistics
All Program committees
Most Program committees
Papers from TCC 2011
Year
Venue
Title
2011
TCC
(Nearly) Round-Optimal Black-Box Constructions of Commitments Secure Against Selective Opening Attacks
David Xiao
2011
TCC
A Zero-One Law for Secure Multi-Party Computation with Ternary Outputs
Gunnar Kreitz
2011
TCC
Achieving Leakage Resilience Through Dual System Encryption
Allison B. Lewko
Yannis Rouselakis
Brent Waters
2011
TCC
After-the-Fact Leakage in Public-Key Encryption
Shai Halevi
Huijia Lin
2011
TCC
Black-Box Circular-Secure Encryption Beyond Affine Functions
Zvika Brakerski
Shafi Goldwasser
Yael Tauman Kalai
2011
TCC
Bringing People of Different Beliefs Together to do UC
Sanjam Garg
Vipul Goyal
Abhishek Jain
Amit Sahai
2011
TCC
Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions
Daniel Kraschewski
Jörn Müller-Quade
2011
TCC
Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs
Huijia Lin
Rafael Pass
2011
TCC
Concurrent Security and Non-malleability
★
Invited paper
Rafael Pass
2011
TCC
Correlated-Input Secure Hash Functions
Vipul Goyal
Adam O'Neill
Vanishree Rao
2011
TCC
Dense Model Theorems and Their Applications
★
Invited paper
Luca Trevisan
2011
TCC
Exploring the Limits of Common Coins Using Frontier Analysis of Protocols
Hemanta K. Maji
Pichayoot Ouppaphan
Manoj Prabhakaran
Mike Rosulek
2011
TCC
Functional Encryption: Definitions and Challenges
Dan Boneh
Amit Sahai
Brent Waters
2011
TCC
General Hardness Amplification of Predicates and Puzzles
Thomas Holenstein
Grant Schoenebeck
2011
TCC
Homomorphic Encryption: from Private-Key to Public-Key
Ron D. Rothblum
2011
TCC
Identity-Based Encryption Secure Against Selective Opening Attack
Mihir Bellare
Brent Waters
Scott Yilek
2011
TCC
Impossibility of Blind Signatures From One-Way Permutations
Jonathan Katz
Dominique Schröder
Arkady Yerukhimovich
2011
TCC
Input Locality and Hardness Amplification
Andrej Bogdanov
Alon Rosen
2011
TCC
Limits of Computational Differential Privacy in the Client/Server Setting
Adam Groce
Jonathan Katz
Arkady Yerukhimovich
2011
TCC
Limits On The Power of Zero-Knowledge Proofs in Cryptographic Constructions
Zvika Brakerski
Jonathan Katz
Gil Segev
Arkady Yerukhimovich
2011
TCC
Limits on the Stretch of Non-Adaptive Constructions of Pseudo-Random Generators
Josh Bronson
Ali Juma
Periklis A. Papakonstantinou
2011
TCC
On Black-Box Separations among Injective One-Way Functions
Takahiro Matsuda
Kanta Matsuura
2011
TCC
On the Black-Box Complexity of Optimally-Fair Coin Tossing
Dana Dachman-Soled
Yehuda Lindell
Mohammad Mahmoody
Tal Malkin
2011
TCC
On the Complexity of Non-Adaptively Increasing the Stretch of Pseudorandom Generators
Eric Miles
Emanuele Viola
2011
TCC
One-Time Computable Self-Erasing Functions
Stefan Dziembowski
Tomasz Kazana
Daniel Wichs
2011
TCC
Parallel Repetition for Leakage Resilience Amplification Revisited
Abhishek Jain
Krzysztof Pietrzak
2011
TCC
PCPs and the Hardness of Generating Private Synthetic Data
Jonathan Ullman
Salil P. Vadhan
2011
TCC
Perfectly Secure Oblivious RAM Without Random Oracles
★
TCC Test of Time Award
Ivan Damgård
Sigurd Meldgaard
Jesper Buus Nielsen
2011
TCC
Practical Adaptive Oblivious Transfer from Simple Assumptions
Matthew Green
Susan Hohenberger
2011
TCC
Round-Optimal Password-Based Authenticated Key Exchange
Jonathan Katz
Vinod Vaikuntanathan
2011
TCC
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Yehuda Lindell
Benny Pinkas
2011
TCC
Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma
★
Best Student Paper
Stefano Tessaro
2011
TCC
Signatures Resilient to Continual Leakage on Memory and Computation
Tal Malkin
Isamu Teranishi
Yevgeniy Vahlis
Moti Yung
2011
TCC
Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings
Yuval Ishai
2011
TCC
Tight Bounds for Classical and Quantum Coin Flipping
Esther Hänggi
Jürg Wullschleger
2011
TCC
Towards Non-Black-Box Lower Bounds in Cryptography
Rafael Pass
Wei-Lung Dustin Tseng
Muthuramakrishnan Venkitasubramaniam
2011
TCC
Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy
Johannes Gehrke
Edward Lui
Rafael Pass
2011
TCC
Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token
Nico Döttling
Daniel Kraschewski
Jörn Müller-Quade