%0 Journal Article
%A JIA Zong-pu
%A LI Jing
%A LIU Zhi-zhong
%A PENG Wei-ping
%A SONG Cheng
%T Research on Direct Anonymous Attestation Scheme Based on Bilinear Pairing
%D 2014
%R 10.13190/j.jbupt.2014.06.015
%J Journal of Beijing University of Posts and Telecommunications
%P 72-76
%V 37
%N 6
%X <p>Considering the current directory anonymous attestation (DAA) scheme complicated and time-consuming, which makes it limited in resource-constrained devices such as embedded, an improved DAA scheme is proposed. This scheme is based on bilinear pairing under the assumption of q strong Diffie-Hellman and decisional Diffie-Hellman. The analysis shows that this scheme is not only correct, security and anonymous, but also efficiently relieves the computation cost. This scheme further solves the computation bottleneck and accelerate application for DAA in mobile field.</p>
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2014.06.015