• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 38 matches

• 2011
• 
  Mihir Bellare, Brent Waters, Scott Yilek:
  Identity-Based Encryption Secure against Selective Opening Attack. TCC 2011: 235-252
• 
  Andrej Bogdanov, Alon Rosen:
  Input Locality and Hardness Amplification. TCC 2011: 1-18
• 
  Dan Boneh, Amit Sahai, Brent Waters:
  Functional Encryption: Definitions and Challenges. TCC 2011: 253-273
• 
  Zvika Brakerski, Shafi Goldwasser, Yael Tauman Kalai:
  Black-Box Circular-Secure Encryption beyond Affine Functions. TCC 2011: 201-218
• 
  Zvika Brakerski, Jonathan Katz, Gil Segev, Arkady Yerukhimovich:
  Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions. TCC 2011: 559-578
• 
  Josh Bronson, Ali Juma, Periklis A. Papakonstantinou:
  Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators. TCC 2011: 504-521
• 
  Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin:
  On the Black-Box Complexity of Optimally-Fair Coin Tossing. TCC 2011: 450-467
• 
  Ivan Damgård, Sigurd Meldgaard, Jesper Buus Nielsen:
  Perfectly Secure Oblivious RAM without Random Oracles. TCC 2011: 144-163
• 
  Nico Döttling, Daniel Kraschewski, Jörn Müller-Quade:
  Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token. TCC 2011: 164-181
• 
  Stefan Dziembowski, Tomasz Kazana, Daniel Wichs:
  One-Time Computable Self-erasing Functions. TCC 2011: 125-143
• 
  Sanjam Garg, Vipul Goyal, Abhishek Jain, Amit Sahai:
  Bringing People of Different Beliefs Together to Do UC. TCC 2011: 311-328
• 
  Johannes Gehrke, Edward Lui, Rafael Pass:
  Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy. TCC 2011: 432-449
• 
  Vipul Goyal, Adam O'Neill, Vanishree Rao:
  Correlated-Input Secure Hash Functions. TCC 2011: 182-200
• 
  Matthew Green, Susan Hohenberger:
  Practical Adaptive Oblivious Transfer from Simple Assumptions. TCC 2011: 347-363
• 
  Adam Groce, Jonathan Katz, Arkady Yerukhimovich:
  Limits of Computational Differential Privacy in the Client/Server Setting. TCC 2011: 417-431
• 
  Shai Halevi, Huijia Lin:
  After-the-Fact Leakage in Public-Key Encryption. TCC 2011: 107-124
• 
  Esther Hänggi, Jürg Wullschleger:
  Tight Bounds for Classical and Quantum Coin Flipping. TCC 2011: 468-485
• 
  Thomas Holenstein, Grant Schoenebeck:
  General Hardness Amplification of Predicates and Puzzles - (Extended Abstract). TCC 2011: 19-36
• 
  Abhishek Jain, Krzysztof Pietrzak:
  Parallel Repetition for Leakage Resilience Amplification Revisited. TCC 2011: 58-69
• 
  Jonathan Katz, Dominique Schröder, Arkady Yerukhimovich:
  Impossibility of Blind Signatures from One-Way Permutations. TCC 2011: 615-629
• 
  Jonathan Katz, Vinod Vaikuntanathan:
  Round-Optimal Password-Based Authenticated Key Exchange. TCC 2011: 293-310
• 
  Daniel Kraschewski, Jörn Müller-Quade:
  Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions. TCC 2011: 364-381
• 
  Gunnar Kreitz:
  A Zero-One Law for Secure Multi-party Computation with Ternary Outputs. TCC 2011: 382-399
• 
  Allison B. Lewko, Yannis Rouselakis, Brent Waters:
  Achieving Leakage Resilience through Dual System Encryption. TCC 2011: 70-88
• 
  Huijia Lin, Rafael Pass:
  Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs. TCC 2011: 274-292
• 
  Yehuda Lindell, Benny Pinkas:
  Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. TCC 2011: 329-346
• 
  Hemanta K. Maji, Pichayoot Ouppaphan, Manoj Prabhakaran, Mike Rosulek:
  Exploring the Limits of Common Coins Using Frontier Analysis of Protocols. TCC 2011: 486-503
• 
  Tal Malkin, Isamu Teranishi, Yevgeniy Vahlis, Moti Yung:
  Signatures Resilient to Continual Leakage on Memory and Computation. TCC 2011: 89-106
• 
  Takahiro Matsuda, Kanta Matsuura:
  On Black-Box Separations among Injective One-Way Functions. TCC 2011: 597-614
• 
  Eric Miles, Emanuele Viola:
  On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators. TCC 2011: 522-539

skipping 8 more matches