A TPM Die-Hellman Oracle
暂无分享,去创建一个
This note describes a Die-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 specied TPM-protected private key. By employing the oracle, the security provided by a group of order p is reduced by logk 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 Die-Hellman problem. On a more positive note, the oracle may allow a wider range of cryptographic protocols to make use of the TPM.
[1] Jung Hee Cheon,et al. Security Analysis of the Strong Diffie-Hellman Problem , 2006, EUROCRYPT.
[2] Yehuda Lindell,et al. Constructions of truly practical secure protocols using standardsmartcards , 2008, CCS.
[3] Benny Pinkas,et al. Secure Set Intersection with Untrusted Hardware Tokens , 2011, CT-RSA.