Algebraic MACs and Keyed-Verification Anonymous Credentials

@inproceedings{Chase2014AlgebraicMA,
  title={Algebraic MACs and Keyed-Verification Anonymous Credentials},
  author={M. Chase and S. Meiklejohn and Gregory M. Zaverucha},
  booktitle={CCS '14},
  year={2014}
}
  • M. Chase, S. Meiklejohn, Gregory M. Zaverucha
  • Published in CCS '14 2014
  • Computer Science
  • We consider the problem of constructing anonymous credentials for use in a setting where the issuer of credentials is also the verifier, or more generally where the issuer and verifier have a shared key. In this setting we can use message authentication codes (MACs) instead of public key signatures as the basis for the credential system. To this end, we construct two algebraic MACs in prime-order groups, along with efficient protocols for issuing credentials, asserting possession of a… CONTINUE READING
    Short Randomizable Signatures
    • 115
    • PDF
    Bolt: Anonymous Payment Channels for Decentralized Currencies
    • 134
    • Highly Influenced
    • PDF
    Fast Keyed-Verification Anonymous Credentials on Standard Smart Cards
    • 8
    • Highly Influenced
    • PDF
    Practical Anonymous Password Authentication and TLS with Anonymous Client Authentication
    • 19
    • Highly Influenced

    References

    Publications referenced by this paper.
    U-Prove Cryptographic Specification V1.1 (Revision 3)
    • 135
    • Highly Influential