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

• 2024
• 
  Akshima:
  Time-Space Tradeoffs for Finding Multi-Collisions in Merkle-Damgård Hash Functions. ITC 2024: 9:1-9:22
• 
  Benny Applebaum, Kaartik Bhushan, Manoj Prabhakaran:
  Communication Complexity vs Randomness Complexity in Interactive Proofs. ITC 2024: 2:1-2:16
• 
  D'or Banoun, Elette Boyle, Ran Cohen:
  Information-Theoretic Topology-Hiding Broadcast: Wheels, Stars, Friendship, and Beyond. ITC 2024: 1:1-1:13
• 
  Keller Blackwell, Mary Wootters:
  Improved Trade-Offs Between Amortization and Download Bandwidth for Linear HSS. ITC 2024: 7:1-7:21
• 
  Dana Dachman-Soled, Julian Loss, Adam O'Neill:
  Breaking RSA Generically Is Equivalent to Factoring, with Preprocessing. ITC 2024: 8:1-8:24
• 
  Yoav Ben Dov, Liron David, Moni Naor, Elad Tzalik:
  Are Your Keys Protected? Time Will Tell. ITC 2024: 3:1-3:28
• 
  Reo Eriguchi:
  Secure Multiparty Computation of Symmetric Functions with Polylogarithmic Bottleneck Complexity and Correlated Randomness. ITC 2024: 10:1-10:22
• 
  Karthik Gajulapalli, Alexander Golovnev, Samuel King:
  On the Power of Adaptivity for Function Inversion. ITC 2024: 5:1-5:10
• 
  Badih Ghazi, Ravi Kumar, Pasin Manurangsi:
  Pure-DP Aggregation in the Shuffle Model: Error-Optimal and Communication-Efficient. ITC 2024: 4:1-4:13
• 
  Pascal Giorgi, Fabien Laguillaumie, Lucas Ottow, Damien Vergnaud:
  Fast Secure Computations on Shared Polynomials and Applications to Private Set Operations. ITC 2024: 11:1-11:24
• 
  Yuval Ishai, Mahimna Kelkar, Daniel Lee, Yiping Ma:
  Information-Theoretic Single-Server PIR in the Shuffle Model. ITC 2024: 6:1-6:23
• 
  Front Matter, Table of Contents, Preface, Conference Organization. ITC 2024: 0:i-0:xii
• 
  Divesh Aggarwal:
  5th Conference on Information-Theoretic Cryptography, ITC 2024, August 14-16, 2024, Stanford, CA, USA. LIPIcs 304, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-333-1 [contents]
• 2023
• 
  Amos Beimel:
  Lower Bounds for Secret-Sharing Schemes for k-Hypergraphs. ITC 2023: 16:1-16:13
• 
  Fabrice Benhamouda, Shai Halevi, Lev Stambler:
  Weighted Secret Sharing from Wiretap Channels. ITC 2023: 8:1-8:19
• 
  Andrej Bogdanov:
  Csirmaz's Duality Conjecture and Threshold Secret Sharing. ITC 2023: 3:1-3:6
• 
  Samuel Bouaziz-Ermann, Alex B. Grilo, Damien Vergnaud:
  Quantum Security of Subset Cover Problems. ITC 2023: 9:1-9:17
• 
  Ivan Damgård, Daniel Escudero, Antigoni Polychroniadou:
  Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks. ITC 2023: 7:1-7:21
• 
  Ivan Damgård, Divya Ravi, Daniel Tschudi, Sophia Yakoubov:
  Secure Communication in Dynamic Incomplete Networks. ITC 2023: 13:1-13:21
• 
  Nils Fleischhacker, Suparno Ghoshal, Mark Simkin:
  Interactive Non-Malleable Codes Against Desynchronizing Attacks in the Multi-Party Setting. ITC 2023: 5:1-5:26
• 
  Cody Freitag, Ilan Komargodski:
  The Cost of Statistical Security in Proofs for Repeated Squaring. ITC 2023: 4:1-4:23
• 
  Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Jelani Nelson, Samson Zhou:
  Differentially Private Aggregation via Imperfect Shuffling. ITC 2023: 17:1-17:22
• 
  Vipul Goyal, Chen-Da Liu-Zhang, Rafail Ostrovsky:
  Asymmetric Multi-Party Computation. ITC 2023: 6:1-6:25
• 
  Mohammad Hajiabadi, Shahram Khazaei, Behzad Vahdani:
  Randomness Recoverable Secret Sharing Schemes. ITC 2023: 12:1-12:25
• 
  Keitaro Hiwatashi, Koji Nuida:
  Exponential Correlated Randomness Is Necessary in Communication-Optimal Perfectly Secure Two-Party Computation. ITC 2023: 18:1-18:16
• 
  Justin Holmgren, Ruta Jawale:
  Locally Covert Learning. ITC 2023: 14:1-14:12
• 
  Hannah Keller, Claudio Orlandi, Anat Paskin-Cherniavsky, Divya Ravi:
  MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More. ITC 2023: 11:1-11:22
• 
  Kasper Green Larsen, Maciej Obremski, Mark Simkin:
  Distributed Shuffling in Adversarial Environments. ITC 2023: 10:1-10:15
• 
  Mohammad Mahmoody, Wei Qi:
  Online Mergers and Applications to Registration-Based Encryption and Accumulators. ITC 2023: 15:1-15:23
• 
  Noam Mazor:
  A Lower Bound on the Share Size in Evolving Secret Sharing. ITC 2023: 2:1-2:9

skipping 50 more matches