An efficient PBA protocol based on elliptic curves

Remote attestation is one of the main topics in trusted computing research area. It has great significance in attesting trustworthiness of terminal platform and establishing remote trust relationship in distributed computing environment. Property-based attestation(PBA for short) is an emerging method in which binary integrity value has been replaced with secure property as the content to attest. PBA has drawn great attention for several aspects of advantages including better scalability, better usability and better protection on configuration privacy. Unfortunately, current PBA protocols have suffered a lot from low performance and high implementation cost. In these protocols, secure chip with only limited computation capacity is arranged to execute too much computations. This reasonless design not only makes the secure chip be a bottleneck of performance but also increases secure chip´s production cost. In this paper, we propose an efficient PBA protocol based on elliptic curve cryptography. Compared with existing schemes, our protocol greatly enhances performance with very limited cost. The basic idea to achieve this improvement is (1)transforming computations on large finite field executed by secure chip into computations in small group of elliptic curve points and (2)adopting batch proof skills and asymmetric pairings. Under random oracle model, our protocol is proved to be secure.