On computable isomorphisms in efficient asymmetric pairing-based systems

DOI10.1016/j.dam.2006.07.004zbMath1123.94009OpenAlexW2122424963MaRDI QIDQ869575

Frederik Vercauteren, Nigel P. Smart

Publication date: 8 March 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.07.004

zbMATH Keywords

elliptic curveTate pairingpairing-based cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (7)

Constant Size Ring Signature Without Random Oracle ⋮ Certificateless public key encryption with equality test ⋮ Comparing two pairing-based aggregate signature schemes ⋮ On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited ⋮ Pairings for cryptographers ⋮ Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming ⋮ Efficient fully structure-preserving signatures and shrinking commitments

Cites Work

• Unnamed Item
• Identity-Based Encryption from the Weil Pairing
• Advances in Cryptology – CRYPTO 2004
• Selected Areas in Cryptography

This page was built for publication: On computable isomorphisms in efficient asymmetric pairing-based systems