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

• 2009
• 
  Giuseppe Ateniese, Karyn Benson, Susan Hohenberger:
  Key-Private Proxy Re-encryption. CT-RSA 2009: 279-294
• 
  Giuseppe Ateniese, Paolo Gasti:
  Universally Anonymous IBE Based on the Quadratic Residuosity Assumption. CT-RSA 2009: 32-47
• 
  Man Ho Au, Patrick P. Tsang, Willy Susilo, Yi Mu:
  Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems. CT-RSA 2009: 295-308
• 
  Mihir Bellare, Shanshan Duan, Adriana Palacio:
  Key Insulation and Intrusion Resilience over a Public Channel. CT-RSA 2009: 84-99
• 
  Alexandre Berzati, Cécile Canovas, Jean-Guillaume Dumas, Louis Goubin:
  Fault Attacks on RSA Public Keys: Left-To-Right Implementations Are Also Vulnerable. CT-RSA 2009: 414-428
• 
  Alexandra Boldyreva:
  Strengthening Security of RSA-OAEP. CT-RSA 2009: 399-413
• 
  Ee-Chien Chang, Chee Liang Lim, Jia Xu:
  Short Redactable Signatures Using Random Trees. CT-RSA 2009: 133-147
• 
  Crystal Clough, John Baena, Jintai Ding, Bo-Yin Yang, Ming-Shing Chen:
  Square, a New Multivariate Encryption Scheme. CT-RSA 2009: 252-264
• 
  Baudoin Collard, François-Xavier Standaert:
  A Statistical Saturation Attack against the Block Cipher PRESENT. CT-RSA 2009: 195-210
• 
  Rafael Dowsley, Jörn Müller-Quade, Anderson C. A. Nascimento:
  A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model. CT-RSA 2009: 240-251
• 
  Orr Dunkelman, Nathan Keller:
  Cryptanalysis of CTC2. CT-RSA 2009: 226-239
• 
  Anna Lisa Ferrara, Matthew Green, Susan Hohenberger, Michael Østergaard Pedersen:
  Practical Short Signature Batch Verification. CT-RSA 2009: 309-324
• 
  Matthew K. Franklin, Mark A. Gondree, Payman Mohassel:
  Communication-Efficient Private Protocols for Longest Common Subsequence. CT-RSA 2009: 265-278
• 
  David Galindo:
  Breaking and Repairing Damgård et al. Public Key Encryption Scheme with Non-interactive Opening. CT-RSA 2009: 389-398
• 
  Chong-zhi Gao, Baodian Wei, Dongqing Xie, Chunming Tang:
  Divisible On-Line/Off-Line Signatures. CT-RSA 2009: 148-163
• 
  Dmitry Khovratovich, Alex Biryukov, Ivica Nikolic:
  Speeding up Collision Search for Byte-Oriented Hash Functions. CT-RSA 2009: 164-181
• 
  Benoît Libert, Damien Vergnaud:
  Adaptive-ID Secure Revocable Identity-Based Encryption. CT-RSA 2009: 1-15
• 
  Andrew Y. Lindell:
  Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1. CT-RSA 2009: 66-83
• 
  Andrew Y. Lindell:
  Adaptively Secure Two-Party Computation with Erasures. CT-RSA 2009: 117-132
• 
  Andrew Y. Lindell:
  Local Sequentiality Does Not Help for Concurrent Composition. CT-RSA 2009: 372-388
• 
  Stefan Lucks, Andreas Schuler, Erik Tews, Ralf-Philipp Weinmann, Matthias Wenzel:
  Attacks on the DECT Authentication Mechanisms. CT-RSA 2009: 48-65
• 
  Takahiro Matsuda, Goichiro Hanaoka, Kanta Matsuura, Hideki Imai:
  An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations. CT-RSA 2009: 16-31
• 
  Christophe Petit, Jean-Jacques Quisquater, Jean-Pierre Tillich, Gilles Zémor:
  Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security. CT-RSA 2009: 182-194
• 
  Thomas Plos:
  Evaluation of the Detached Power Supply as Side-Channel Analysis Countermeasure for Passive UHF RFID Tags. CT-RSA 2009: 444-458
• 
  Thomas Popp, Mario Kirschbaum, Stefan Mangard:
  Practical Attacks on Masked Hardware. CT-RSA 2009: 211-225
• 
  Manoj Prabhakaran, Rui Xue:
  Statistically Hiding Sets. CT-RSA 2009: 100-116
• 
  Matthieu Rivain:
  Securing RSA against Fault Analysis by Double Addition Chain Exponentiation. CT-RSA 2009: 459-480
• 
  Kazuo Sakiyama, Tatsuya Yagi, Kazuo Ohta:
  Fault Analysis Attack against an AES Prototype Chip Using RSL. CT-RSA 2009: 429-443
• 
  Tomas Toft:
  Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values. CT-RSA 2009: 357-371
• 
  Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume:
  Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients. CT-RSA 2009: 340-356

skipping 2 more matches