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

• 2013
• 
  Michel Abdalla, Tanja Lange:
  Pairing-Based Cryptography - Pairing 2012 - 5th International Conference, Cologne, Germany, May 16-18, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7708, Springer 2013, ISBN 978-3-642-36333-7 [contents]
• 2012
• 
  Tolga Acar, Kristin E. Lauter, Michael Naehrig, Daniel Shumow:
  Affine Pairings on ARM. Pairing 2012: 203-209
• 
  Diego F. Aranha, Laura Fuentes-Castañeda, Edward Knapp, Alfred Menezes, Francisco Rodríguez-Henríquez:
  Implementing Pairings at the 192-Bit Security Level. Pairing 2012: 177-195
• 
  Sébastien Canard, Nicolas Desmoulins, Julien Devigne, Jacques Traoré:
  On the Implementation of a Pairing-Based Cryptographic Protocol in a Constrained Device. Pairing 2012: 210-217
• 
  Angelo De Caro, Vincenzo Iovino, Giuseppe Persiano:
  Fully Secure Hidden Vector Encryption. Pairing 2012: 102-121
• 
  Jie Chen, Hoon Wei Lim, San Ling, Huaxiong Wang, Hoeteck Wee:
  Shorter IBE and Signatures via Asymmetric Pairings. Pairing 2012: 122-140
• 
  Shan Chen, Kunpeng Wang, Dongdai Lin:
  An Improved Twisted Ate Pairing over KSS Curves with k = 18. Pairing 2012: 35-45
• 
  Renaud Dubois, Aurore Guillevic, Marine Sengelin Le Breton:
  Improved Broadcast Encryption Scheme with Constant-Size Ciphertext. Pairing 2012: 196-202
• 
  Sylvain Duquesne, Emmanuel Fouotsa:
  Tate Pairing Computation on Jacobi's Elliptic Curves. Pairing 2012: 254-269
• 
  Jun Furukawa, Toshiyuki Isshiki:
  Controlled Joining on Encrypted Relational Database. Pairing 2012: 46-64
• 
  Martin Gagné, Shivaramakrishnan Narayan, Reihaneh Safavi-Naini:
  Short Pairing-Efficient Threshold-Attribute-Based Signature. Pairing 2012: 295-313
• 
  Santosh Ghosh, Ingrid Verbauwhede, Dipanwita Roy Chowdhury:
  Core Based Architecture to Speed Up Optimal Ate Pairing on FPGA Platform. Pairing 2012: 141-159
• 
  Aurore Guillevic, Damien Vergnaud:
  Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions. Pairing 2012: 234-253
• 
  Malika Izabachène, Benoît Libert:
  Divisible E-Cash in the Standard Model. Pairing 2012: 314-332
• 
  Yao Lu, Rui Zhang, Dongdai Lin:
  Stronger Security Model for Public-Key Encryption with Equality Test. Pairing 2012: 65-82
• 
  Juan Manuel González Nieto, Mark Manulis, Dongdong Sun:
  Forward-Secure Hierarchical Predicate Encryption. Pairing 2012: 83-101
• 
  Yusuke Sakai, Keita Emura, Goichiro Hanaoka, Yutaka Kawai, Takahiro Matsuda, Kazumasa Omote:
  Group Signatures with Message-Dependent Opening. Pairing 2012: 270-294
• 
  Yukihiro Uchida, Shigenori Uchiyama:
  The Tate-Lichtenbaum Pairing on a Hyperelliptic Curve via Hyperelliptic Nets. Pairing 2012: 218-233
• 
  Gavin Xiaoxu Yao, Junfeng Fan, Ray C. C. Cheung, Ingrid Verbauwhede:
  Faster Pairing Coprocessor Architecture. Pairing 2012: 160-176
• 
  Tomoko Yonemura, Taichi Isogai, Hirofumi Muratani, Yoshikazu Hanatani:
  Factor-4 and 6 (De)Compression for Values of Pairings Using Trace Maps. Pairing 2012: 19-34
• 
  Xusheng Zhang, Kunpeng Wang, Dongdai Lin:
  On Efficient Pairings on Elliptic Curves over Extension Fields. Pairing 2012: 1-18