On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings

DOI10.1007/978-3-642-13797-6_9zbMath1232.94014OpenAlexW2114896656MaRDI QIDQ3578469

Darrel Hankerson, Sanjit Chatterjee, Alfred J. Menezes

Publication date: 20 July 2010

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.170.2359

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves ⋮ New versions of Miller-loop secured against side-channel attacks ⋮ On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited ⋮ A new approach to practical function-private inner product encryption

This page was built for publication: On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings