On computable isomorphisms in efficient asymmetric pairing-based systems

DOI10.1016/J.DAM.2006.07.004zbMATH Open1123.94009OpenAlexW2122424963MaRDI QIDQ869575FDOQ869575

Authors: N. P. Smart, Frederik Vercauteren 

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

Recommendations

• Generalizations of Verheul's theorem to asymmetric pairings
• Efficient implementation of pairing-based cryptosystems
• Simplified pairing computation and security implications
• On pairing-based cryptosystems
• Fast symmetric pairing revisited

zbMATH Keywords

elliptic curvepairing-based cryptographyTate pairing

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Identity-Based Encryption from the Weil Pairing
• Advances in Cryptology – CRYPTO 2004
• Selected Areas in Cryptography

Cited In (9)

• On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
• Certificateless public key encryption with equality test
• Pairings for cryptographers
• Comparing two pairing-based aggregate signature schemes
• Oracles for structural properties: The isomorphism problem and public-key cryptography
• Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming
• Constant Size Ring Signature Without Random Oracle
• Efficient fully structure-preserving signatures and shrinking commitments
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869575)