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 collusion-resistant broadcast encryption and traitor tracing with short keys, 3-way Diffie-Hellman, and short signatures.
CITATION STYLE
Boneh, D. (2012). Pairing-Based Cryptography: Past, Present, and Future (pp. 1–1). https://doi.org/10.1007/978-3-642-34961-4_1
Mendeley helps you to discover research relevant for your work.