Universally Composable Direct Anonymous Attestation

@article{Camenisch2015UniversallyCD,
  title={Universally Composable Direct Anonymous Attestation},
  author={Jan Camenisch and Manu Drijvers and Anja Lehmann},
  journal={IACR Cryptology ePrint Archive},
  year={2015},
  volume={2015},
  pages={1246}
}
Direct Anonymous Attestation (DAA) is one of the most complex cryptographic algorithms that has been deployed in practice. In spite of this, and the long body of work on the subject, there is still no fully satisfactory security definition for DAA. This was already acknowledged by Bernard et al. (IJIC’13) who showed that in existing models even fully insecure protocols may be deemed secure. Bernard et al. therefore proposed an extensive set of security games, which however aimed only at a… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Anonymous attestation with user-controlled linkability

International Journal of Information Security • 2011
View 10 Excerpts
Highly Influenced

On the Design and Implementation of an Efficient DAA Scheme

IACR Cryptology ePrint Archive • 2009
View 13 Excerpts
Highly Influenced

A DAA Scheme Requiring Less TPM Resources

IACR Cryptology ePrint Archive • 2009
View 4 Excerpts
Highly Influenced

DAA: Fixing the pairing based protocols

IACR Cryptology ePrint Archive • 2009
View 4 Excerpts
Highly Influenced

On Proofs of Security for DAA Schemes

View 6 Excerpts
Highly Influenced

Pairings in Trusted Computing

View 6 Excerpts
Highly Influenced

Simplified security notions of direct anonymous attestation and a concrete scheme from pairings

International Journal of Information Security • 2008
View 10 Excerpts
Highly Influenced

On the Portability of Generalized Schnorr Proofs

IACR Cryptology ePrint Archive • 2009
View 2 Excerpts

Direct anonymous attestation

ACM Conference on Computer and Communications Security • 2004
View 11 Excerpts

Similar Papers

Loading similar papers…