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

• 2017
• 
  Nuttapong Attrapadung:
  Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits. Public Key Cryptography (2) 2017: 3-35
• 
  Mihir Bellare, Bertram Poettering, Douglas Stebila:
  Deterring Certificate Subversion: Efficient Double-Authentication-Preventing Signatures. Public Key Cryptography (2) 2017: 121-151
• 
  Daniel Benarroch, Zvika Brakerski, Tancrède Lepoint:
  FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime. Public Key Cryptography (2) 2017: 271-301
• 
  Fabrice Benhamouda, Florian Bourse, Helger Lipmaa:
  CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions. Public Key Cryptography (2) 2017: 36-66
• 
  Dan Boneh, Kevin Lewi, David J. Wu:
  Constraining Pseudorandom Functions Privately. Public Key Cryptography (2) 2017: 494-524
• 
  Chris Brzuska, Håkon Jacobsen:
  A Modular Security Analysis of EAP and IEEE 802.11. Public Key Cryptography (2) 2017: 335-365
• 
  Jan Camenisch, David Derler, Stephan Krenn, Henrich C. Pöhls, Kai Samelin, Daniel Slamanig:
  Chameleon-Hashes with Ephemeral Trapdoors - And Applications to Invisible Sanitizable Signatures. Public Key Cryptography (2) 2017: 152-182
• 
  Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam:
  Better Two-Round Adaptive Multi-party Computation. Public Key Cryptography (2) 2017: 396-427
• 
  Ran Canetti, Srinivasan Raghuraman, Silas Richelson, Vinod Vaikuntanathan:
  Chosen-Ciphertext Secure Fully Homomorphic Encryption. Public Key Cryptography (2) 2017: 213-240
• 
  Wutichai Chongchitmate, Rafail Ostrovsky:
  Circuit-Private Multi-key FHE. Public Key Cryptography (2) 2017: 241-270
• 
  Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay:
  Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation. Public Key Cryptography (2) 2017: 463-493
• 
  Georg Fuchsbauer, Romain Gay, Lucas Kowalczyk, Claudio Orlandi:
  Access Control Encryption for Equality, Comparison, and More. Public Key Cryptography (2) 2017: 88-118
• 
  Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
  Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model. Public Key Cryptography (2) 2017: 428-460
• 
  Gene Itkis, Emily Shen, Mayank Varia, David Wilson, Arkady Yerukhimovich:
  Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions. Public Key Cryptography (2) 2017: 67-87
• 
  Charanjit S. Jutla, Arnab Roy:
  Improved Structure Preserving Signatures Under Standard Bilinear Assumptions. Public Key Cryptography (2) 2017: 183-209
• 
  Aggelos Kiayias, Thomas Zacharias, Bingsheng Zhang:
  Ceremonies for End-to-End Verifiable Elections. Public Key Cryptography (2) 2017: 305-334
• 
  Venkata Koppula, Andrew Poelstra, Brent Waters:
  Universal Samplers with Fast Verification. Public Key Cryptography (2) 2017: 525-554
• 
  Jesper Buus Nielsen, Samuel Ranellucci:
  On the Computational Overhead of MPC with Dishonest Majority. Public Key Cryptography (2) 2017: 369-395
• 
  Serge Fehr:
  Public-Key Cryptography - PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II. Lecture Notes in Computer Science 10175, Springer 2017, ISBN 978-3-662-54387-0 [contents]