A TPM Diffie-Hellman Oracle

Tolga Acar; Lan Nguyen; Greg Zaverucha

Paper 2013/667 Original: eprint.iacr.org/2013/667 ↗

A TPM Diffie-Hellman Oracle

Tolga Acar

Lan Nguyen

Greg Zaverucha

Abstract

This note describes a Diffie-Hellman oracle, constructed using standard Trusted Platform Module (TPM) signature APIs. The oracle allows one to compute the exponentiation of an arbitrary group element to a specified TPM-protected private key. By employing the oracle, the security provided by a group of order p is reduced by log k bits, provided k oracle queries are made and p +/- 1 is divisible by k. The security reduction follows from a straightforward application of results from Brown and Gallant (IACR ePrint 2004/306) and Cheon (Eurocrypt 2006) on the strong Diffie-Hellman problem. On a more positive note, the oracle may allow a wider range of cryptographic protocols to make use of the TPM.

Metadata

Available format(s): PDF
Publication info: Preprint.
History: 2013-10-24: last updated; 2013-10-24: published
Short URL: https://ia.cr/2013/667
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2013/667,
      author = {Tolga Acar and Lan Nguyen and Greg Zaverucha},
      title = {A TPM Diffie-Hellman Oracle},
      howpublished = {Cryptology {ePrint} Archive, Paper 2013/667},
      year = {2013},
      url = {https://eprint.iacr.org/2013/667}
}