Paper 2002/155

Secure Bilinear Diffie-Hellman Bits

Steven D. Galbraith, Herbie J. Hopkins, and Igor E. Shparlinski

Abstract

The Weil and Tate pairings are a popular new gadget in cryptography and have found many applications, including identity-based cryptography. In particular, the pairings have been used for key exchange protocols. This paper studies the bit security of keys obtained using protocols based on pairings (that is, we show that obtaining certain bits of the common key is as hard as computing the entire key). These results are valuable as they give insight into how many ``hard-core'' bits can be obtained from key exchange using pairings.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
pairingsbit security
Contact author(s)
Steven Galbraith @ rhul ac uk
History
2002-10-15: received
Short URL
https://ia.cr/2002/155
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2002/155,
      author = {Steven D.  Galbraith and Herbie J.  Hopkins and Igor E.  Shparlinski},
      title = {Secure Bilinear Diffie-Hellman Bits},
      howpublished = {Cryptology ePrint Archive, Paper 2002/155},
      year = {2002},
      note = {\url{https://eprint.iacr.org/2002/155}},
      url = {https://eprint.iacr.org/2002/155}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.