• Publications
  • Influence
Introduction to Modern Cryptography
Preface I. Introduction and Classical Cryptography Introduction Cryptography and Modern Cryptography The Setting of Private-Key Encryption Historical Ciphers and Their Cryptanalysis Principles ofExpand
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
This paper was solicited by the Editors-in-Chief as one of the best papers from EUROCRYPT 2008, based on the recommendation of the program committee. Expand
Chosen-Ciphertext Security from Identity-Based Encryption
We propose a simple and efficient construction of a CCA-secure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Expand
A pairwise key predistribution scheme for wireless sensor networks
We propose a new key predistribution scheme which substantially improves the resilience of the network compared to previous schemes, and give an in-depth analysis of our scheme in terms of network resilience and associated overhead. Expand
Faster Secure Two-Party Computation Using Garbled Circuits
We demonstrate a generic approach to secure two-party computation for semi-honest participants that is significantly faster than any previously reported while also scaling to arbitrarily large circuits. Expand
Scalable Protocols for Authenticated Group Key Exchange
We consider the fundamental problem of authenticated group key exchange among n parties within a larger and insecure public network. Expand
A Forward-Secure Public-Key Encryption Scheme
We present the first constructions of a (non-interactive) forward-secure public-key encryption scheme. Expand
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
We show an efficient, 3-round, password-authenticated key exchange protocol with human-memorable passwords which is provably secure under the Decisional Diffie-Hellman assumption, yet requires only (roughly) 8 times more computation than "standard" key exchange. Expand
Ring Signatures: Stronger Definitions, and Constructions without Random Oracles
Ring signatures, first introduced by Rivest, Shamir, and Tauman, enable a user to sign a message so that a ring of possible signers (of which the user is a member) is identified, without revealingExpand
Efficiency improvements for signature schemes with tight security reductions
We present a modification of the probabilistic signature scheme (PSS) designed by Bellare and Rogaway in which signing is 33% more efficient and signatures are 75% shorter; the security of this scheme is tightly related to the decisional Diffie-Hellman problem. Expand