Secure bilinear Diffie-Hellman bits

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

Secure bilinear Diffie-Hellman bits

Steven D. Galbraith^*, Herbie J. Hopkins, Igor E. Shparlinski

^*Corresponding author for this work

Department of Computing

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

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 give insight into how many "hard-core" bits can be obtained from key exchange using pairings. The results are of practical importance. For instance, Scott and Barreto have recently used our results to justify the security of their compressed pairing technique.

Original language	English
Pages (from-to)	370-378
Number of pages	9
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3108
Publication status	Published - 2004

Access to Document

Link to publication in Scopus

Fingerprint Dive into the research topics of 'Secure bilinear Diffie-Hellman bits'. Together they form a unique fingerprint.

Cite this

@article{ff357d1961164ac1b6a7ba1623168d24,

title = "Secure bilinear Diffie-Hellman bits",

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 give insight into how many {"}hard-core{"} bits can be obtained from key exchange using pairings. The results are of practical importance. For instance, Scott and Barreto have recently used our results to justify the security of their compressed pairing technique.",

author = "Galbraith, {Steven D.} and Hopkins, {Herbie J.} and Shparlinski, {Igor E.}",

year = "2004",

language = "English",

volume = "3108",

pages = "370--378",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer, Springer Nature",

}

TY - JOUR

T1 - Secure bilinear Diffie-Hellman bits

AU - Galbraith, Steven D.

AU - Hopkins, Herbie J.

AU - Shparlinski, Igor E.

PY - 2004

Y1 - 2004

N2 - 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 give insight into how many "hard-core" bits can be obtained from key exchange using pairings. The results are of practical importance. For instance, Scott and Barreto have recently used our results to justify the security of their compressed pairing technique.

AB - 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 give insight into how many "hard-core" bits can be obtained from key exchange using pairings. The results are of practical importance. For instance, Scott and Barreto have recently used our results to justify the security of their compressed pairing technique.

UR - http://www.scopus.com/inward/record.url?scp=27144529800&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:27144529800

VL - 3108

SP - 370

EP - 378

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -