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

• 1998
• 
  Masayuki Abe:
  Universally Verifiable Mix-net with Verification Work Indendent of the Number of Mix-servers. EUROCRYPT 1998: 437-447
• 
  N. Asokan, Victor Shoup, Michael Waidner:
  Optimistic Fair Exchange of Digital Signatures (Extended Abstract). EUROCRYPT 1998: 591-606
• 
  Donald Beaver, Avishai Wool:
  Quorum-Based Secure Multi-party Computation. EUROCRYPT 1998: 375-390
• 
  Mihir Bellare, Juan A. Garay, Tal Rabin:
  Fast Batch Verification for Modular Exponentiation and Digital Signatures. EUROCRYPT 1998: 236-250
• 
  Mihir Bellare, Ted Krovetz, Phillip Rogaway:
  Luby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-invertible. EUROCRYPT 1998: 266-280
• 
  Eli Biham, Lars R. Knudsen:
  Cryptanalysis of the ANSI X9.52 CBCM Mode. EUROCRYPT 1998: 100-111
• 
  Alex Biryukov, Eyal Kushilevitz:
  Improved Cryptanalysis of RC5. EUROCRYPT 1998: 85-99
• 
  Matt Blaze, Gerrit Bleumer, Martin Strauss:
  Divertible Protocols and Atomic Proxy Cryptography. EUROCRYPT 1998: 127-144
• 
  Matt Blaze, Joan Feigenbaum, Moni Naor:
  A Formal Treatment of Remotely Keyed Encryption. EUROCRYPT 1998: 251-265
• 
  Dan Boneh, Ramarathnam Venkatesan:
  Breaking RSA May Not Be Equivalent to Factoring. EUROCRYPT 1998: 59-71
• 
  Victor Boyko, Marcus Peinado, Ramarathnam Venkatesan:
  Speeding up Discrete Log and Factoring Based Schemes via Precomputations. EUROCRYPT 1998: 221-235
• 
  Christian Cachin:
  On the Foundations of Oblivious Transfer. EUROCRYPT 1998: 361-374
• 
  Claude Carlet:
  On the Propagation Criterion of Degree l and Order k. EUROCRYPT 1998: 462-474
• 
  Agnes Hui Chan, Yair Frankel, Yiannis Tsiounis:
  Easy Come - Easy Go Divisible Cash. EUROCRYPT 1998: 561-575
• 
  Gérard D. Cohen, Antoine Lobstein, David Naccache, Gilles Zémor:
  How to Improve an Exponentiation Black-Box. EUROCRYPT 1998: 211-220
• 
  Don Coppersmith:
  Specialized Integer Factorization. EUROCRYPT 1998: 542-545
• 
  Eric Filiol, Caroline Fontaine:
  Highly Nonlinear Balanced Boolean Functions with a Good Correlation-Immunity. EUROCRYPT 1998: 475-488
• 
  Matthew K. Franklin, Rebecca N. Wright:
  Secure Communications in Minimal Connectivity Models. EUROCRYPT 1998: 346-360
• 
  Eiichiro Fujisaki, Tatsuaki Okamoto:
  A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications. EUROCRYPT 1998: 32-46
• 
  Philip Hawkes:
  Differential-Linear Weak Key Classes of IDEA. EUROCRYPT 1998: 112-126
• 
  Alain P. Hiltgen:
  Towards a Better Understanding of One-Wayness: Facing Linear Permutations. EUROCRYPT 1998: 319-333
• 
  Detlef Hühnlein, Michael J. Jacobson Jr., Sachar Paulus, Tsuyoshi Takagi:
  A Cryptosystem Based on Non-maximal Imaginary Quadratic Orders with Fast Decryption. EUROCRYPT 1998: 294-307
• 
  Markus Jakobsson:
  A Practical Mix. EUROCRYPT 1998: 448-461
• 
  Mariusz H. Jakubowski, Ramarathnam Venkatesan:
  The Chain & Sum Primitive and Its Applications to MACs and Stream Ciphers. EUROCRYPT 1998: 281-293
• 
  Charanjit S. Jutla:
  On Finding Small Solutions of Modular Multivariate Polynomial Equations. EUROCRYPT 1998: 158-170
• 
  Noboru Kunihiro, Kenji Koyama:
  Equivalence of Counting the Number of Points on Elliptic Curve over the Ring Z_n and Factoring n. EUROCRYPT 1998: 47-58
• 
  Kaoru Kurosawa, Yvo Desmedt:
  Optimum Traitor Tracing and Asymmetric Schemes. EUROCRYPT 1998: 145-157
• 
  Michael Luby, Jessica Staddon:
  Combinatorial Bounds for Broadcast Encryption. EUROCRYPT 1998: 512-526
• 
  Ueli M. Maurer, Stefan Wolf:
  Lower Bounds on Generic Algorithms in Groups. EUROCRYPT 1998: 72-84
• 
  Markus Michels, Markus Stadler:
  Generic Constructions for Secure and Efficient Confirmer Signature Schemes. EUROCRYPT 1998: 406-421

skipping 15 more matches