A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Pairing-Based Cryptography: Past, Present, and Future
[chapter]
2012
Lecture Notes in Computer Science
While pairings were first introduced in cryptography as a tool to attack the discrete-log problem on certain elliptic curves, they have since found numerous applications in the construction of cryptographic systems. To this day many problems can only be solved using pairings. A few examples include collusionresistant broadcast encryption and traitor tracing with short keys, 3-way Diffie-Hellman, and short signatures.
doi:10.1007/978-3-642-34961-4_1
fatcat:t37a37zs5bbq5hpsaeeo66c2de