Name
Abstract | ||
|---|---|---|
Remote attestation presented in TCG specification is one of the significant ways to establish trust between the two endpoints. There are two categories of remote attestation: anonymous identity attestation of TPM and the security properties attestation of trust computing platform, and the verifier can verify both at the far endpoint. In order to simplify the attestations, we propose the hybrid attestation called APA(anonymous property attestation) from the elliptic curve cryptography and bilinear map. The scheme is provable security under the LRSW assumption, the hardness of discrete logarithms. The lengths of the attestation signature in our scheme are much shorter than directly associated two attestations, and also takes the less computation cost. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/CSE.2009.84 | CSE (2) |
Keywords | Field | DocType |
games,cryptographic protocols,data mining,elliptic curve cryptography,trusted computing,discrete logarithm,provable security,privacy,protocols,public key,bilinear map,public key cryptography,nickel,digital signatures | Bilinear map,Trusted Computing,Cryptographic protocol,Computer science,Computer network,Digital signature,Direct Anonymous Attestation,Elliptic curve cryptography,Public-key cryptography,Provable security | Conference |
Volume | Issue | Citations |
2 | null | 0 |
PageRank | References | Authors |
0.34 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu Qin | 1 | 7 | 2.90 |
| Deng-Guo Feng | 2 | 1991 | 190.95 |
| Zhen Xu | 3 | 23 | 4.21 |