• 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 27 matches

• 2017
• 
  Ling Ren, Srinivas Devadas:
  Bandwidth Hard Functions for ASIC Resistance. TCC (1) 2017: 466-492
• 
  Bo Tang, Jiapeng Zhang:
  Barriers to Black-Box Constructions of Traitor Tracing Systems. TCC (1) 2017: 3-30
• 
  Shweta Agrawal, Alon Rosen:
  Functional Encryption for Bounded Collusions, Revisited. TCC (1) 2017: 173-205
• 
  Joël Alwen, Björn Tackmann:
  Moderately Hard Functions: Definition, Instantiations, and Applications. TCC (1) 2017: 493-526
• 
  Prabhanjan Ananth, Abhishek Jain:
  On Secure Two-Party Computation in Three Rounds. TCC (1) 2017: 612-644
• 
  Saikrishna Badrinarayanan, Vipul Goyal, Abhishek Jain, Dakshita Khurana, Amit Sahai:
  Round Optimal Concurrent MPC via Strong Simulation. TCC (1) 2017: 743-775
• 
  Jeremiah Blocki, Samson Zhou:
  On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i. TCC (1) 2017: 445-465
• 
  Dan Boneh, Sam Kim, David J. Wu:
  Constrained Keys for Invertible Pseudorandom Functions. TCC (1) 2017: 237-263
• 
  Zvika Brakerski, Shai Halevi, Antigoni Polychroniadou:
  Four Round Secure Computation Without Setup. TCC (1) 2017: 645-677
• 
  Zvika Brakerski, Rotem Tsabary, Vinod Vaikuntanathan, Hoeteck Wee:
  Private Constrained PRFs (and More) from LWE. TCC (1) 2017: 264-302
• 
  Joshua Brody, Stefan Dziembowski, Sebastian Faust, Krzysztof Pietrzak:
  Position-Based Cryptography and Multiparty Communication Complexity. TCC (1) 2017: 56-81
• 
  Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
  Round-Optimal Secure Two-Party Computation from Trapdoor Permutations. TCC (1) 2017: 678-710
• 
  Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
  Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds. TCC (1) 2017: 711-742
• 
  Vanesa Daza, Nikolaos Makriyannis:
  Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions. TCC (1) 2017: 581-611
• 
  Nico Döttling, Sanjam Garg:
  From Selective IBE to Full IBE and Selective HIBE. TCC (1) 2017: 372-408
• 
  Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed:
  When Does Functional Encryption Imply Obfuscation? TCC (1) 2017: 82-115
• 
  Shafi Goldwasser, Saleet Klein, Daniel Wichs:
  The Edited Truth. TCC (1) 2017: 305-340
• 
  Rishab Goyal, Vipul Goyal:
  Overcoming Cryptographic Impossibility Results Using Blockchains. TCC (1) 2017: 529-561
• 
  Dennis Hofheinz, Kathrin Hövelmanns, Eike Kiltz:
  A Modular Analysis of the Fujisaki-Okamoto Transformation. TCC (1) 2017: 341-371
• 
  Tibor Jager, Martijn Stam, Ryan Stanley-Oakes, Bogdan Warinschi:
  Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy. TCC (1) 2017: 409-441
• 
  Susumu Kiyoshima, Huijia Lin, Muthuramakrishnan Venkitasubramaniam:
  A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models. TCC (1) 2017: 776-809
• 
  Yehuda Lindell, Tal Rabin:
  Secure Two-Party Computation with Fairness - A Necessary Design Principle. TCC (1) 2017: 565-580
• 
  Qipeng Liu, Mark Zhandry:
  Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness. TCC (1) 2017: 138-169
• 
  Alex Lombardi, Vinod Vaikuntanathan:
  Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation. TCC (1) 2017: 119-137
• 
  Shachar Lovett, Jiapeng Zhang:
  On the Impossibility of Entropy Reversal, and Its Application to Zero-Knowledge Proofs. TCC (1) 2017: 31-55
• 
  Hoeteck Wee:
  Attribute-Hiding Predicate Encryption in Bilinear Groups, Revisited. TCC (1) 2017: 206-233
• 
  Yael Kalai, Leonid Reyzin:
  Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I. Lecture Notes in Computer Science 10677, Springer 2017, ISBN 978-3-319-70499-9 [contents]