A new identification scheme based on the bilinear Diffle-Hellman problem

We construct an interactive identification scheme based on the bilinear Diffie-Hellman problem and analyze its security. This scheme is practical in terms of key size, communication complexity, and availability of identity-variance provided that an algorithm of computing the Weil-pairing is feasible. We prove that this scheme is secure against active attacks as well as passive attacks if the bilinear Diffie-Hellman problem is intractable. Our proof is based on the fact that the computational Diffie-Hellman problem is hard in the additive group of points of an elliptic curve over a finite field, on the other hand, the decisional Diffie-Hellman problem is easy in the multiplicative group of the finite field mapped by a bilinear map. Finally, this scheme is compared with other identification schemes.
Publisher
SPRINGER-VERLAG BERLIN
Issue Date
2002-07
Language
ENG
Keywords

PROOF SYSTEMS; SECURITY

Citation

INFORMATION SECURITY AND PRIVACY BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.2384, pp.362 - 378

ISSN
0302-9743
URI
http://hdl.handle.net/10203/16051
Appears in Collection
CS-Journal Papers(저널논문)
  • Hit : 122
  • Download : 24
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 6 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0