Secure Bilinear Diffie-Hellman Bits

Steven D.  Galbraith; Herbie J.  Hopkins; Igor E.  Shparlinski

Paper 2002/155 Original: eprint.iacr.org/2002/155 ↗

Secure Bilinear Diffie-Hellman Bits

Steven D. Galbraith

Herbie J. Hopkins

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
Category: Public-key cryptography
Publication info: Preprint.
History: 2002-10-15: last updated; 2002-10-15: published
Short URL: https://ia.cr/2002/155
License: https://creativecommons.org/licenses/by/4.0/

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},
      url = {https://eprint.iacr.org/2002/155}
}