• Publications
  • Influence
Direct anonymous attestation
This paper describes the direct anonymous attestation scheme (DAA). This scheme was adopted by the Trusted Computing Group (TCG) as the method for remote authentication of a hardware module, calledExpand
  • 853
  • 89
Efficient Group Signature Schemes for Large Groups (Extended Abstract)
The class of compounds represented by the generic formula, Ln2(BO2)2(CO3)2x5H2O wherein Ln stands for a rare-earth element, have never been known to the art. These novel compounds are produced byExpand
  • 896
  • 86
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
A group signature scheme allows a group member to sign messages anonymously on behalf of the group. However, in the case of a dispute, the identity of a signature's originator can be revealed (only)Expand
  • 840
  • 75
Signature Schemes and Anonymous Credentials from Bilinear Maps
We propose a new and efficient signature scheme that is provably secure in the plain model. The security of our scheme is based on a discrete-logarithm-based assumption put forth by Lysyanskaya,Expand
  • 821
  • 71
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
A credential system is a system in which users can obtain credentials from organizations and demonstrate possession of these credentials. Such a system is anonymous when transactions carried out byExpand
  • 1,020
  • 70
A Signature Scheme with Efficient Protocols
Digital signature schemes are a fundamental cryptographic primitive, of use both in its own right, and as a building block in cryptographic protocol design. In this paper, we propose a practical andExpand
  • 646
  • 63
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
We introduce the notion of a dynamic accumulator. An accumulator scheme allows one to hash a large set of inputs into one short value, such that there is a short proof that a given input wasExpand
  • 725
  • 48
Practical Verifiable Encryption and Decryption of Discrete Logarithms
This paper addresses the problem of designing practical protocols for proving properties about encrypted data. To this end, it presents a variant of the new public key encryption of Cramer and ShoupExpand
  • 516
  • 31
Simulatable Adaptive Oblivious Transfer
We study an adaptivevariant of oblivious transfer in which a sender has Nmessages, of which a receiver can adaptively choose to receive kone-after-the-other, in such a way that (a) the sender learnsExpand
  • 213
  • 29
Compact E-Cash
This paper presents efficient off-line anonymous e-cash schemes where a user can withdraw a wallet containing 2 coins each of which she can spend unlinkably. Our first result is a scheme, secureExpand
  • 393
  • 27