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

• 2020
• 
  Gil Segev, Ido Shahaf:
  Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective. ITC 2020: 10:1-10:23
• 
  Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi:
  Oblivious Parallel Tight Compaction. ITC 2020: 11:1-11:23
• 
  Victor Balcer, Albert Cheu:
  Separating Local & Shuffled Differential Privacy via Histograms. ITC 2020: 1:1-1:14
• 
  Amos Beimel, Aleksandra Korolova, Kobbi Nissim, Or Sheffet, Uri Stemmer:
  The Power of Synergy in Differential Privacy: Combining a Small Curator with Local Randomizers. ITC 2020: 14:1-14:25
• 
  Jeremiah Blocki, Shubhang Kulkarni, Samson Zhou:
  On Locally Decodable Codes in Resource Bounded Channels. ITC 2020: 16:1-16:23
• 
  Kai-Min Chung, Tai-Ning Liao, Luowen Qian:
  Lower Bounds for Function Inversion with Quantum Advice. ITC 2020: 8:1-8:15
• 
  Claude Crépeau, Arnaud Massenet, Louis Salvail, Lucas Shigeru Stinchcombe, Nan Yang:
  Practical Relativistic Zero-Knowledge for NP. ITC 2020: 4:1-4:18
• 
  Hendrik Eerikson, Marcel Keller, Claudio Orlandi, Pille Pullonen, Joonas Puura, Mark Simkin:
  Use Your Brain! Arithmetic 3PC for Any Modulus with Active Security. ITC 2020: 5:1-5:24
• 
  Reo Eriguchi, Noboru Kunihiro:
  d-Multiplicative Secret Sharing for Multipartite Adversary Structures. ITC 2020: 2:1-2:16
• 
  Badih Ghazi, Noah Golowich, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh, Ameya Velingker:
  Pure Differentially Private Summation from Anonymous Messages. ITC 2020: 15:1-15:23
• 
  Martin Hirt, Marta Mularczyk:
  Efficient MPC with a Mixed Adversary. ITC 2020: 3:1-3:23
• 
  Fuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi-Naini, Huaxiong Wang:
  Leakage-Resilient Secret Sharing in Non-Compartmentalized Models. ITC 2020: 7:1-7:24
• 
  Moni Naor, Lior Rotem, Gil Segev:
  Out-Of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery. ITC 2020: 9:1-9:25
• 
  Anat Paskin-Cherniavsky, Artiom Radune:
  On Polynomial Secret Sharing Schemes. ITC 2020: 12:1-12:21
• 
  Naty Peter, Rotem Tsabary, Hoeteck Wee:
  One-One Constrained Pseudorandom Functions. ITC 2020: 13:1-13:22
• 
  Peter Michael Reichstein Rasmussen, Amit Sahai:
  Expander Graphs Are Non-Malleable Codes. ITC 2020: 6:1-6:10
• 
  Front Matter, Table of Contents, Preface, Conference Organization. ITC 2020: 0:1-0:14
• 
  Yael Tauman Kalai, Adam D. Smith, Daniel Wichs:
  1st Conference on Information-Theoretic Cryptography, ITC 2020, June 17-19, 2020, Boston, MA, USA. LIPIcs 163, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-151-1 [contents]
• 2017
• 
  Gaurav Kumar Agarwal, Martina Cardone, Christina Fragouli:
  Secure Network Coding for Multiple Unicast: On the Case of Single Source. ICITS 2017: 188-207
• 
  Ashish Choudhury, Arpita Patra, Divya Ravi:
  Round and Communication Efficient Unconditionally-Secure MPC with t t n / 3 in Partially Synchronous Network. ICITS 2017: 83-109
• 
  Ronald Cramer, Ivan Damgård, Nico Döttling, Irene Giacomelli, Chaoping Xing:
  Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. ICITS 2017: 1-25
• 
  Robert K. Cunningham, Benjamin Fuller, Sophia Yakoubov:
  Catching MPC Cheaters: Identification and Openability. ICITS 2017: 110-134
• 
  Sabyasachi Dutta, Avishek Adhikari:
  Contrast Optimal XOR Based Visual Cryptographic Schemes. ICITS 2017: 58-72
• 
  Yuji Hashimoto, Kazumasa Shinagawa, Koji Nuida, Masaki Inamura, Goichiro Hanaoka:
  Secure Grouping Protocol Using a Deck of Cards. ICITS 2017: 135-152
• 
  Go Kato, Masaki Owari, Masahito Hayashi:
  Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free Public Communication. ICITS 2017: 166-187
• 
  Daniel Malinowski, Karol Zebrowski:
  Disproving the Conjectures from "On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model". ICITS 2017: 26-38
• 
  Takeshi Nakai, Satoshi Shirouchi, Mitsugu Iwamoto, Kazuo Ohta:
  Four Cards Are Sufficient for a Card-Based Three-Input Voting Protocol Utilizing Private Permutations. ICITS 2017: 153-165
• 
  Yohei Watanabe:
  Broadcast Encryption with Guessing Secrecy. ICITS 2017: 39-57
• 
  Maki Yoshida, Satoshi Obana:
  Verifiably Multiplicative Secret Sharing. ICITS 2017: 73-82
• 
  Lei Yu, Vincent Y. F. Tan:
  Rényi Resolvability and Its Applications to the Wiretap Channel. ICITS 2017: 208-233

skipping 161 more matches